Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
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
Experimental study of scheduling with memory constraints using hybrid methods
Journal of Computational and Applied Mathematics
Heuristics for multi-round divisible loads scheduling with limited memory
Parallel Computing
Scheduling divisible loads on heterogeneous desktop systems with limited memory
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
| Hi-index | 0.00 |
In this paper we study multi-installment divisible load processing in a heterogeneous distributed system with limited memory. Divisible load model applies to computations which can be arbitrarily divided into parts and performed independently in parallel. The initial waiting for the load may be shortened by sending many small chunks of load instead of one huge. The load chunk sizes must be adjusted to the speeds of communication, computation, and memory sizes, such that the whole processing time is as short as possible. We propose a new realistic model of memory management, and formulate it as mixed quadratic programming problem which is solved by branch and bound algorithm. Since this problem is computationally hard we propose heuristics, and analyze their performance in a series of computational experiments.