A note on Graham's bound

DOI10.1016/0020-0190(90)90177-YzbMath0703.68022OpenAlexW2053886750MaRDI QIDQ916353

Zhen Liu

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90177-y

zbMATH Keywords

performance evaluationmakespanconcurrencyheuristics for multiprocessor schedulinginterprocessor communication delaysworst-case error bound

Mathematics Subject Classification ID

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

Related Items (3)

FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH ⋮ Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules ⋮ Unnamed Item

Cites Work

• UET scheduling with unit interprocessor communication delays
• Multiprocessor scheduling with interprocessor communication delays
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A note on Graham's bound