Heuristics for multi-round divisible loads scheduling with limited memory
DOI10.1016/J.PARCO.2010.02.004zbMATH Open1204.68035OpenAlexW1995917368MaRDI QIDQ991099FDOQ991099
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
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experimental study of scheduling with memory constraints using hybrid methods
- Scheduling for parallel processing
- Scheduling multiple divisible loads in homogeneous star systems
- Optimum divisible load scheduling on heterogeneous stars with limited memory
- Parallel Processing and Applied Mathematics
- Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
Cited In (11)
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Title not available (Why is that?)
- Scheduling multiple divisible loads in homogeneous star systems
- Communication scheduling in data gathering networks with limited memory
- Experimental study of scheduling with memory constraints using hybrid methods
- Simple heuristics for scheduling with limited intermediate storage
- Performance limits of divisible load processing in systems with limited communication buffers
- Scheduling multilayer divisible computations
- Optimum divisible load scheduling on heterogeneous stars with limited memory
- Parallel Processing and Applied Mathematics
- A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
Uses Software
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)
