Construct · 1 fields · 1 citations

list scheduling: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
listscheduling1 CONSTRUCTList schedulingGRAHAM · ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms

assigning each task to the next free processor in priority order, with proven bounds on schedule length and counterintuitive anomalies.

In algorithms, list scheduling refers to assigning each task to the next free processor in priority order, with proven bounds on schedule length and counterintuitive anomalies. This meaning comes from Graham (1966) in Bell System Technical Journal.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how list scheduling sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

list1 fields · 1 citationsanchor · a standalone constructorder4 fields · 6 citationsjingle · one word, four constructsschedule3 fields · 4 citationsjingle · one word, three constructs

References

  1. Graham, R. L. (1966). Bounds for Certain Multiprocessing Anomalies. Bell System Technical Journal, 45(9), 1563-1581. https://doi.org/10.1002/j.1538-7305.1966.tb01709.x

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct