Scheduling multiple divisible loads in homogeneous star systems

DOI10.1007/S10951-007-0051-7zbMath1168.90434OpenAlexW2002111194MaRDI QIDQ835612

M. Lawenda, Maciej Drozdowski

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0051-7

zbMATH Keywords

computational complexityschedulingparallel processingdivisible loads

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Heuristics for multi-round divisible loads scheduling with limited memory

Cites Work

• Efficient scheduling strategies for processing multiple divisible loads on bus networks
• Unnamed Item

This page was built for publication: Scheduling multiple divisible loads in homogeneous star systems