Heuristics for multi-round divisible loads scheduling with limited memory

DOI10.1016/J.PARCO.2010.02.004MaRDI QIDQ991099zbMATHOpenAlexFDO

Authors Joanna Berlińska, M. Drozdowski

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

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

Recommendations

• Experimental study of scheduling with memory constraints using hybrid methods
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Parallel Processing and Applied Mathematics
• Scheduling multiple divisible loads in homogeneous star systems
• Scheduling divisible loads with time and cost constraints

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• Experimental study of scheduling with memory constraints using hybrid methods
• 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
• Scheduling for parallel processing
• Scheduling multiple divisible loads in homogeneous star systems

Cited in

(11)

• 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
• Experimental study of scheduling with memory constraints using hybrid methods
• A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
• Simple heuristics for scheduling with limited intermediate storage
• Parallel Processing and Applied Mathematics
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Performance limits of divisible load processing in systems with limited communication buffers
• scientific article; zbMATH DE number 2086782 (Why is no real title available?)
• Scheduling multiple divisible loads in homogeneous star systems

Describes a project that uses

Uses Software

• MapReduce
• Genocop

This page was built for publication: Heuristics for multi-round divisible loads scheduling with limited memory

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