WeSearch
Linux Randomly Picking Idle CPU Cores Shows Modest Win On High Core Count Systems

Linux Randomly Picking Idle CPU Cores Shows Modest Win On High Core Count Systems

·2 min read · 0 reactions · 0 comments · 3 views
More from Phoronix tech Compare coverage Trending Talk Blindspots Daily Sources Live wire
TL;DR · WeSearch summary

Linux Randomly Picking Idle CPU Cores Shows Modest Win On High Core Count Systems Written by Michael Larabel in Linux Kernel on 16 September 2026 at 09:30 AM EDT. Add A Comment Arm engineer Christian Loehle sent out a patch series today proposing that the Linux scheduler code randomize its picking of equally shallow idle CPU cores. This randomization is showing to deliver a win at least for high CPU core counts for better distributing workloads.

Key facts
About this source

Phoronix files mainly under tech. We currently carry 373 of its stories.

Original article
Phoronix
Read full at Phoronix →

Story provenance

Source · retrieval · rights · ranking — open for full record
inspect →

Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.

Record

Original publisherPhoronix
Canonical URLhttps://www.phoronix.com/news/Linux-Random-Equal-Idle-CPUs
Publication timeWed, 16 Sep 2026 09:30:04 -0400
Retrieval time2026-09-16T13:38:41.585Z
Last seen2026-09-16T13:38:41.585Z
Headline sourcePublisher (no WeSearch rewrite)
Excerpt sourcepublisher body
Excerpt methodFirst ~120 words (~800 chars) of extracted publisher body, fair-use limited.
SummaryWeSearch · cerebras-chat (WeSearch summarizer)
Summary source textcontentText
Citation coverageSummary is a WeSearch-generated derivative; primary citation is the original publisher URL.
ClusterZQeaNHlS3Zcb · 1 stories
Cluster logicGrouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison.
Ranking reasonStory pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking.
Publisher visitYes — open original
Substitutes article?No — link-out required for full text

Rights status (four layers)

Publisher-declared
No publisher-confirmed rights record for this source yet.
Machine-readable
No source-specific machine-readable restriction detected beyond the public feed.
WeSearch interpretation
WeSearch declared handling (basis: Derived from the published RSS/Atom feed). This is WeSearch policy, not a legal grant on the publisher's behalf.
Unknown
Retrieval and training permissions are not asserted unless the publisher confirms them.

WeSearch handling by dimension

Indexing May the item be indexed (stored, ranked, made findable)? Allowed
Snippet May a short excerpt of the publisher's text be shown? Allowed
AI summary May WeSearch generate its own short summary of the article? Limited
Retrieval / RAG May the content be exposed for third-party retrieval-augmented generation? Not asserted
Model training May the content be used to train AI models? Not asserted
Commercial reuse May the content be reused commercially? Not permitted

Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.

Opening excerpt (first ~120 words) tap to expand

Linux Randomly Picking Idle CPU Cores Shows Modest Win On High Core Count Systems Written by Michael Larabel in Linux Kernel on 16 September 2026 at 09:30 AM EDT. Add A Comment Arm engineer Christian Loehle sent out a patch series today proposing that the Linux scheduler code randomize its picking of equally shallow idle CPU cores. This randomization is showing to deliver a win at least for high CPU core counts for better distributing workloads. Loehle found that the Linux kernel scheduler's behavior with concurrent slow-path selectors can converge on the same idle CPU cores before either task is enqueued. To avoid that pitfall of potentially converging tasks on the same idle CPU core(s), his proposed approach is to randomize the equally shallow idle CPU cores.

Excerpt limited to ~120 words for fair-use compliance. The full article is at Phoronix.

Anonymous · no account needed
Share 𝕏 Facebook Reddit LinkedIn Threads WhatsApp Bluesky Mastodon Email

Discussion

0 comments

More from Phoronix