Scheduling divisible jobs on hypercubes
Parallel Computing
Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Scheduling divisible loads in a three-dimensional mesh of processors
Parallel Computing
Scheduling a divisible task in a two-dimensional toroidal mesh
Proceedings of the third international conference on Graphs and optimization
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Experiments with Scheduling Divisible Tasks in Clusters of Workstations
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Multi-installment divisible load processing in heterogeneous systems with limited memory
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
| Hi-index | 0.00 |
Divisible job model is a very efficient tool representing certain kind of distributed computations. It can be applied for jobs that can be divided into an arbitrary number of independent tasks. In this work we analyse a new type of communication that can shorten the schedule length and reduce memory requirements. Two types of multiinstalment processing models are taken into account; their influence on processing time and memory requirements is examined.