Distributed processing of divisible jobs with communication startup costs
From MaRDI portal
Publication:1363737
DOI10.1016/S0166-218X(96)00115-1zbMATH Open0879.68022DBLPjournals/dam/BlazewiczD97OpenAlexW2062594665WikidataQ57387855 ScholiaQ57387855MaRDI QIDQ1363737FDOQ1363737
Authors: Jacek Blazewicz, M. 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
Recommendations
- Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks
- Scheduling divisible loads in bus networks with arbitrary processor release times
- Optimal static load balancing in distributed computer systems
- Scheduling divisible loads with time and cost constraints
- Closed form solutions for bus and tree networks of processors load sharing a divisible job
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Scheduling File Transfers
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Multiprocessor scheduling with communication delays
- Title not available (Why is that?)
- Complexity of Scheduling Parallel Task Systems
- Gang scheduling performance benefits for fine-grain synchronization
- Scheduling multiprocessor tasks on hypercubes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (18)
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Load sequencing for a parallel processing utility
- The effect of start-up delays in scheduling divisible loads on bus networks: an alternate approach
- Grid scheduling divisible loads from two sources
- Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
- Title not available (Why is that?)
- An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
- Distributing and scheduling divisible task on parallel communicating processors.
- Scheduling divisible loads in a three-dimensional mesh of processors.
- Performance limits of divisible load processing in systems with limited communication buffers
- Divisible load scheduling and Markov chain models
- Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks
- Decentralized subcontractor scheduling with divisible jobs
- Optimum divisible load scheduling on heterogeneous stars with limited memory
- An equivalent network for divisible load scheduling in nonblocking mode of communication
- Parallel Processing and Applied Mathematics
- Scheduling divisible loads with time and cost constraints
- Closed form solutions for bus and tree networks of processors load sharing a divisible job
This page was built for publication: Distributed processing of divisible jobs with communication startup costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363737)
