Heuristics for multi-round divisible loads scheduling with limited memory

DOI10.1016/j.parco.2010.02.004zbMath1204.68035OpenAlexW1995917368MaRDI QIDQ991099

Maciej Drozdowski, Joanna Berlińska

Publication date: 2 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.parco.2010.02.004

zbMATH Keywords

heuristicsschedulingdivisible loadsmemory limitations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items

Communication scheduling in data gathering networks with limited memory, A biased random-key genetic algorithm for single-round divisible load scheduling, Scheduling Multilayer Divisible Computations

Uses Software

• MapReduce
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling multiple divisible loads in homogeneous star systems
• Experimental study of scheduling with memory constraints using hybrid methods
• Scheduling for parallel processing
• Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Parallel Processing and Applied Mathematics