Abstract
In this work we consider scheduling divisible loads on a distributed computing system with limited available memory. The communication delays and heterogeneity of the system are taken into account. The problem studied consists in finding such a distribution of the load that the communication and computation time is the shortest possible. A new robust method is proposed to solve the problem of finding optimal distribution of computations on star network, and networks in which binomial trees can be embedded (meshes, hypercubes, multistage interconnections). We demonstrate that in many cases memory limitations do not restrict efficiency of parallel processing as much as computation and communication speeds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Berkelaar, lp_solve-Mixed Integer Linear Program solver, ftp://ftp.es.ele.tue.nl/pub/lp_solve (1995).
V. Bharadwaj, D. Ghose, V. Mani and T. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems (IEEE Computer Society Press, Los Alamitos, CA, 1996).
J. Błażewicz, M. Drozdowski, F. Guinand and D. Trystram, Scheduling a divisible task in a 2-dimensional mesh, Discrete Applied Mathematics 94(1–3) (June 1999) 35–50.
J. Błażewicz, M. Drozdowski and M. Markiewicz, Divisible task scheduling–concept and verification, Parallel Computing 25 (1999) 87–98.
M. Drozdowski, Selected problems of scheduling tasks in multiprocessor computer systems, Series: Rozprawy, No. 321, Poznán University of Technology Press, Poznán (1997). Also: http://www.cs.put. poznan.pl/~maciejd/txt/h.ps
M. Drozdowski and W. Głazek, Scheduling divisible loads in a threedimensional mesh of processors, Parallel Computing 25 (1999) 381–404.
M. Drozdowski and P. Wolniewicz, Experiments with scheduling divisible tasks in clusters of workstations, in: Euro-Par 2000, Lecture Notes in Computer Science, Vol. 1900, eds. A. Bode, T. Ludwig, W. Karl and R. Wismüller (Springer, 2000) pp. 311–319.
M. Drozdowski and P. Wolniewicz, On the complexity of divisible job scheduling with limited memory buffers, Technical Report 29 001/2001, Institute of Computing Science, Poznán University of Technology, 2001.
R. Fourer, Linear Programming Frequently Asked Questions (2000), http://www-unix.mcs.anl.gov/otc/Guide/faq/ linear-programming-faq.html
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
W. Głazek, Algorithms for scheduling divisible tasks on parallel machines, Ph.D. Thesis, Department of Electronics, Telecommunication and Computer Science, Technical University of Gdánsk, Poland, 1998.
J. Gondzio and T. Terlaky, A computational view of interior-point methods for linear programming, in: Advances in Linear and Integer Programming, ed. Beasley (Oxford University Press, Oxford, 1996) pp. 107–146.
X. Li, V. Bharadwaj and C.C. Ko, Optimal divisible task scheduling on single-level tree networks with buffer constraints, IEEE Transactions on Aerospace and Electronic Systems 36(4) (2000) 1298–1308.
I.J. Lustig, R.E. Marsten and D.F. Shanno, Interior point methods for linear programming: Computational state of the art, ORSA Journal on Computing 6(1) (1994) 1–14.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Drozdowski, M., Wolniewicz, P. Divisible Load Scheduling in Systems with Limited Memory. Cluster Computing 6, 19–29 (2003). https://doi.org/10.1023/A:1020910932147
Issue Date:
DOI: https://doi.org/10.1023/A:1020910932147