Computation of Lower Bounds for Multiprocessor Schedules

DOI10.1147/rd.195.0435zbMath0309.68057OpenAlexW2079278386MaRDI QIDQ4068102

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)

Related Items (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