A general bound on schedule length for independent tasks

DOI10.1016/0167-8191(90)90160-BzbMath0707.68016OpenAlexW2158530949MaRDI QIDQ919804

Nigel P. Topham, Sathiamoorthy Manoharan

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90160-b

zbMATH Keywords

multiprocessorsindependent tasksscheduling algorithmstask assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)

This page was built for publication: A general bound on schedule length for independent tasks