Loop scheduling

Quality 0.50 · 1 view · Updated 2 months ago

title: "Loop scheduling" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["parallel-computing"] topic_path: "technology/computing" source: "https://en.wikipedia.org/wiki/Loop_scheduling" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

In parallel computing, loop scheduling is the problem of assigning proper iterations of parallelizable loops among n processors to achieve load balancing and maintain data locality with minimum dispatch overhead.

Typical loop scheduling methods are:

  • static even scheduling: evenly divide loop iteration space into n chunks and assign each chunk to a processor
  • dynamic scheduling: a chunk of loop iteration is dispatched at runtime by an idle processor. When the chunk size is 1 iteration, it is also called self-scheduling.
  • guided scheduling: similar to dynamic scheduling, but the chunk sizes per dispatch keep shrinking until reaching a preset value.

References

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::

parallel-computing