Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Processing Time and Memory Requirements for Multi-instalment Divisible Job Processing
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Journal of Parallel and Distributed Computing
Fully polynomial time approximation schemes for scheduling divisible loads
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
FIFO scheduling of divisible loads with return messages under the one-port model
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Scheduling divisible MapReduce computations
Journal of Parallel and Distributed Computing
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Scheduling divisible loads with return messages on heterogeneous master-worker platforms
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Master-slave tasking on asymmetric networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
On optimum multi-installment divisible load processing in heterogeneous distributed systems
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Efficient real-time divisible load scheduling
Journal of Parallel and Distributed Computing
| Hi-index | 0.03 |
We present results of a series of experiments with parallel processing divisible tasks on various cluster of workstations platforms. Divisible task is a new model of scheduling distributed computations. It is assumed that the parallel application can be divided into parts of arbitrary sizes and the parts can be processed independently on distributed computers. Though practical verification of the scheduling model was the primary goal of the experiments also an insight into the behavior and performance of cluster computing platforms has been gained.