Cilk work-stealing scheduler
E679890
load-balancing algorithm
parallel runtime scheduling algorithm
task scheduler
work-stealing scheduler
The Cilk work-stealing scheduler is a parallel runtime scheduling algorithm that efficiently balances dynamic multithreaded workloads by having idle processors "steal" tasks from busy ones, enabling scalable performance on multicore systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Cilk work-stealing scheduler canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7666045 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Cilk work-stealing scheduler Context triple: [Charles E. Leiserson, notableConcept, Cilk work-stealing scheduler]
-
A.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
B.
Intel Threading Building Blocks
Intel Threading Building Blocks is a C++ template library developed by Intel that provides high-level, task-based parallelism and scalable performance for multicore and manycore processors.
-
C.
ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
The ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) is a leading annual research conference focused on the design, implementation, and performance of parallel and concurrent computing systems and programming models.
-
D.
The Efficient Baxter
The Efficient Baxter is a character known for their resourceful, streamlined approach to tasks and problem-solving.
-
E.
Cascade Locks
Cascade Locks is a small city in northern Oregon along the Columbia River Gorge, known as a gateway to outdoor recreation and scenic waterfalls.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Cilk work-stealing scheduler Target entity description: The Cilk work-stealing scheduler is a parallel runtime scheduling algorithm that efficiently balances dynamic multithreaded workloads by having idle processors "steal" tasks from busy ones, enabling scalable performance on multicore systems.
-
A.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
B.
Intel Threading Building Blocks
Intel Threading Building Blocks is a C++ template library developed by Intel that provides high-level, task-based parallelism and scalable performance for multicore and manycore processors.
-
C.
ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
The ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) is a leading annual research conference focused on the design, implementation, and performance of parallel and concurrent computing systems and programming models.
-
D.
The Efficient Baxter
The Efficient Baxter is a character known for their resourceful, streamlined approach to tasks and problem-solving.
-
E.
Cascade Locks
Cascade Locks is a small city in northern Oregon along the Columbia River Gorge, known as a gateway to outdoor recreation and scenic waterfalls.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
load-balancing algorithm
ⓘ
parallel runtime scheduling algorithm ⓘ task scheduler ⓘ work-stealing scheduler ⓘ |
| analyzes | work and span of computation ⓘ |
| assignsTo | each worker a deque of tasks ⓘ |
| associatedWith |
Charles E. Leiserson
NERFINISHED
ⓘ
MIT Laboratory for Computer Science NERFINISHED ⓘ Robert D. Blumofe NERFINISHED ⓘ Yuli Zhou NERFINISHED ⓘ |
| basedOn | work-stealing ⓘ |
| behavior | idle processors steal tasks from busy processors ⓘ |
| designedFor |
multicore systems
ⓘ
shared-memory multiprocessors ⓘ |
| executionModel | each worker runs a deque-driven loop of executing or stealing tasks ⓘ |
| formalizedIn | Cilk-5 multithreaded language papers ⓘ |
| goal |
load balancing
ⓘ
minimize parallel execution time ⓘ minimize scheduling overhead ⓘ |
| guarantees |
expected running time within constant factor of optimal
ⓘ
expected space usage within constant factor of serial execution ⓘ |
| handles |
irregular parallelism
ⓘ
nested parallelism ⓘ |
| hasProperty |
distributed scheduling
ⓘ
good cache locality ⓘ low scheduling overhead ⓘ noncentralized scheduling ⓘ provably efficient ⓘ scalable ⓘ space-efficient ⓘ |
| implementsConcept |
continuation stealing
ⓘ
lazy task creation ⓘ work-first principle ⓘ |
| influenced |
.NET Task Parallel Library work-stealing queues
NERFINISHED
ⓘ
Java ForkJoinPool NERFINISHED ⓘ many modern task-based runtime systems ⓘ |
| inspired | work-stealing schedulers in other task-parallel runtimes ⓘ |
| localPolicy | workers execute tasks in LIFO order from bottom of deque ⓘ |
| operatesOn | ready deque ⓘ |
| schedules |
DAG of tasks
ⓘ
fork-join parallelism ⓘ spawnable tasks ⓘ |
| stealPolicy | thieves steal tasks in FIFO order from top of victim deque ⓘ |
| supports | dynamic multithreaded workloads ⓘ |
| usedIn |
Cilk
NERFINISHED
ⓘ
Cilk++ NERFINISHED ⓘ Cilk-5 NERFINISHED ⓘ Intel Cilk Plus NERFINISHED ⓘ |
| usesDataStructure | double-ended queue ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Cilk work-stealing scheduler Description of subject: The Cilk work-stealing scheduler is a parallel runtime scheduling algorithm that efficiently balances dynamic multithreaded workloads by having idle processors "steal" tasks from busy ones, enabling scalable performance on multicore systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.