You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+29-22Lines changed: 29 additions & 22 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -182,35 +182,42 @@ For more examples, visit the [examples directory](https://github.com/noneback/go
182
182
183
183
The following benchmarks provide a rough estimate of pure scheduling overhead using empty task functions. Note that most realistic workloads are I/O-bound, and their performance cannot be accurately reflected by these results. For CPU-intensive tasks, consider using [taskflow-cpp](https://github.com/taskflow/taskflow).
184
184
185
+
Benchmark naming: `N{task_count}-C{concurrency}` where concurrency is goroutine pool size.
- Memory allocation reduced by ~40-45% due to lazy span creation (observer optimization)
218
+
- Concurrent tasks show ~30-40% lower latency
219
+
-~6-7 allocs per task (down from ~8-9)
220
+
214
221
## Understanding Conditional Tasks
215
222
216
223
Conditional nodes in go-taskflow behave similarly to those in [taskflow-cpp](https://github.com/taskflow/taskflow). They participate in both conditional control and looping. To avoid common pitfalls, refer to the [Conditional Tasking documentation](https://taskflow.github.io/taskflow/ConditionalTasking.html).
0 commit comments