Out-of-core divisible load processing

Authors:
M. Drozdowski;P. Wolniewicz
Affiliations:
Inst. of Comput. Sci., Poznan Univ. of Technol., Poland;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2003

Citing 0
Cited 7

Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources

IEEE Transactions on Parallel and Distributed Systems
Data Partitioning with a Functional Performance Model of Heterogeneous Processors

International Journal of High Performance Computing Applications
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment

IEEE Transactions on Parallel and Distributed Systems
Data distribution for dense factorization on computers with memory heterogeneity

Parallel Computing
Heuristics for multi-round divisible loads scheduling with limited memory

Parallel Computing
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze processing divisible loads in systems with a memory hierarchy. Divisible loads are computations that can be divided into parts of arbitrary sizes and these parts can be independently processed in a distributed system. The problem is to partition the load so that the total processing time, including communications and computations, is the shortest possible. Earlier works in the divisible load theory assumed distributed systems with a flat memory model. The dependence of the processing time on the size of the assigned load was assumed to be linear. A new mathematical model relaxing the above two assumptions is proposed in this article. We study distributed systems-which have both the hierarchical memory model and a piecewise linear dependence of the processing time on the size of the assigned load. Performance of such systems is modeled and evaluated. Finally, we compare the efficiency of distributed processing divisible loads in multiinstallment and out-of-core modes. Multiinstallment processing consists in sending multiple small chunks of the load to processors instead of a single chunk which needs external memory. It turns out that multiinstallment is an advantageous strategy for reasonably selected load chunks sizes.