The GST load balancing algorithm for parallel and distributed systems

International Journal of Approximate Reasoning

Volumn 19, Issue 1-2, 1998, Pages 39-56

  Sinclair, David ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Distributed systems; Heuristic algorithms; Load balancing; Multiprocessors; Parallel processors; Scheduling; Task allocation

Indexed keywords

EID: 0042264062     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(98)00017-6     Document Type: Article

References (27)

1. M.R. Garey, D.S. Johnson, Computers and Intractability: A guide to the Theory Of NP-Completeness, Freeman, New York, 1979.
2. T.L. Casavant, J.G. Kuhl, A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. Software Engrg. 14 (1988) 141-154.
3. T. Hu, Parallel sequencing and assembly line problems, Oper. Res. 9 (1961) 841-848.
4. E. Coffman, Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976.
5. S. Epstein, Y. Wilamowsky, B. Dickman, Deterministic microprocessor scheduling with multiple objectives. Comput. Oper. Res. 19 (8) (1992) 743-749.
6. S. Holm, M.M. Sorensen, The optimal graph partition problem: solution methods based on reducing symmetric nature and combinatorial cuts, Research Report, Department of Management Science. Aarhus School of Business, Denmark, 1992.
7. B. W. Kernighan, S. Lin, An efficient heunristic procedure for partitioning graphs, Bell Systems Tech. J. 49 (2) (1970) 291-307.
8. L. R. Ford, D.R. Fulkerson. Flows in Networks, Princeton University Press, Princeton, N3, 1962.
9. A. Darte, Two heuristics for task scheduling, Ecole Normale Supèrieure de Lyon, 1991.
10. N.S. Bowen, C.N. Nikolaou, A. Ghafoor, On the assignment problem of arbitrary process systems to heterogeneous distributed computing systems, IEEE Trans. Comput. 41 (3) (1992) 257-273.
11. J.A. Stankovic, K. Ramamritham, The spring kernel: a new paradigm for real-time operating systems. ACM Special Issue of Oper. Sys. Rev. (1989) 54-71.
12. O. Gudmundsson, D. Mossé, A.K. Agrawala, S.K. Tripathi, MARUTI: a hard real-time operating system. Proceedings of IEEE Workshop on Experimental Distributed Systems, 1990, pp. 29-34.
13. A.P. Ershov, Mixed computation: potential applications and problems for study, Theoret. Comput. Sci. 18 (1982) 41-67.
14. V. Nirkhe, W. Pugh, A partial evaluator for the maruti hard real-time system, Real Time Systems, vol. 5. Kluwer Academic Press, Dordrecht, 1993, pp. 13-30.
15. Al. Mok, K. Amarsinghe, Evaluating tight execution time bounds of programs by annotation. Proceedings of the Sixth IEEE Workshop on Real-Time Operating Systems and Software, 1987, pp. 74-80.
16. C.Y. Park, A.C. Shaw, Experimenting with a program timing tool based on source-level timing schema, IEEE Comput. 24 (5) (1991) 48-57.
17. P. Puschner, C. Koza, Calculating the maximum execution times of real-time programs, Real-Time Systems 1 (2) (1989) 159-176.
18. A.D. Stoyenko, A schedulability analyzer for real-time euclid. Proceedings of Real-Time Systems Symposium, 1987, pp. 218-227.
19. I. Ahmad, A. Ghafoor, Semi-distributed load balancing for massively parallel multicomputer systems, IEEE Trans. Software Engrg. 17 (10) (1991) 987-1004.
20. M.H. Willebeek-LeMair, A.P. Reeves, Strategies for dynamic load balancing on highly parallel computers. IEEE Trans. parallel and distributed systems 4 (9) (1993).
21. D. Ghosal, G. Serazzi, S.K. Tripathi, The processor working set and its use in scheduling multiprocessor systems, IEEE Trans. Software Engrg. 17 443-453.
22. C.Y. Lee, J.J. Hwang, Y.C. Chow, F.D. Anger, Multiprocessor scheduling with interprocessor communication delay, Oper. Res. Lett. 7 (3) (1988) 141-147.
23. S. Kirkpatrick, C.D. Gelatt, M.P. Vechi, Optimization by simulated annealing. Science 220 (4598) (1983).
24. F. Glover, Tabu search, Centre for Appiled Artificial Inteligence, Graduate School of Business, University of Colorado, Boulder, 1988.
25. T.L. Kunii, S. Nishimura, T. Noma, The design of a parallel processing system for computer graphics, in: P.M. Dew et al. (Eds.), Parallel Processing for Computer Vision and Display, ch. 26, Addison-Wesley, New York, 1989, pp. 353-377.
26. A. Darte, Two heuristics for task scheduling, Technical Report, Ecole Normale Supérieure de Lyon, 1991.
27. D. Judge, W. Rudd, A test case for the parallel programming support environment: parallelizing the analysis of satellite imagery data, Technical Report 89-90-2, Department of Computer Science, Oregon State University, 1989.