A note on Graham's bound

DOI10.1016/0020-0190(90)90177-YzbMATH Open0703.68022OpenAlexW2053886750MaRDI QIDQ916353FDOQ916353

Authors: 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

Recommendations

• A general bound on schedule length for independent tasks
• Upper bound on the number of processors for scheduling with interprocessor communication delays.
• On Graham's bound for cyclic scheduling
• On the minimum number of processors for scheduling problems with communication delays
• A general lower bound for the makespan problem

zbMATH Keywords

performance evaluationconcurrencymakespanheuristics for multiprocessor schedulinginterprocessor communication delaysworst-case error bound

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Scheduling with duplication on \(m\) processors with small communication delays
• Title not available (Why is that?)
• FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
• On the achievement of the Griesmer bound
• A general bound on schedule length for independent tasks
• A Note on Burgess Bound

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

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