Partitioning Techniques for Large-Grained Parallelism
IEEE Transactions on Computers
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Journal of Parallel and Distributed Computing
A Novel Data Distribution Technique for Host-Client Type Parallel Applications
IEEE Transactions on Parallel and Distributed Systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Divisible Load Scheduling in Systems with Limited Memory
Cluster Computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems
IEEE Transactions on Parallel and Distributed Systems
Practical Divisible Load Scheduling on Grid Platforms with APST-DV
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Scheduling for Parallel Processing
Scheduling for Parallel Processing
A new model of multi-installment divisible loads processing in systems with limited memory
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
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
Aligning biological sequences on distributed bus networks: a divisible load scheduling approach
IEEE Transactions on Information Technology in Biomedicine
Out-of-core divisible load processing
IEEE Transactions on Parallel and Distributed Systems
Cluster-based optimized parallel video transcoding
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 scheduling divisible loads in systems with limited memory is examined. Divisible loads are parallel computations which can be arbitrarily divided into parts independently processed on remote processors. The scheduling problem consists in distributing the load, taking into account communication and computation time, and limited memory buffers, so that the total processing time is as short as possible. The amount of memory available on the remote processors is too small to hold the whole load at once. Hence, the load must be distributed in many small messages. Since the problem is computationally hard, we propose not one, but several classes of heuristics. In a series of computational experiments we demonstrate advantages and weaknesses of certain heuristic types for wide range of changing system parameters.