zoo-bench - 2026-10-11 - AMD EPYC 7763 64-Core Processor

zoo-framework 0.9.0
benchmark

Same-caliber comparison against 5 baselines: apscheduler, asyncio_pool, bare_thread, process_pool, thread_pool. Every number was re-measured on this machine by zoo-bench and published per tier, including the tiers the framework under test loses.

raw data: results/zoo-framework-0.9.0/20261011T092749Z.json

zoo-bench report

Run environment

itemvalue
CPU modelAMD EPYC 7763 64-Core Processor
logical cores4
platformLinux-x86_64
operating systemLinux 6.17.0-1022-azure (#22-Ubuntu SMP Mon Jul 27 17:24:03 UTC 2026)
PythonCPython 3.13.16
interpreter/opt/hostedtoolcache/Python/3.13.16/x64/bin/python
GILdefault
framework under test (distribution metadata)0.9.0
framework under test (module __version__)0.9.0 (footnote only, not the version criterion)
drive-surface generation of the framework under testcurrent-generation drive surface (scheduling core + scheduling model; the completion signal comes from the result reactor)
harnesszoo-bench 0.0.1 @ 9a42be24ac43f75e2e5d7b16434f91ba3d0717b6
command to reproducezoo-bench run --framework zoo-framework==0.9.0

data: Run environment

Run environment

Run environment (cont.)

dist_version (the distribution metadata) is the source of truth; module_version is only a footnote

data: Run environment

zoo-bench report

Workload

  • composition: one unit of work = JSON serialize + deserialize + string concatenation, repeated until the target duration is reached; the tiers are declared by body_tiers_us in matrix.yaml
  • the workload is a stand-in, not a real trace: its shape resembles business actions such as 'take a frame of data -> serialize -> parse -> transform strings', but this repository holds no real trace, so every conclusion is conditional on that

data: Workload

zoo-bench report

Measurement methodology

  • the body duration is instrumented within the same run: the body measures itself internally and reports back; framework overhead = end-to-end - it. No cross-run subtraction - two runs differ in state (caches, frequencies, scheduling noise), so subtracting introduces systematic bias.
  • warmups are excluded from statistics: each unit first runs 3 warmup rounds that are discarded, then only the following 30 measured rounds are counted; the sample count equals 'measured rounds x concurrency'.
  • absolute durations are not comparable across runs: they only show the order of magnitude; across versions/machines read the relative quantities within the same run (overhead share, multiples against the baselines), which are insensitive to overall speed.

data: Measurement methodology

zoo-bench report

Conclusion summary

  • Once the framework under test zoo runs a body of about 2700 microseconds or more, its framework overhead drops below 15% of end-to-end; below that tier, the main price of choosing it is the framework overhead itself.
  • At concurrency 1 and a 40 microsecond body, the framework under test is 1.83x faster than process_pool (the fastest measured tier at that concurrency).
  • At concurrency 1, once the body exceeds about 40 microseconds, apscheduler is no longer faster than the framework under test.
  • At concurrency 4, once the body exceeds about 40 microseconds, apscheduler is no longer faster than the framework under test.
  • At concurrency 16, once the body exceeds about 40 microseconds, apscheduler is no longer faster than the framework under test.

data: Conclusion summary

Conclusion summary

Conclusion summary (cont.)

  • At concurrency 64, once the body exceeds about 40 microseconds, apscheduler is no longer faster than the framework under test.
  • At concurrency 1, within the measured tiers asyncio_pool is always faster than the framework under test - tiers like these are exactly the openly published unfavourable data of this report.
  • At concurrency 4, within the measured tiers asyncio_pool is always faster than the framework under test - tiers like these are exactly the openly published unfavourable data of this report.
  • At concurrency 16, within the measured tiers asyncio_pool is always faster than the framework under test - tiers like these are exactly the openly published unfavourable data of this report.

data: Conclusion summary

Conclusion summary

the rest of this section's details are in the full report

For one conclusion per slide, only the first 2 slides of this section are shown; the remaining 9 slides of per-unit numbers, percentiles and raw samples sit in the same section of the full report, verbatim checkable.

full report: the "Conclusion summary" section of report.md in the same directory

Conclusion summary - framework overhead share

2.55%

Framework overhead share of zoo at body tier 10000 microseconds.
3 baselines are lower at this tier: asyncio_pool, bare_thread, thread_pool.
same-tier comparison: apscheduler 3.19%, asyncio_pool 1.54%, bare_thread 1.25%, process_pool 3.45%, thread_pool 0.67%

data: zoo-bench "framework overhead share" at concurrency 1, body tier 10000 microseconds

Dimension: Latency percentiles and jitter

Latency percentiles and jitter at concurrency 1

concurrency 1 - end-to-end / concurrency

body tier 40 microseconds
zoo
182.57 microseconds
apscheduler
288.52 microseconds
asyncio_pool
140.37 microseconds
bare_thread
148.91 microseconds
process_pool
333.53 microseconds
thread_pool
75.77 microseconds
body tier 300 microseconds
zoo
449.17 microseconds
apscheduler
542.76 microseconds
asyncio_pool
386.47 microseconds
bare_thread
384.68 microseconds
process_pool
607.37 microseconds
thread_pool
322.77 microseconds
framework under testbaselinebar length = multiple relative to the framework under test; 1.0 is parity; longer is worse

data: zoo-bench "Latency percentiles and jitter" at concurrency 1 - per-unit numbers and percentiles are in the same section of report.md

Dimension: Latency percentiles and jitter

Latency percentiles and jitter at concurrency 1 (cont.)

concurrency 1 - end-to-end / concurrency

body tier 2700 microseconds
zoo
2.754 milliseconds
apscheduler
2.999 milliseconds
asyncio_pool
2.752 milliseconds
bare_thread
2.672 milliseconds
process_pool
3.009 milliseconds
thread_pool
2.689 milliseconds
body tier 10000 microseconds
zoo
10.066 milliseconds
apscheduler
9.971 milliseconds
asyncio_pool
9.482 milliseconds
bare_thread
9.648 milliseconds
process_pool
9.888 milliseconds
thread_pool
9.361 milliseconds
framework under testbaselinebar length = multiple relative to the framework under test; 1.0 is parity; longer is worse

data: zoo-bench "Latency percentiles and jitter" at concurrency 1 - per-unit numbers and percentiles are in the same section of report.md

zoo-bench report

Dimension: Latency percentiles and jitter

end-to-end / concurrency; percentiles and relative spread are given in the same table - a metric that only gives the median is not acceptable

concurrencybody tier (microseconds)zooapschedulerasyncio_poolbare_threadprocess_poolthread_pool
140182.57 microseconds288.52 microseconds140.37 microseconds148.91 microseconds333.53 microseconds75.77 microseconds
1300449.17 microseconds542.76 microseconds386.47 microseconds384.68 microseconds607.37 microseconds322.77 microseconds
127002.754 milliseconds2.999 milliseconds2.752 milliseconds2.672 milliseconds3.009 milliseconds2.689 milliseconds
11000010.066 milliseconds9.971 milliseconds9.482 milliseconds9.648 milliseconds9.888 milliseconds9.361 milliseconds
440206.14 microseconds256.36 microseconds173.04 microseconds199.87 microseconds168.78 microseconds96.03 microseconds
4300485.26 microseconds511.06 microseconds407.48 microseconds419.42 microseconds304.29 microseconds350.77 microseconds
427002.946 milliseconds2.983 milliseconds2.755 milliseconds2.706 milliseconds1.385 milliseconds2.742 milliseconds
41000010.106 milliseconds10.258 milliseconds9.867 milliseconds9.696 milliseconds4.621 milliseconds9.813 milliseconds
1640205.75 microseconds224.01 microseconds134.08 microseconds167.78 microseconds149.92 microseconds90.21 microseconds
16300470.57 microseconds505.14 microseconds393.00 microseconds424.88 microseconds278.51 microseconds343.15 microseconds

data: Dimension: Latency percentiles and jitter

Dimension: Latency percentiles and jitter

Dimension: Latency percentiles and jitter (cont.)

concurrencybody tier (microseconds)zooapschedulerasyncio_poolbare_threadprocess_poolthread_pool
1627002.899 milliseconds2.980 milliseconds2.802 milliseconds2.711 milliseconds1.370 milliseconds2.772 milliseconds
161000010.084 milliseconds9.881 milliseconds9.935 milliseconds9.609 milliseconds4.741 milliseconds9.803 milliseconds
6440207.28 microseconds220.85 microseconds120.26 microseconds171.52 microseconds194.08 microseconds89.21 microseconds
64300491.01 microseconds501.75 microseconds384.40 microseconds424.30 microseconds299.76 microseconds350.35 microseconds
6427002.953 milliseconds2.965 milliseconds2.811 milliseconds2.675 milliseconds1.364 milliseconds2.696 milliseconds
641000010.538 milliseconds10.167 milliseconds10.407 milliseconds9.827 milliseconds4.686 milliseconds10.244 milliseconds

per-unit values (percentiles, spread, raw per-round samples) are in 'Appendix: all values' at the end.

data: Dimension: Latency percentiles and jitter

Dimension: Framework overhead share

Framework overhead share at concurrency 1

concurrency 1 - framework overhead

body tier 40 microseconds
zoo
71.66%
apscheduler
79.81%
asyncio_pool
67.08%
bare_thread
64.13%
process_pool
83.82%
thread_pool
41.38%
body tier 300 microseconds
zoo
32.12%
apscheduler
44.93%
asyncio_pool
26.24%
bare_thread
25.34%
process_pool
48.87%
thread_pool
11.10%
framework under testbaselinebar length = multiple relative to the framework under test; 1.0 is parity; longer is worse

data: zoo-bench "Framework overhead share" at concurrency 1 - per-unit numbers and percentiles are in the same section of report.md

Dimension: Framework overhead share

Framework overhead share at concurrency 1 (cont.)

concurrency 1 - framework overhead

body tier 2700 microseconds
zoo
5.65%
apscheduler
9.02%
asyncio_pool
4.58%
bare_thread
4.02%
process_pool
11.37%
thread_pool
2.35%
body tier 10000 microseconds
zoo
2.55%
apscheduler
3.19%
asyncio_pool
1.54%
bare_thread
1.25%
process_pool
3.45%
thread_pool
0.67%
framework under testbaselinebar length = multiple relative to the framework under test; 1.0 is parity; longer is worse

data: zoo-bench "Framework overhead share" at concurrency 1 - per-unit numbers and percentiles are in the same section of report.md

zoo-bench report

Dimension: Framework overhead share

overhead = end-to-end / concurrency - the body duration measured within the same run (no cross-run subtraction). cells with -: that concurrency exceeds this machine's parallel capacity; the body's self-reported duration contains scheduling waits from oversubscription and is not comparable with the row's end-to-end per task, so no overhead figure is given (end-to-end and throughput live in their own dimensions)

concurrencybody tier (microseconds)zooapschedulerasyncio_poolbare_threadprocess_poolthread_pool
14071.66%79.81%67.08%64.13%83.82%41.38%
130032.12%44.93%26.24%25.34%48.87%11.10%
127005.65%9.02%4.58%4.02%11.37%2.35%
1100002.55%3.19%1.54%1.25%3.45%0.67%
44073.26%78.08%68.70%70.52%67.43%48.25%
430036.28%39.64%25.85%28.21%-14.92%

data: Dimension: Framework overhead share

Dimension: Framework overhead share

Dimension: Framework overhead share (cont.)

concurrencybody tier (microseconds)zooapschedulerasyncio_poolbare_threadprocess_poolthread_pool
427007.68%8.71%4.45%4.05%-2.85%
410000------
1640------
16300------
162700------
1610000------
6440------
64300------
642700------
6410000------

per-unit values (percentiles, spread, raw per-round samples) are in 'Appendix: all values' at the end.

data: Dimension: Framework overhead share

Dimension: Throughput and concurrency scaling

Throughput and concurrency scaling at concurrency 1

concurrency 1 - throughput

body tier 40 microseconds
zoo
5,477 tasks/s
apscheduler
3,466 tasks/s
asyncio_pool
7,124 tasks/s
bare_thread
6,716 tasks/s
process_pool
2,998 tasks/s
thread_pool
13,198 tasks/s
body tier 300 microseconds
zoo
2,226 tasks/s
apscheduler
1,842 tasks/s
asyncio_pool
2,588 tasks/s
bare_thread
2,600 tasks/s
process_pool
1,646 tasks/s
thread_pool
3,098 tasks/s
framework under testbaselinebar length = multiple relative to the framework under test; 1.0 is parity; longer is worse

data: zoo-bench "Throughput and concurrency scaling" at concurrency 1 - per-unit numbers and percentiles are in the same section of report.md

Dimension: Throughput and concurrency scaling

Throughput and concurrency scaling at concurrency 1 (cont.)

concurrency 1 - throughput

body tier 2700 microseconds
zoo
363 tasks/s
apscheduler
333 tasks/s
asyncio_pool
363 tasks/s
bare_thread
374 tasks/s
process_pool
332 tasks/s
thread_pool
372 tasks/s
body tier 10000 microseconds
zoo
99 tasks/s
apscheduler
100 tasks/s
asyncio_pool
105 tasks/s
bare_thread
104 tasks/s
process_pool
101 tasks/s
thread_pool
107 tasks/s
framework under testbaselinebar length = multiple relative to the framework under test; 1.0 is parity; longer is worse

data: zoo-bench "Throughput and concurrency scaling" at concurrency 1 - per-unit numbers and percentiles are in the same section of report.md

zoo-bench report

Dimension: Throughput and concurrency scaling

throughput = concurrency / median end-to-end; whether it keeps rising with concurrency is the scaling behaviour

concurrencybody tier (microseconds)zooapschedulerasyncio_poolbare_threadprocess_poolthread_pool
1405477.43466.07123.96715.52998.213198.4
13002226.31842.42587.52599.61646.43098.1
12700363.1333.4363.4374.3332.3371.9
11000099.3100.3105.5103.6101.1106.8
44019404.415602.923116.520013.023699.241654.8
43008242.97826.89816.59537.013145.411403.4
427001357.71341.01451.91478.12888.81459.0
410000395.8389.9405.4412.6865.5407.6
164077763.471424.4119331.095364.7106727.0177361.2
1630034001.331674.540712.637658.157448.946626.5
1627005518.75369.85711.15901.511678.35772.6

data: Dimension: Throughput and concurrency scaling

Dimension: Throughput and concurrency scaling

Dimension: Throughput and concurrency scaling (cont.)

concurrencybody tier (microseconds)zooapschedulerasyncio_poolbare_threadprocess_poolthread_pool
16100001586.71619.21610.51665.23375.11632.1
6440308754.3289794.7532160.1373124.9329761.1717389.6
64300130343.7127553.4166491.4150836.5213501.9182674.1
64270021671.421585.822767.323921.946909.723741.9
64100006073.56294.86149.56512.813657.96247.3

per-unit values (percentiles, spread, raw per-round samples) are in 'Appendix: all values' at the end.

data: Dimension: Throughput and concurrency scaling

zoo-bench report

Dimension: Overhead attribution

scope: splits the per-task end-to-end into submit side / handoff / body / return and, at the same tier and concurrency, compares each segment against every baseline, answering 'which segment the excess falls on'. It is diagnostic, not the main evidence: it samples a small set of tiers, and does not compare total overhead against the baselines. A negative handoff is not an error: it means the submit call had not returned yet while the body was already running - schemes that count thread creation as submit side behave this way (measured: bare_thread handoff -343 microseconds). **The return segment includes waiting for th

e completion signal** (the last stretch before draining returns);

it shares the main measurement's scope

data: Dimension: Overhead attribution

Dimension: Overhead attribution

Dimension: Overhead attribution (cont.)

status: ok

this dimension is a diagnosis, not the main evidence: the sampled tiers and concurrencies are a fixed small batch, not the whole matrix. The concurrency ceiling is the machine's parallel capacity - beyond it, what is measured is contention;

sampled tiers (microseconds): 40, 10000; concurrency: [1, 4]; this machine's parallel capacity: 4

data: Dimension: Overhead attribution

Dimension: Overhead attribution

the rest of this section's details are in the full report

For one conclusion per slide, only the first 2 slides of this section are shown; the remaining 17 slides of per-unit numbers, percentiles and raw samples sit in the same section of the full report, verbatim checkable.

full report: the "Dimension: Overhead attribution" section of report.md in the same directory

zoo-bench report

Dimension: The cost of scheduling semantics

scope: this dimension uses an internal switch comparison (same workload, semantics all off vs. enabled one by one) and does not compare across schemes - a bare writeup has no counterpart for priority / timeout / retry, so it can only answer 'what is this framework's semantics worth', not 'how much more expensive than a bare writeup'

status: ok (the conclusion was reached on the 'current' drive-surface generation installed during this measurement)

semantics itemlayerhow probedmeasurableevidence / reason
timeoutdispatch layerbehavioral probe (driven repeatedly through scheduling rounds; measures the moment the worker leaves the in-flight table)yestimeout reap observed: the worker left the in-flight table before the body ended (0.0122s) (body 0.15s, run_timeout 0.01s); judgment action at dispatch_core.py:425; what is in effect is observation and circuit-breaking (recording, marking unhealthy, removing the in-flight registration, stopping dispatch), not termination of the still-running worker - CPython cannot safely interrupt a running thread
priorityevent layerstructural probe (checks whether the symbols required for execution exist)nonot re-checked: this item's conclusion was reached on the 'previous' generation; taking it as this generation's fact asserts wiring in the report that the current generation does not have. Re-deriving it needs a probe design of its own (each item needs clean on/off states before it can be priced)
retryevent layerstructural probe (checks whether the symbols required for execution exist)nonot re-checked: this item's conclusion was reached on the 'previous' generation; taking it as this generation's fact asserts wiring in the report that the current generation does not have. Re-deriving it needs a probe design of its own (each item needs clean on/off states before it can be priced)

data: Dimension: The cost of scheduling semantics

Dimension: The cost of scheduling semantics

Dimension: The cost of scheduling semantics (cont.)

this conclusion was reached on the version under test and its coordinates hold for that version only; after appending a version to matrix.yaml, re-run this probe

data: Dimension: The cost of scheduling semantics

zoo-bench report

Dimension: Native task line: three execution forms of the same subject

scope: this line is measured on its own: it enters neither the main matrix's pivot tables nor its crossings, and its numbers must not be read against the baseline adapters listed there

verdict: not_applicable

the framework under test has no such capability (symbols not found: adaptive_params, dual_arm_worker, native_params, native_task_worker) - this line does not apply to this version, and that is not a failure

equivalence gate: not run (the probe did not reach it)

loaded task modbus_rtu.parse_response - Modbus RTU response-frame parsing: the input is a bare RTU ADU response frame (no transport framing), and the tier's frame bytes are its length

data: Dimension: Native task line: three execution forms of the same subject

Dimension: Native task line: three execution forms of the same subject

Dimension: Native task line: three execution forms of the same subject (cont.)

tiers R1, R8, R125 (frame bytes 7, 21, 255); concurrencies 1, 4, 16, 64; each cell runs 100 warm-up plus 100 measured rounds, one child process per concurrency (4 in all)

data: Dimension: Native task line: three execution forms of the same subject

zoo-bench report

tiers where the framework under test is faster

Tiers where the framework under test is ahead (the two sides differ by more than that tier's band). This comes from the same within-run comparison as the openly published unfavourable data - one side takes the faster tiers, the other the slower ones, so both cover the same ground and neither can pick its own tiers. This section being empty is not a failure: it should be empty when nothing is distinguishable or when the framework loses everywhere.

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
apscheduler140the framework under test is 1.58x faster than apscheduler182.57 microseconds
process_pool140the framework under test is 1.83x faster than process_pool182.57 microseconds
apscheduler1300the framework under test is 1.21x faster than apscheduler449.17 microseconds
process_pool1300the framework under test is 1.35x faster than process_pool449.17 microseconds
apscheduler12700the framework under test is 1.09x faster than apscheduler2.754 milliseconds

data: tiers where the framework under test is faster

tiers where the framework under test is faster

tiers where the framework under test is faster (cont.)

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
process_pool12700the framework under test is 1.09x faster than process_pool2.754 milliseconds
apscheduler440the framework under test is 1.24x faster than apscheduler206.14 microseconds
apscheduler16300the framework under test is 1.07x faster than apscheduler470.57 microseconds
apscheduler162700the framework under test is 1.03x faster than apscheduler2.899 milliseconds

data: tiers where the framework under test is faster

Openly published unfavourable data - summary

the framework under test is slower at 52 tiers, across 5 baselines.

apscheduler is faster at 2 tiers

worst 1.04x (concurrency 64 at 10000 microseconds). All tiers: concurrency 16 at 10000 microseconds, concurrency 64 at 10000 microseconds

asyncio_pool is faster at 13 tiers

worst 1.72x (concurrency 64 at 40 microseconds). All tiers: concurrency 1 at 40 microseconds, concurrency 1 at 300 microseconds, concurrency 1 at 10000 microseconds, concurrency 4 at 300 microseconds, concurrency 4 at 2700 microseconds, concurrency 4 at 10000 microseconds, concurrency 16 at 40 microseconds, concurrency 16 at 300 microseconds, concurrency 16 at 2700 microseconds, concurrency 16 at 10000 microseconds, concurrency 64 at 40 microseconds, concurrency 64 at 300 microseconds, concurrency 64 at 2700 microseconds

bare_thread is faster at 13 tiers

worst 1.23x (concurrency 16 at 40 microseconds). All tiers: concurrency 1 at 300 microseconds, concurrency 1 at 2700 microseconds, concurrency 1 at 10000 microseconds, concurrency 4 at 300 microseconds, concurrency 4 at 2700 microseconds, concurrency 16 at 40 microseconds, concurrency 16 at 300 microseconds, concurrency 16 at 2700 microseconds, concurrency 16 at 10000 microseconds, concurrency 64 at 40 microseconds, concurrency 64 at 300 microseconds, concurrency 64 at 2700 microseconds, concurrency 64 at 10000 microseconds

process_pool is faster at 9 tiers

worst 2.25x (concurrency 64 at 10000 microseconds). All tiers: concurrency 4 at 300 microseconds, concurrency 4 at 2700 microseconds, concurrency 4 at 10000 microseconds, concurrency 16 at 300 microseconds, concurrency 16 at 2700 microseconds, concurrency 16 at 10000 microseconds, concurrency 64 at 300 microseconds, concurrency 64 at 2700 microseconds, concurrency 64 at 10000 microseconds

thread_pool is faster at 15 tiers

worst 2.41x (concurrency 1 at 40 microseconds). All tiers: concurrency 1 at 40 microseconds, concurrency 1 at 300 microseconds, concurrency 1 at 2700 microseconds, concurrency 1 at 10000 microseconds, concurrency 4 at 40 microseconds, concurrency 4 at 300 microseconds, concurrency 4 at 2700 microseconds, concurrency 4 at 10000 microseconds, concurrency 16 at 40 microseconds, concurrency 16 at 300 microseconds, concurrency 16 at 2700 microseconds, concurrency 16 at 10000 microseconds, concurrency 64 at 40 microseconds, concurrency 64 at 300 microseconds, concurrency 64 at 2700 microseconds

data: zoo-bench "published unfavorable data" - per-tier details follow on later slides and in report.md

zoo-bench report

Openly published unfavourable data

Tiers where the framework under test is behind (the two sides differ by more than that tier's band). A report missing this part is not acceptable - a report that only shows where it wins gives the reader every reason to distrust it. Tiers whose difference is smaller than the band are not here but in the 'no winner' section: that is the verdict's outcome, not a place to hide things.

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
asyncio_pool140asyncio_pool is 1.30x faster than zoo182.57 microseconds
thread_pool140thread_pool is 2.41x faster than zoo182.57 microseconds
asyncio_pool1300asyncio_pool is 1.16x faster than zoo449.17 microseconds
bare_thread1300bare_thread is 1.17x faster than zoo449.17 microseconds
thread_pool1300thread_pool is 1.39x faster than zoo449.17 microseconds
bare_thread12700bare_thread is 1.03x faster than zoo2.754 milliseconds

data: Openly published unfavourable data

Openly published unfavourable data

Openly published unfavourable data (cont.)

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
thread_pool12700thread_pool is 1.02x faster than zoo2.754 milliseconds
asyncio_pool110000asyncio_pool is 1.06x faster than zoo10.066 milliseconds
bare_thread110000bare_thread is 1.04x faster than zoo10.066 milliseconds
thread_pool110000thread_pool is 1.08x faster than zoo10.066 milliseconds
thread_pool440thread_pool is 2.15x faster than zoo206.14 microseconds
asyncio_pool4300asyncio_pool is 1.19x faster than zoo485.26 microseconds
bare_thread4300bare_thread is 1.16x faster than zoo485.26 microseconds
process_pool4300process_pool is 1.59x faster than zoo485.26 microseconds
thread_pool4300thread_pool is 1.38x faster than zoo485.26 microseconds
asyncio_pool42700asyncio_pool is 1.07x faster than zoo2.946 milliseconds
bare_thread42700bare_thread is 1.09x faster than zoo2.946 milliseconds
process_pool42700process_pool is 2.13x faster than zoo2.946 milliseconds
thread_pool42700thread_pool is 1.07x faster than zoo2.946 milliseconds

data: Openly published unfavourable data

Openly published unfavourable data

Openly published unfavourable data (cont.)

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
asyncio_pool410000asyncio_pool is 1.02x faster than zoo10.106 milliseconds
process_pool410000process_pool is 2.19x faster than zoo10.106 milliseconds
thread_pool410000thread_pool is 1.03x faster than zoo10.106 milliseconds
asyncio_pool1640asyncio_pool is 1.53x faster than zoo205.75 microseconds
bare_thread1640bare_thread is 1.23x faster than zoo205.75 microseconds
thread_pool1640thread_pool is 2.28x faster than zoo205.75 microseconds
asyncio_pool16300asyncio_pool is 1.20x faster than zoo470.57 microseconds
bare_thread16300bare_thread is 1.11x faster than zoo470.57 microseconds
process_pool16300process_pool is 1.69x faster than zoo470.57 microseconds
thread_pool16300thread_pool is 1.37x faster than zoo470.57 microseconds
asyncio_pool162700asyncio_pool is 1.03x faster than zoo2.899 milliseconds
bare_thread162700bare_thread is 1.07x faster than zoo2.899 milliseconds
process_pool162700process_pool is 2.12x faster than zoo2.899 milliseconds

data: Openly published unfavourable data

Openly published unfavourable data

Openly published unfavourable data (cont.)

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
thread_pool162700thread_pool is 1.05x faster than zoo2.899 milliseconds
apscheduler1610000apscheduler is 1.02x faster than zoo10.084 milliseconds
asyncio_pool1610000asyncio_pool is 1.02x faster than zoo10.084 milliseconds
bare_thread1610000bare_thread is 1.05x faster than zoo10.084 milliseconds
process_pool1610000process_pool is 2.13x faster than zoo10.084 milliseconds
thread_pool1610000thread_pool is 1.03x faster than zoo10.084 milliseconds
asyncio_pool6440asyncio_pool is 1.72x faster than zoo207.28 microseconds
bare_thread6440bare_thread is 1.21x faster than zoo207.28 microseconds
thread_pool6440thread_pool is 2.32x faster than zoo207.28 microseconds
asyncio_pool64300asyncio_pool is 1.28x faster than zoo491.01 microseconds
bare_thread64300bare_thread is 1.16x faster than zoo491.01 microseconds
process_pool64300process_pool is 1.64x faster than zoo491.01 microseconds
thread_pool64300thread_pool is 1.40x faster than zoo491.01 microseconds

data: Openly published unfavourable data

Openly published unfavourable data

Openly published unfavourable data (cont.)

baselineconcurrencybody tier (microseconds)gapmedian of the framework under test
asyncio_pool642700asyncio_pool is 1.05x faster than zoo2.953 milliseconds
bare_thread642700bare_thread is 1.10x faster than zoo2.953 milliseconds
process_pool642700process_pool is 2.16x faster than zoo2.953 milliseconds
thread_pool642700thread_pool is 1.10x faster than zoo2.953 milliseconds
apscheduler6410000apscheduler is 1.04x faster than zoo10.538 milliseconds
bare_thread6410000bare_thread is 1.07x faster than zoo10.538 milliseconds
process_pool6410000process_pool is 2.25x faster than zoo10.538 milliseconds

data: Openly published unfavourable data

zoo-bench report

tiers with no winner

Tiers where the two sides cannot be told apart: the difference is smaller than that tier's band. The band comes from the two sides' own across-round spread (stdev / median of the per-task medians) within the same run, so it varies with the sample and the reader can recompute it from the archived per-round samples. It also covers every measured tier and states a reason for each - this section is not a place to hide things: reporting noise-level differences as '1.00x faster' is.

criterion: band = the framework's own across-round relative spread plus the baseline's; a single side's across-round relative spread = stdev / median of that unit's per-round per-task medians

band this run: 1.4% to 30.1% (it varies with each tier's spread).

data: tiers with no winner

tiers with no winner

tiers with no winner (cont.)

baselineconcurrencybody tier (microseconds)ratioreason
bare_thread1400.82xthe two sides differ by 18.4%, less than the band of 30.1% - no winner
asyncio_pool127001.00xthe two sides differ by 0.1%, less than the band of 3.1% - no winner
apscheduler1100000.99xthe two sides differ by 0.9%, less than the band of 4.6% - no winner
process_pool1100000.98xthe two sides differ by 1.8%, less than the band of 1.9% - no winner
asyncio_pool4400.84xthe two sides differ by 16.1%, less than the band of 17.3% - no winner
bare_thread4400.97xthe two sides differ by 3.0%, less than the band of 14.3% - no winner
process_pool4400.82xthe two sides differ by 18.1%, less than the band of 22.2% - no winner
apscheduler43001.05xthe two sides differ by 5.3%, less than the band of 7.0% - no winner
apscheduler427001.01xthe two sides differ by 1.3%, less than the band of 2.7% - no winner
apscheduler4100001.02xthe two sides differ by 1.5%, less than the band of 3.2% - no winner
bare_thread4100000.96xthe two sides differ by 4.1%, less than the band of 4.7% - no winner
apscheduler16401.09xthe two sides differ by 8.9%, less than the band of 15.6% - no winner
process_pool16400.73xthe two sides differ by 27.1%, less than the band of 29.0% - no winner

data: tiers with no winner

tiers with no winner

the rest of this section's details are in the full report

For one conclusion per slide, only the first 2 slides of this section are shown; the remaining 1 slides of per-unit numbers, percentiles and raw samples sit in the same section of the full report, verbatim checkable.

full report: the "tiers with no winner" section of report.md in the same directory

zoo-bench report

caliber limitations and sources of bias

  • measured layer: dispatch layer: drives BaseWaiter.execute_service() directly (thread-pool mode) instead of Master's full run loop - the latter's service loop fires once per second, which would lift the latency scale from microseconds to seconds. One scheduling round per submitted task, so that whole round's bookkeeping is charged to this single task; Master's usage serves several workers per round, which would spread that cost over tasks

data: caliber limitations and sources of bias

caliber limitations and sources of bias

caliber limitations and sources of bias (cont.)

  • scope note (apscheduler): APScheduler's scheduled-job model, including job registration and trigger-decision cost; the library swallows exceptions raised inside jobs, so this tier re-raises them during drain. Caliber note: the library offers no job-completion notification, so the completion signal comes from this tier's Condition, and the cost of one notification per task counts toward its end-to-end
  • scope note (asyncio_pool): the asyncio event loop dispatches synchronous bodies (equivalent to loop.run_in_executor), not native coroutine concurrency; the difference from a thread pool is the event loop's own cost

data: caliber limitations and sources of bias

caliber limitations and sources of bias

the rest of this section's details are in the full report

For one conclusion per slide, only the first 2 slides of this section are shown; the remaining 5 slides of per-unit numbers, percentiles and raw samples sit in the same section of the full report, verbatim checkable.

full report: the "caliber limitations and sources of bias" section of report.md in the same directory

zoo-bench report

bring your own baseline

the baselines of this harness are open: implement the four methods of zoo_bench.adapters.BaseAdapter (setup / submit / drain / teardown), register with zoo_bench.adapters.registry.register, or list your module path in extra_modules of matrix.yaml - no file in this repository needs to change. Your implementation goes through the same equivalence verification (submit N bodies, assert all ran and each exactly once);

failing it means the data is not trusted. We deliberately write this path into the report: a report written by the framework's own maintainer, measuring that framework, gives every reason to suspect a slowed baseline or a chosen caliber; letting anyone submit their own baseline is what makes this report challengeable and falsifiable.

data: bring your own baseline

zoo-bench report

self-check

  • overall measurement self-check: passed
  • process isolation: {'parent_pid': 43405, 'child_pids': [43869, 43872, 43875, 43878, 43881, 43887, 43893, 43899, 43905, 43923, 43941, 43959, 43978, 44034, 44090, 44145, 44206, 44208, 44210, 44212, 44214, 44219, 44224, 44229, 44234, 44251, 44268, 44285, 44302, 44363, 44425, 44490, 44555, 44589, 44623, 44657, 44691, 44824, 44959, 45092, 45225, 45754, 46283, 46812, 47341, 49454, 51567, 53680, 55794, 55798, 55802, 55806, 55810, 55817, 55824, 55831, 55838, 55857, 55876, 55895, 55914, 55981, 56048, 56115, 56182, 56184, 56186, 56189, 56191, 56196, 56201, 56206, 56211, 56228, 56245, 56262, 56279, 56335, 56392, 56453, 56519, 56521, 56523, 565

data: self-check

self-check

self-check (cont.)

  • 25, 56527, 56532, 56537, 56542, 56547, 56564, 56581, 56598, 56615, 56664, 56713, 56758], 'all_distinct': True, 'none_equals_parent': True}

data: self-check

appendix

every slide can be checked verbatim in the full report

slides are compressed for one conclusion per page; only the layout is compressed, never the numbers.

  • per-unit details (percentiles, spread, raw samples per round): report.md in the same directory
  • figures (SVG and PNG): figures/ in the same directory; also report.pdf
  • raw archive: results/zoo-framework-0.9.0/20261011T092749Z.json
  • 96 valid units in this run, 0 failed

the details run over a hundred rows; squeezing them into slides would strip readers of the means to verify.

← / → · space · R reset