Distributed processing of divisible jobs with communication startup costs
From MaRDI portal
(Redirected from Publication:1363737)
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
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 736667 (Why is no real title available?)
- scientific article; zbMATH DE number 962287 (Why is no real title available?)
- Complexity of Scheduling Parallel Task Systems
- Gang scheduling performance benefits for fine-grain synchronization
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Multiprocessor scheduling with communication delays
- Scheduling File Transfers
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling multiprocessor tasks on hypercubes
Cited in
(19)- A biased random-key genetic algorithm for single-round divisible load scheduling
- Parallel Processing and Applied Mathematics
- Scheduling divisible loads with time and cost constraints
- Decentralized subcontractor scheduling with divisible jobs
- Divisible load scheduling and Markov chain models
- The effect of start-up delays in scheduling divisible loads on bus networks: an alternate approach
- scientific article; zbMATH DE number 2096759 (Why is no real title available?)
- Grid scheduling divisible loads from two sources
- Data transmission in processor networks
- Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks
- Optimum divisible load scheduling on heterogeneous stars with limited memory
- Distributing and scheduling divisible task on parallel communicating processors.
- Scheduling divisible loads in a three-dimensional mesh of processors.
- An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
- Performance limits of divisible load processing in systems with limited communication buffers
- Closed form solutions for bus and tree networks of processors load sharing a divisible job
- Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
- An equivalent network for divisible load scheduling in nonblocking mode of communication
- Load sequencing for a parallel processing utility
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)
