Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling divisible loads in parallel and distributed systems. IEEE Computer Society Press, Los Alamitos (1996)
Bharadwaj, V., Ghose, D., Mani, V.: Multi-installment Load Distribution in Tree Networks with Delays. IEEE Transactions on Aerospace and Electronic Systems 31, 555–567 (1995)
Cheng, Y.-C., Robertazzi, T.G.: Distributed computation with communication delay. IEEE Transactions on Aerospace and Electronic Systems 24, 700–712 (1988)
Drozdowski, M.: Selected problems of scheduling tasks in multiprocessor computer systems. Monographs, vol. 321. Poznań University of Technology Press (1997), http://www.cs.put.poznan.pl/mdrozdowski/txt/h.ps
Drozdowski, M., Lawenda, M.: Multi-installment Divisible Load Processing in Heterogeneous Systems with Limited Memory. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 847–854. Springer, Heidelberg (2006)
Drozdowski, M., Wolniewicz, P.: Optimum divisible load scheduling on heterogeneous stars with limited memory. European Journal of Operational Research 172, 545–559 (2006)
Li, X., Bharadwaj, V., Ko, C.C.: Processing divisible loads on single-level tree networks with buffer constraints. IEEE Transactions on Aerospace and Electronic Systems 36, 1298–1308 (2000)
Lp_solve reference guide (2007), http://lpsolve.sourceforge.net/5.5/
Robertazzi, T.: Ten reasons to use divisible load theory. IEEE Computer 36, 63–68 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drozdowski, M., Lawenda, M. (2008). A New Model of Multi-installment Divisible Loads Processing in Systems with Limited Memory. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_107
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)