Abstract
Optimum divisible load processing in heterogeneous star system with limited memory is studied. We propose two algorithms to find multi-installment load distribution: Exact branch-and-bound algorithm and a heuristic using genetic search method. Characteristic features of the solutions and the performance of the algorithms are examined in a set of computational experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berkelaar, M.: Mixed Integer Linear Program solver (1995), http://ftp.es.ele.tue.nl/pub/lp_solve
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)
Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling divisible loads in parallel and distributed systems. IEEE Computer Society Press, Los Alamitos (1996)
Drozdowski, M.: Selected problems of scheduling tasks in multiprocessor computer systems, Poznań Univ. of Technology, Series: Monographs, No 321, Poznań (1997), Downloadable from http://www.cs.put.poznan.pl/mdrozdowski/txt/h.ps
Drozdowski, M., Wolniewicz, P.: Divisible load scheduling in systems with limited memory. Cluster Computing 6, 19–29 (2003)
Drozdowski, M., Wolniewicz, P.: Out-of-Core Divisible Load Processing. IEEE Trans. on Parallel and Distributed Systems 14, 1048–1056 (2003)
Drozdowski, M., Wolniewicz, P.: Optimum divisible load scheduling on heterogeneous stars with limited memory. European Journal of Operational Research (accepted, 2004)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Li, X., Bharadwaj, V., Ko, C.C.: Optimal divisible task scheduling on single-level tree networks with buffer constraints. IEEE Trans. on Aerospace and Electronic Systems 36, 1298–1308 (2000)
Robertazzi, T.: Ten reasons to use divisible load theory. IEEE Computer 36, 63–68 (2003)
Wolniewicz, P., Drozdowski, M.: Processing Time and Memory Requirements for Multi-installment Divisible Job Processing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 125–133. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drozdowski, M., Lawenda, M. (2006). Multi-installment Divisible Load Processing in Heterogeneous Systems with Limited Memory. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_102
Download citation
DOI: https://doi.org/10.1007/11752578_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)