Self-adjusting scheduling: An on-line optimization technique for locality management and load balancing

Proceedings of the International Conference on Parallel Processing

Volumn 2, Issue , 1994, Pages

  Hamidzadeh, B ^a   Lilja, D J ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Dynamic scheduling; Load balancing.; Locality management; On line optimization; Scheduling costs

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; COSTS; NETWORK MANAGEMENT; PARALLEL ARCHITECTURES; RESOURCE ALLOCATION;

BRANCH-AND-BOUND ALGORITHMS; DYNAMIC SCHEDULING; DYNAMIC SCHEDULING PROBLEMS; MULTI PROCESSOR ARCHITECTURE; ONLINE OPTIMIZATION; SCHEDULING TECHNIQUES; SIMULATED PERFORMANCE; SYNCHRONIZATION COST;

SCHEDULING;

EID: 0006494695     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1994.179     Document Type: Conference Paper

References (12)

1. S. Shekhar and B. Hamidzadeh, "SARTS: A Dependable Dynamic Scheduling Algorithm," IEEE Transactions on Knowledge and Data Engineering, (under final review).
2. J. Liu and V. A. Saletore, "Self-Scheduling on Distributed-Memory Machines," ACM International Conference on Supercomputing, pp. 814-823, 1993.
3. C. Polychronopoulos and D. Kuck, "Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers," IEEE Transactions on Computers, vol. C-36, no. 12, pp. 1425-1439, December 1987. (Pubitemid 18537642)
4. S. F. Hummel, E. Schonberg, and L. E. Flynn, "Factoring: A Practical and Robust Method for Scheduling Parallel Loops," Proceedings Supercomputing '91, pp. 610-619, 1991.
5. T. H. Tzen and L. M. Ni, "Dynamic Loop Scheduling for Shared Memory Multiprocessors," International Conference on Parallel Processing, vol. 2, pp. 247-250, 1991.
6. E. P. Markatos and T. J. LeBlanc, "Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors," Proceedings of Supercomputing, pp. 104-113, 1992.
7. D. C. Rudolph and C. Polychronopoulos, "An Efficient Message Passing Scheduler Based on Guided Self Scheduling," Proc. of the 3rd International Conference on Supercomputing, pp. 50-60, 1989.
8. V. A. Saletore, J. Liu, and B. Y. Lam, "Scheduling Non-uniform Parallel Loops on Distributed Memory Machines," Proc. of Hawaii International Conference on System Sciences, vol. 2, pp. 516-525, 1993.
9. N. J. Nilsson, Principles of Artificial Intelligence, Tioga, Palo Alto, CA, 1980.
10. C. C. Shen and W. H. Tsai, "A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion," Transactions on Computers, IEEE, March, 1985.
11. B. Hamidzadeh and D. J. Lilja, "Self-Adjusting Scheduling: An On-Line Optimization Technique for Locality Management and Load Balancing," Minnesota Supercomputer Institute Technical Report, February 1994.
12. C. J. Beckmann and C. D. Polychronopoulos, "The Effect of Barrier Synchronization and Scheduling Overhead on Parallel Loops," International Conference on Parallel Processing, Vol. II: Software, pp. 200-204, 1989.