Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems

Volumn 5, Issue 4, 1994, Pages 379-400

  Le Blanc, Thomas J ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

^b UNIVERSITY OF ROCHESTER   (United States)

Author keywords

communication overhead; load imbalance; Loop scheduling; shared memory multiprocessors; synchronization

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DATA HANDLING; DATA PROCESSING; ITERATIVE METHODS; OPTIMIZATION; SCHEDULING; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

COMMUNICATION OVERHEAD; GUIDED SELF SCHEDULING; LOAD IMBALANCE; LOOP SCHEDULING; PROCESSOR AFFINITY; SELF SCHEDULING ALGORITHM; SHARED MEMORY MULTIPROCESSORS; STATIC SCHEDULING ALGORITHM; UNIFORM SIZED CHUNKING;

MULTIPROCESSING SYSTEMS;

EID: 0028419803     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.273046     Document Type: Article

References (32)

1. T. E. Anderson, E. D. Lazowska, and H.M. Levy, “The performance implications of thread management alternatives for shared memory multiprocessors,” IEEE Trans. Comput., vol. 38, pp. 1631–1644, Dec. 1989.
2. BBN Advanced Computers Inc., Inside the TC2000™ Computer. Cambridge, MA, 1990.
3. B.N. Bershad, E.D. Lazowska, H. M. Levy, and D. B. Wagner, “An open environment for building parallel programming systems,” Proc. ACM/SIGPLAN PPEALS 1988 Symp. Parallel Programming: Experience with Applications, Languages, and Syst., 1988, pp. 1–9.
4. S. H. Bokhari, Assignment Problems in Parallel and Distributed Computing. Boston: Kluwer, 1987.
5. W. J. Bolosky, M. L. Scott, R. P. Fitzgerald, R.J. Fowler, and A. L. Cox, “NUMA policies and their relation to memory architecture,” ProcAth Int. Conf. Architectural Support for Programming Languages and Operating Syst., 1991, pp. 212–221.
6. W. J. Bolosky, R. P. Fitzgerald, and M. L. Scott, “Simple but effective techniques for NUMA memory management,” Proc. 12th Symp. Operating Syst. Principles, 1989, 19–31.
7. A. L. Cox and R. J. Fowler, “The implementation of a coherent memory abstraction on a NUMA multiprocessor: Experiences with PLATINUM,” Proc. 12th Symp. Operating Syst. Principles, 1989, pp. 32–44.
8. M. Crovella, P. Das, C. Dubnicki, T. LeBlanc, and E. Markatos, “Multiprogramming on multiprocessors,” Proc. 3rd IEEE Symp. Parallel Distrib. Processing, 1991, pp. 590–597.
9. S. Dandamudi, “A comparison of task scheduling strategies for multiprocessor systems,” Proc. 3rd IEEE Symp. Parallel Distrib. Processing, 1991, pp. 423–426.
10. T. W. Doeppner, “Threads: A system for the support of concurrent programming,” Tech. Rep. CS-87-11, Dept. of Comput. Sci., Brown Univ., 1987.
11. D. L. Eager and J. Zahorjan, “Adaptive guided self-scheduling,” Tech. Rep. 92-01-01, Dept. of Comput. Sci. and Eng., Univ. of Wash., 1992.
12. A. Gupta, A. Tucker, and S. Urushibara, “The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications,” Proc. 1991 ACM SIGMETRICS Conf. Measurement and Modeling of Comput. Syst., 1991, 120–132.
13. R. Gupta, “Synchronization and communication costs of loop partitioning on shared-memory multiprocessor systems,” 1989 Int. Conf. Parallel Processing, vol. II, 1989, 23–30.
14. J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach. San Mateo, CA: Morgan Kaufmann, 1990.
15. S.F. Hummel, E. Schonberg, and L. E. Flynn, “Factoring: A practical and robust method for scheduling parallel loops,” Commun. ACM, vol. 35, pp. 90–101, Aug. 1992.
16. C. P. Kruskal and A. Weiss, “Allocating independent subtasks on parallel processorsIEEE Trans. Software Eng., vol. 11, no. 10, pp. 1001–1016, Oct. 1985.
17. R. P. LaRowe, and C. S. Ellis, “Experimental comparison of memory management policies for NUMA multiprocessors.” ACM Trans. Comput. Syst., vol. 9, 319–363, Nov. 1991.
18. T. G. Lewis and H. El-Rewini, Introduction of Parallel Computing. Englewood Cliffs, NJ: Prentice Hall, 1992.
19. S. Lucco, “A dynamic scheduling method for irregular parallel programs,” ACM SIGPLAN’92 Conf. Programming Language Design and Implementation, 1992, pp. 200–211.
20. E. P. Markatos and T.J. LeBlanc, “Load balancing versus locality management in shared-memory multiprocessors,” Proc. 1992 Int. Conf. Parallel Processing, vol. I, 1992, pp. 258–267.
21. E.P. Markatos and T.J. LeBlanc, “Shared-memory multiprocessor trends and the implications for parallel program performance,” Tech. Rep. 420, Univ. of Rochester, Dept. of Comput. Sci., 1992.
22. C. McCann, R. Vaswani, and J. Zahorjan, “A dynamic processor allocation policy for multiprogrammed shared memory multiprocessors,” ACM Trans. Comput. Syst., vol. 11, pp. 146–178, May 1993.
23. C. D. Polychronopoulos, Parallel Programming and Compilers. Boston: Kluwer, 1988.
24. C. D. Polychronopoulos and D.J. Kuck, “Guided self-scheduling: A practical scheduling scheme for parallel supercomputers,” IEEE Trans. Comput., vol. C-36, no. 12, pp. 1425–1439, Dec. 1987.
25. B. Smith. “Architecture and applications of the HEP computer system,” Proc. SPIE, Real-Time Signal Processing IV, 1981.
26. M. S. Squilante and E. D. Lazowska, “Using processor-cache affinity information in shared-memory multiprocessor scheduling,” IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 131–143, Feb. 1993.
27. M. S. Squillante and R. D. Nelson, “Analysis of task migration in shared-memory multiprocessor scheduling,” Proc. 1991 ACM SIGMETRICS Conf. Measurement and Modeling of Comput. Syst., 1991, pp. 143–155.
28. P. Tang and P.-C. Yew, “Processor self-scheduling for multiple nested parallel loops,” Proc. 1986 Int. Conf. Parallel Processing, 1986, pp. 528–535.
29. R. H. Thomas and W. Crowther, “The uniform system: An approach to runtime support for large scale shared memory parallel processors,” Proc. 1988 Int. Conf Parallel Processing, 1988, pp. 245–254.
30. A. Tucker and A. Gupta, “Process control and scheduling issues for multiprogrammed shared-memory multiprocessors,” Proc. 12th Symp. Operating Syst. Principles, 1989, pp. 159–166.
31. T. H. Tzen and L. M. Ni, “Trapezoid self-scheduling: A practical scheduling scheme for parallel computers,” IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 87–98, Jan. 1993.
32. R. Vaswani and J. Zahorjan, “The implications of cache affinity on processor scheduling for multiprogrammed, shared memory multiprocessors,” Proc. 13th Symp. Operating Syst. Principles, 1991, pp. 26—40.