Optimum divisible load scheduling on heterogeneous stars with limited memory

DOI10.1016/J.EJOR.2004.10.022MaRDI QIDQ2490168zbMATH OpenOpenAlexFDO

Authors M. Drozdowski, Paweł Wolniewicz

Publication date 28 April 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2004.10.022

zbMATH Keywords

Parallel computingSchedulingDivisible loadsMemory constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Heuristics for multi-round divisible loads scheduling with limited memory
• Parallel Processing and Applied Mathematics
• Experimental study of scheduling with memory constraints using hybrid methods
• Scheduling multiple divisible loads in homogeneous star systems
• Optimal algorithm for scheduling large divisible workload on heterogeneous system

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1458813 (Why is no real title available?)
• Access time minimization for distributed multimedia applications
• An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
• Distributed processing of divisible jobs with communication startup costs
• Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems

Cited in

(14)

• A biased random-key genetic algorithm for single-round divisible load scheduling
• Memory-constrained task scheduling on a network of dual processors
• Scheduling multiple divisible loads in homogeneous star systems
• scientific article; zbMATH DE number 2086782 (Why is no real title available?)
• Experimental study of scheduling with memory constraints using hybrid methods
• Heuristics for multi-round divisible loads scheduling with limited memory
• Periodic multi-installment algorithm for divisible load scheduling
• Distributing and scheduling divisible task on parallel communicating processors.
• Performance limits of divisible load processing in systems with limited communication buffers
• Scheduling multilayer divisible computations
• Parallel Processing and Applied Mathematics
• Fully polynomial time approximation schemes for scheduling divisible loads
• Scheduling divisible loads with time and cost constraints
• Optimal algorithm for scheduling large divisible workload on heterogeneous system

This page was built for publication: Optimum divisible load scheduling on heterogeneous stars with limited memory

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