Distributed processing of divisible jobs with communication startup costs
From MaRDI portal
Publication:1363737
DOI10.1016/S0166-218X(96)00115-1zbMath0879.68022OpenAlexW2062594665WikidataQ57387855 ScholiaQ57387855MaRDI QIDQ1363737
Jacek Błażewicz, Maciej Drozdowski
Publication date: 11 August 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
An equivalent network for divisible load scheduling in nonblocking mode of communication, Divisible load scheduling and Markov chain models, Optimum divisible load scheduling on heterogeneous stars with limited memory, Grid scheduling divisible loads from two sources, A biased random-key genetic algorithm for single-round divisible load scheduling, Scheduling divisible loads with time and cost constraints, An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system, Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiprocessor scheduling with communication delays
- Gang scheduling performance benefits for fine-grain synchronization
- Scheduling multiprocessor tasks on hypercubes
- Scheduling File Transfers
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms