Abstract
In this paper we present a new general metric of load balancing in δ-range. This metric is different from traditional metrics since it introduces an argument δ to embody the practical circumstances when multiple jobs are running in a parallel computer system. Different demands on resources by various types of jobs and the cost to balance the loads are taken into consideration when we design this metric. As a result, this metric is more practicable and applicable in a real large scale multi-task parallel system. Some properties and two algorithms aiming at the cluster environment are also descirbed in this paper.
This research was supported by the National Natural Science Foundation (No.69825104) and 863 Project (No. 2002AA1Z2101) of China.
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
Basney, J., Livny, M., Tannenbaum, T.: High Throughput Computing with Condor. HPCU news 1(2) (June1997)
International Business Machines Corporation, IBM LoadLeveler for AIX5L: Using and Adminstering, Version 3 Release 1 (December 2001)
LSF Homepage, http://www.platform.com
Bunt, R.B., Eager, D.L., Oster, G.M., Williamson, C.L.: Achieving Load Balance and Effective Caching in Clustered Web Servers. In: Proceedings of the 4th International Web Caching Workshop (1997)
jin, H., Dan, M.: Load Balancing Policies on DCFS (Dawning Cluster File System). Computer Engineering and Applications (China) 38(14), 109–112 (2002)
Cierniak, M., Zaki, M.J., Li, W.: Compile-time Scheduling Algorithms for a Hetergeneous NOW. The Computer Journal 40(6), 356–372 (1997)
Wu, S.S., Sweeting, D.: Heuristic Algorithms for Task Assignment and Scheduling in a Processor Network. Parallel Computing 20, 1–14 (1994)
Hou, E., Ansari, N., Ren, H.: A Genetic Algorithm for Multiprocessor Scheduling. IEEE Transactions on parallel and distributed system 5(2), 113–120 (1994)
Liu, J., Saletore, V.A.: Self-Scheduling on Distributed Memory Machines. In: Proc. Of Supercomputing 1993, pp. 814–823 (1993)
Polychronopoulos, C., Kuck, D.: Guided Self-Scheduling: A Practical Scheduling Sch]me for Parallel Supercomputers. IEEE Transactions on Computers, 1425–1439 (December 1987)
Hummel, S.F., Schonberg, E., Flynn, L.E.: Factoring: A Method for Scheduling Parallel Loops. Comm. ACM 35(8), 90–101 (1992)
Plata, O., Rivera, F.F.: Combining Static and Dynamic Scheduling on Distributed- Memory Multiprocessors. In: Proc. of the 1994 ACM ICS, pp. 186–195 (1994)
Winckler, A.: A Distributed Look-ahead Algorithm for Scheduling Interdependent Tasks. In: Proc. ISADS 1993, pp. 190–197 (1993)
Brogan, W.L.: Modern Control Theory. Prentice-Hall, Englewood Cliffs (1982)
Dai, H.D., Yang, X.J.: Operating System-Centric Memory Consistency Model-Thread Consistency Model. Journal of Computer Research and Development 40(2), 351–359 (2003)
Dai, H.D., Yang, X.J.: A New Framework of Memory Consistency Models in Distributed Shared Memory System-S 3C Framework. Chinese Journal of Computers 25(12), 1387–1396 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, X., Dai, H., Tang, Y., Yi, X. (2003). A General Metric of Load Balancing in δ-Range. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive