Comparison of lower bounds to the lengths of deterministic multiprocessor schedules

DOI10.1007/BF01071221zbMath0443.68029MaRDI QIDQ3886859

A. I. Kuksa

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

lower boundsdeterministic multiprocessor schedules

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Computation of Lower Bounds for Multiprocessor Schedules
• Complexity Results for Multiprocessor Scheduling under Resource Constraints

This page was built for publication: Comparison of lower bounds to the lengths of deterministic multiprocessor schedules