Bounds on multiprocessing timing anomalies

Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 416-429.

Type

Journal article

Intellectual base

Primary research

Year

1969

Link

https://doi.org/10.1137/0117039matched

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Primes

• Scheduling
  • The discipline also has deep roots in computer science: Dijkstra's priority-based process scheduling for multiprogramming (1950s-1960s); Liu and Layland's (1973) rate-monotonic and EDF analysis for hard real-time systems, proving EDF optimal for preemptive scheduling of independent periodic tasks; and modern kernel schedulers like Linux CFS (Completely Fair Scheduler, kernel 2.6.23+).

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:28fe458089f0 · see in the full table