Construct · 1 fields · 1 citations

Pfair scheduling: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Pfairscheduling1 CONSTRUCTPfair schedulingBARUAH · REAL-TIME SYSTEMS

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

Real-time systems

multiprocessor scheduling that keeps each task's allocation within one quantum of its ideal fluid share, allowing full processor utilization.

In real-time systems, Pfair scheduling refers to multiprocessor scheduling that keeps each task's allocation within one quantum of its ideal fluid share, allowing full processor utilization. This meaning comes from Baruah (1996) in Algorithmica.[1]

Unit
Recovery means
Measured by

Next

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

See how Pfair 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

allocation3 fields · 4 citationsjingle · one word, three constructsideal2 fields · 2 citationsjingle · one word, two constructsquantum4 fields · 7 citationsjingle · one word, four constructs

References

  1. Baruah, S. K., Cohen, N. K., Plaxton, C. G., & Varvel, D. A. (1996). Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6), 600-625. https://doi.org/10.1007/bf01940883

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