UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Novel Optimal Load Distribution Algorithm for Divisible Loads
Cluster Computing
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Optimal Multi-installments Algorithm for Divisible Load Scheduling
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Multi-installment divisible load processing in heterogeneous distributed systems: Research Articles
Concurrency and Computation: Practice & Experience - Parallel and Distributed Computing (EuroPar 2005)
The Journal of Supercomputing
Multi-round real-time divisible load scheduling for clusters
HiPC'08 Proceedings of the 15th international conference on High performance computing
A new algorithm for divisible load scheduling with different processor available times
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Inter-round scheduling for divisible workload applications
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
The master-slave paradigm with heterogeneous processors
IEEE Transactions on Parallel and Distributed Systems
A new method for job scheduling in two-levels hierarchical systems
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Hi-index | 0.00 |
Since the past decade, the use of parallel and distributed systems has become more common. In these systems, a huge chunk of data or computations is distributed among many systems in order to obtain better performance. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is a proposed method for scheduling data distribution in parallel or distributed systems. Many studies have been done in this field but only a few articles about distributing data in a heterogeneous multi-installment system can be found. In this paper, we present some closed-form formulas for the different steps of scheduling jobs in a heterogeneous multi-installment system (finding the proper number of processors, the proper number of installments, closed-form formula for scheduling internal installments and closed-form formula for scheduling last installment). Two different systems are studied: Computation-Based Systems and Communication-Based Systems. The results of our experiments show that both methods gave better performances than the previous methods (Hsu et al.'s method and Beaumont et al.'s method) and the Communication-Based method has a smaller response time than the Computation-Based method.