When Cache Hits Starve the Event Loop
Comments on “When Cache Hits Starve the Event Loop”
Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked
Octri's Emad Khair shows that awaiting two million in-memory cache hits can starve an event loop. A 10 ms timer fired after about 270 ms in Python and 142 ms in Node.js, because neither runtime handed control back during the loop. Yielding every 1,024 lookups, with asyncio.sleep(0) or setImmediate, let the timer fire near 10 ms, but the batch finished later (336 versus 270 ms in Python, 163 versus 142 ms in Node). The test used five runs per variant and one timer, and no production traffic.
Why it ranked
No. 17 of 118 with a score of 0.65. The panel rated it highest on new information (0.92) and technical depth (0.83), lowest on significance (0.48). Placed No. 17, No. 30 by score alone: the placement terms moved other stories past it.
- AI judgeJudge 2claude-haiku-5-5
- A clear, measured engineering write-up on event-loop starvation by cache hits in Python and Node, with reproducible timings and practical yield guidance; limited to a narrow audience and small-scale experiment.}
- AI judgeJudge 3gpt-5.6-luna
- A well-supported, reproducible engineering analysis of event-loop starvation on cache hits, with concrete Python and Node behavior, measurements, yielding patterns, testing guidance, and clear limits.
Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.
Score
0.65total under rubric v2.3
- Significance0.48
- Reader interest0.73
- Audience breadth0.59
- Practical relevance0.76
- Substantiated0.82
- Technical depth0.83
- New information0.92
- Counts against: Promotional0.03
- Counts against: Overclaim0.14
Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).
| Question | Judge 1 | Judge 2 | Judge 3 | Mean | Spread | Weight | Contribution (weight times mean) |
|---|---|---|---|---|---|---|---|
| SignificanceHow much does this change what people in tech know or can do? | 0.57 | 0.30 | 0.58 | 0.48 | 0.28 | +0.24 | +0.116 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.68 | 0.60 | 0.90 | 0.73 | 0.30 | +0.26 | +0.189 |
| Audience breadthHow many people who build technology does it concern? | 0.69 | 0.40 | 0.68 | 0.59 | 0.29 | +0.13 | +0.077 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.85 | 0.60 | 0.82 | 0.76 | 0.26 | +0.22 | +0.167 |
| SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations. | 0.99 | 0.60 | 0.88 | 0.82 | 0.39 | +0.05 | +0.041 |
| Technical depthHow technically substantive is it? | 1.00 | 0.70 | 0.78 | 0.83 | 0.30 | +0.05 | +0.041 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.87 | 0.90 | 0.98 | 0.92 | 0.11 | +0.05 | +0.046 |
| PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional. | 0.04 | 0.05 | 0.01 | 0.03 | 0.04 | −0.19 | −0.006 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.18 | 0.20 | 0.04 | 0.14 | 0.16 | −0.11 | −0.015 |
| Sum of contributions | +0.655 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.655 | ||||||
Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.
The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.
<a href="https://rubric.hrih.si/editions/2026-11-21/17/"><img src="https://rubric.hrih.si/badge/2026-11-21/17.svg" alt="Ranked #17 on Rubric, 21 Nov 2026" width="245" height="28"></a>Claim check
Claim check: 4 matches source · 3 no source given · 1 couldn’t check. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.
No source givenNumber
In the authors' test, a 10 ms timer had to wait until a loop of two million awaited cache hits finished: about 270 ms in Python and 142 ms in Node.js.
The article gives no link or citation for it.
The article says “The timer still had to wait until the loop finished: about 270 milliseconds in Python and 142 milliseconds in Node.js”
The source says No source to compare with.
Matches sourceCausal conclusion
Directly awaiting a Python coroutine does not automatically schedule a separate task or return control to the event loop; the coroutine can finish inside the already-running task.
The cited source says the same thing.
The article says “Directly awaiting a Python coroutine doesn't automatically schedule a separate task or return control to the event loop”
The source says “Unlike tasks, awaiting a coroutine does not hand control back to the event loop! Wrapping a coroutine in a task first, then awaiting that would cede control”
Source cited by the article: docs.python.org/3/howto/a-conceptual-overview-of-asyncio.html
Couldn’t checkVersion
In JavaScript, await suspends the async function even when the promise already has a result, and the ECMAScript specification schedules the continuation through promise reactions.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “Here, await really does suspend the async function, even when the promise already has a result. The ECMAScript specification schedules the continuation through promise reactions”
The source says No passage could be compared.
Source cited by the article: tc39.es/ecma262/multipage/control-abstraction-objects.html
Matches sourceCausal conclusion
Node processes microtasks before moving on to timer and I/O callbacks, which is why the timer can remain waiting while the whole batch runs.
The cited source says the same thing.
The article says “Node processes those microtasks before moving on to timer and I/O callbacks, which is why our timer can remain waiting while the whole batch runs”
The source says “Node.js will attempt to clear the queue until moving to any other queue, and hence you will see it outputs bar first”
Source cited by the article: nodejs.org/learn/asynchronous-work/understanding-setimmediate
Matches sourceQuote
Python documents asyncio.sleep with a zero delay as an optimized way to suspend the current task and allow other work to run.
The cited source says the same thing.
The article says “Python documents a zero delay as an optimized way to suspend the current task and allow other work to run”
The source says “Setting the delay to 0 provides an optimized path to allow other tasks to run”
Source cited by the article: docs.python.org/3.12/library/asyncio-task.html
No source givenBenchmark result
With explicit yielding every 1,024 lookups, the timer ran at a median of 10.3 ms in Python and 9.4 ms in Node.js, versus 270.0 ms and 142.4 ms for the original loops.
The article gives no link or citation for it.
The article says “Python Also yield every 1,024 lookups 10.3 (10.2–10.4) 335.6 (316.1–372.8”
The source says No source to compare with.
No source givenNumber
Yielding made the batch take longer to finish: median 335.6 ms versus 270.0 ms in Python and 162.8 ms versus 142.4 ms in Node.js.
The article gives no link or citation for it.
The article says “Completing the batch took longer. The additional checks and scheduling operations add overhead, and our measurements include both”
The source says No source to compare with.
Matches sourceGeneralization
Tokio includes cooperative budgets in participating operations, but its documentation shows how an always-ready stream can starve other work.
The cited source says the same thing.
The article says “Tokio includes cooperative budgets in participating operations, but its documentation also shows how an always-ready stream can starve other work”
The source says “It may look harmless, but consider what happens under heavy load if the input stream is always ready. If we spawn drop_all, the task will never yield, and will starve…”
Source cited by the article: docs.rs/tokio/latest/tokio/task/coop/index.html
Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 2 pts, not on front page
Recorded for context only, checked 21 Nov 2026, 05:47 UTC. It played no part in the ranking.