Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems

Volumn 4, Issue 2, 1993, Pages 131-143

  Squillante, Mark S ^a,b   Lazowska, Edward D ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Cache; models; performance analysis; queueing network; scheduling; shared memory multiprocessors

Indexed keywords

ASSOCIATIVE STORAGE; PERFORMANCE; SCHEDULING;

PERFORMANCE ANALYSIS; QUEUEING NETWORKS; SHARED MEMORY MULTIPROCESSORS;

MULTIPROCESSING SYSTEMS;

EID: 0027541973     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.207589     Document Type: Article

References (28)

1. M. Accetta, R. Baron, W. Bolosky, D. Golub, R. Rashid, A. Tevanian, and M. Young, “Mach: A new kernel foundation for UNIX development,” in Proc. USENIX Assoc. Summer Tech. Conf, June 1986, pp. 93–112.
2. A. Agarwal, M. Horowitz, and J. Hennessy, “An analytic cache model,” ACM Trans. Comput. Syst., vol. 7, no. 2, pp. 184–215, May 1989.
3. M. J. Bach, The Design of the UNIX Operating System. Englewood Cliffs, NJ: Prentice-Hall, 1986.
4. B. N. Bershad, E. D. Lazowska, and H. M. Levy, “PRESTO: A system for object-oriented parallel programming,” Software: Practice and Experience, vol. 18, no. 8, pp. 713–732, Aug. 1988.
5. R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling. Reading, MA: Addison-Wesley, 1967.
6. D. H. Craft, “Resource management in a decentralized system,” in Proc. Ninth ACM Symp. Oper. Syst. Principles, Oct. 1983, pp. 11–19.
7. P. J. Denning, “Working sets past and present,” IEEE Trans. Software Eng., vol. SE-6, no. 1, pp. 64–84, Jan. 1980.
8. P. A. Franaszek and R. D. Nelson, “Delay cost scheduling for timesharing systems,” IBM Res. Rep. RC 13777 (#61800), June 1988.
9. E. Horowitz and S. Sahni, “Exact and approximate algorithms for scheduling nonidentical processors,” J. ACM vol. 23, no. 2, pp. 317–327, Apr. 1976.
10. N. P. Jouppi and D. W. Wall, “Available instruction-level parallelism for superscalar and superpipelined machines,” in Proc. Third Int. Conf. Architectural Support for Programming Languages and Oper. Syst., Apr. 1989, pp. 272–282.
11. L. Kleinrock, Queueing Systems, Vol. 11: Computer Applications. New York: Wiley, 1976.
12. E. L. Lawler and C. U. Martel, “Scheduling periodically occurring tasks on multiple processors,” Inform. Processing Lett., vol. 12, no. 1, pp. 9–12, Feb. 1981.
13. E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik, Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: Prentice-Hall, 1984.
14. L. M. Ni and C. E. Wu, “Design tradeoffs for process scheduling in shared memory multiprocessor systems,” IEEE Trans. Software Eng., vol. SE-15, no. 3, pp. 327–334, Mar. 1989.
15. C. H. Sauer and K. M. Chandy, Computer Systems Performance Mod-eling. Englewood Cliffs, NJ: Prentice-Hall, 1981.
16. Sequent Computer Systems, Inc. Symmetry Technical Summary, 1988.
17. M. S. Squillante, “Issues in shared-memory multiprocessor scheduling: A performance evaluation,” Ph.D. dissertation, Dep. Comput. Sci. and Eng., University of Washington, Sept. 1990.
18. M. S. Squillante and R. D. Nelson, “Analysis of task migration in shared-memory multiprocessor scheduling,” in Proc. ACM S1GMETR1CS Conf. Measurement and Modeling of Comput. Syst., May 1991, pp. 143–155.
19. H. S. Stone, personal communication, Nov. 1990.
20. B. Stroustrup, The C++ Programming Language. Reading, MA: Addison-Wesley, 1986.
21. C. P. Thacker, L. C. Stewart, and E. H. Satterthwaite, Jr., “Firefly: A multiprocessor workstation,” IEEE Trans. Comput., vol. C-37, no. 8, pp. 909–920, Aug. 1988.
22. S. S. Thakkar, P. R. Gifford, and G. F. Fieland, “Balance: A shared memory multiprocessor system,” in Proc. Second Int. Conf. Supercomput., May 1987, pp. 1–9.
23. D. Thiebaut, personal communication, June-Sept. 1989.
24. D. Thiebaut and H. S. Stone, “Footprints in the cache,” ACM Trans. Comput. Syst., vol. 5, no. 4, pp. 305–329, Nov. 1987.
25. M. K. Vernon, E. D. Lazowska, and J. Zahorjan, “An accurate and efficient performance analysis technique for multiprocessor snooping cache-consistency protocols,” in Proc. The Fifteenth Annu. Int. Symp. Comput. Architecture, June 1988, pp. 308–315.
26. J. Voldman and L. W. Hoevel, “The software-cache connection,” IBM J. Res. Develop., vol. 25, no. 6, pp. 877–893, Nov. 1981.
27. J. Voldman, B. Mandelbrot, L. W. Hoevel. J. Knight, and P. Rosenfeld, “Fractal nature of software-cache interaction,” IBM J. Res. Develop., vol. 27, no. 2. pp. 164–170, Mar. 1983.
28. A. Weinrib and G. Gopal, “Decentralized resource allocation for distributed systems,” in Proc. INFOCOM, 1987.