Scheduling Divisible Workloads Using the Adaptive Time Factoring Algorithm
نویسندگان
چکیده
In the past years a vast amount of work has been done in order to improve the basic scheduling algorithms for master/slave computations. One of the main results from this is that the workload of the tasks may be adapted during the execution, using either a fixed increment or decrement (e.g. based on an arithmetical or geometrical ratio) or a more sophisticated function to adapt the workload. Currently, the most efficient solutions are all based on some kind of evaluation of the slaves’ capacities done exclusively by the master. We propose in this paper the Adaptive Time Factoring scheduling algorithm, which uses a different approach distributing the scheduling between slaves and master. The master computes, using the Factoring algorithm, a time slice to be used by each slave for processing, and the slave predicts the correct workload size it should receive in order to accomplish this time slice. The prediction is based on a performance model located on each slave which is refined during the execution of the application in order to provide better predictions. We evaluated the proposed algorithm using a synthetic testbed and compared the obtained results with other scheduling algorithms.
منابع مشابه
RUMR: Robust Scheduling for Divisible Workloads
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been proposed to reduce application makespan. Our goal is to develop a practical divisible workload scheduling strategy. This requires that previous work be revisited as several usual assumptions about the computing platform d...
متن کاملScheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy to minimize the overall processing time of these workloads by taking advantage of the processor equivalence technique. A case study with two sources of workloads is presented to illustrate the general approach for multiple sources of workloads. A...
متن کاملUMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and computation between a master and several workers. Multi-round scheduling has been used for divisible workloads in previous work and our contribution is as follows. We use “uniform” rounds, i.e. a fixed amount of work is ...
متن کاملA Dynamic Scheduling Algorithm for Divisible Loads in Grid Environments
Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time, however, a handful of solutions have been proposed. Furthermore, almost all proposed approaches attempt to perform scheduling in dedicated environments such as LANs, whereas scheduling in non-dedicated environments such...
متن کاملThe Deadline-based Scheduling of Divisible Real-time Workloads on Multiprocessor Platforms Suriayati Bt Chuprat Universiti Teknologi Malaysia the Deadline-based Scheduling of Divisible Real-time Workloads on Multiprocessor Platforms
Current formal models of real-time workloads were designed within the context of uniprocessor real-time systems; hence, they are often not able to accurately represent salient features of multiprocessor real-time systems. Researchers have recently attempted to overcome this shortcoming by applying workload models from Divisible Load Theory (DLT) to real-time systems. The resulting theory, refer...
متن کامل