Abstract
Workstations within a distributed system often contain powerful processors, although on average, the processing demands of the user are far less than the capacity of the workstation they are using. Load balancing uses the ability to remotely execute processes to allow for the spreading of the computational load over the workstations within a distributed system. This paper presents a summary of the issues and characteristics that must be considered when developing a load balancing algorithm. It looks at the development of a load balancing mechanism using techniques from a number of important solutions within the area, with emphasis being placed on scalability, stability, fairness of service, efficiency and a move away from an “all or nothing” approach where a single load threshold mark is used, using a High-Low scheme [1]. The paper provides both a theoretical and performance based analysis of the algorithm in order to provide a fair evaluation. Results show that improvements in user response time are evident when idle/lightly loaded processor(s) are available in order to accept remote processes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alonso R, Cova LL. Sharing Jobs Among Independently Owned Processors. Proc. 8th Int’l Conf. on Distributed Computing Systems, IEEE Computing Society Press, Los Alamitos, Calif., 1988; 282–287.
Wilbur S, Merabti M. Towards Performance Management of Networks and Distributed Systems. IFIP 6.4a Conference on Networks Management. Berlin 2–3 July 1987.
Goscinski A. Distributed Operating Systems — The Logical Design. Addison-Wesley Publishing Company, 1992.
Zhou S. A Trace-Driven Simulation Study of Dynamic Load Balancing. IEEE Trans. Software Eng. Sept. 1988; 14:1327–1341.
Fogg I. Distributed Scheduling Algorithms: A Survey. Department of Computer Science, University of Queensland, 1987.
Kremien O, Kramer J. Methodical Analysis of Adaptive Load-Sharing Algorithms. IEEE Trans. Parallel and Distributed Systems, Nov. 1992; 3:747–760.
Bryant R.M., Finkel R.A. A Stable Distributed Scheduling Algorithm. Proc. 2nd Int’l Conf. on Distributed Computing Systems, 1981; 314–323.
Barak A, Shiloh A. A Distributed Load Balancing Policy for a Multicomputer. Software Practice and Experience, 1989; 15:901–913.
Kremien O, Kramer J, Magee J. Scalable, Adaptive Load Sharing for Distributed Systems. IEEE Parallel and Distributed Technology, Aug. 1993; 1:62–70.
Theimer M.M., Lantz K.A. Finding Idle Machines in a Workstation—Based Distributed System. IEEE Trans. Software Eng., Nov. 1989; 15:1444–1458.
Frost J. BSD Sockets: A Quick and Dirty Primer. Software Tool and Die. madd@std.com, 1989.
Sobell M. A Practical Guide to Unix, Second Edition, Benjamin/Cummings, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag London Limited
About this chapter
Cite this chapter
Edwards, C., Merabti, M. (1996). A Two-Tier Load Balancing Scheme for Distributed Systems. In: Merabti, M., Carew, M., Ball, F. (eds) Performance Engineering of Computer and Telecommunications Systems. Springer, London. https://doi.org/10.1007/978-1-4471-1007-1_19
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1007-1_19
Publisher Name: Springer, London
Print ISBN: 978-3-540-76008-5
Online ISBN: 978-1-4471-1007-1
eBook Packages: Springer Book Archive