Computation of Lower Bounds for Multiprocessor Schedules

DOI10.1147/RD.195.0435MaRDI QIDQ4068102zbMATH OpenOpenAlexFDO

Authors Eduardo B. Fernandez, Tomas Lang

Publication date 1975

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/dc4b715fb331baafd4e3be2d05af98e611d1bae9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(2)

• Scheduling of unit-length independent tasks with execution constraints
• Comparison of lower bounds to the lengths of deterministic multiprocessor schedules

This page was built for publication: Computation of Lower Bounds for Multiprocessor Schedules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068102)