Coordinated allocation of memory and processors in multiprocessors

Performance Evaluation Review

Volumn 24, Issue 1, 1996, Pages 57-67

  Parsons, Eric W ^a   Sevcik, Kenneth C ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COORDINATED ALLOCATION; EQUI-ALLOCATION; MULTIPROGRAMMED MULTIPROCESSOR SYSTEMS; PARALLEL JOBS; THROUGHPUT BOUNDS; WORKLOADS;

COMPUTER SIMULATION; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; STORAGE ALLOCATION (COMPUTER);

COMPUTER OPERATING SYSTEMS;

EID: 0030146220     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/233008.233023     Document Type: Article

References (21)

1. Gail Alverson, Simon Kahan, Richard Korry, Cathy McCann, and Burton Smith. Scheduling on the Tera MTA. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 19-44. Springer-Verlag, 1995.
2. Douglas C. Burger, Rahmat S. Hyder, Barton P. Miller, and David A. Wood. Paging tradeoffs in distributed-shared-memory multiprocessors. In Proceedings Supercomputing '94, November 1994.
3. Su-Hui Chiang, Rajesh K. Mansharamani, and Mary K. Vernon. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement and Modelling of Computer Systems, pages 33-44, 1994.
4. Edward G. Coffman. Studying multiprogrammed systems. Datamation, pages 47-54, June 1967.
5. Derek L. Eager, John Zahorjan, and Edward D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Transactions on Computers, 38(3):408-423, March 1989.
6. Dror G. Feitelson and Bill Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 337-360. Springer-Verlag, 1995.
7. D. G. Feitelson and L. Rudolph. Gang scheduling performance benefits for fine-grain synchronization. Journal of Parallel and Distributed Computing, 16:306-318, 1992.
8. Dipak Ghosal, Guiseppe Serazzi, and Satish K. Tripathi. The processor working set and its use in scheduling multiprocessor systems. IEEE Transactions on Software Engineering, 17(5):443-453, May 1991.
9. Anoop Gupta, Andrew Tucker, and Shigeru Urushibara. The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications. In Proceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 120-132, 1991.
10. Cathy McCann and John Zahorjan. Processor allocation policies for message-passing parallel computers. In Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 19-32, 1994.
11. Cathy McCann and John Zahorjan. Scheduling memory constrained jobs on distributed memory parallel computers. In Proceedings of the 1995 ACM SIGMETRICS Joint International Conference on Measurement and Modelling of Computer Systems, pages 208-219, 1995.
12. Eric W. Parsons and Kenneth C. Sevcik. Coordinated allocation of memory and processors in multiprocessors. Technical Report 336, Computer Systems Research Institute, University of Toronto, 1995.
13. Eric W. Parsons and Kenneth C. Sevcik. Multiprocessor scheduling for high-variability service time distributions. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 127-145. Springer-Verlag, 1995.
14. Vinod G. J. Peris, Mark S. Squillante, and Vijay K. Naik. Analysis of the impact of memory in distributed parallel processing systems. In Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 5-18, 1994.
15. Sanjeev Setia. The interaction between memory allocations and adaptive partitioning in message-passing multiprocessors. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 146-164. Springer-Verlag, 1995.
16. Kenneth C. Sevcik. Characterizations of parallelism in applications and their use in scheduling. In Proceedings of the 1988 ACM SIGMETRICS International Conference on Measurement and Modelling of Computer Systems, pages 171-180, May 1989.
17. K. C. Sevcik. Application scheduling and processor allocation in multiprogrammed parallel processing systems. Performance Evaluation, 19:107-140, 1994.
18. Xian-He Sun and L. Ni. Scalable problems and memory-bounded speedup. Journal of Parallel and Distributed Computing, 19(1):27-37, Sept 1993.
19. Sanjeev Setia and Satish Tripathi. A comparative analysis of static processor partitioning policies for parallel computers. In Proceedings of the International Workshop on Modeling and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 283-286, January 1993.
20. Andrew Tucker and Anoop Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedings of the 12th ACM Symposium on Operating Systems Principles, pages 159-166, 1989.
21. Chee-Shong Wu. Processor scheduling in multiprogrammed shared memory NUMA multiprocessors. Technical Report 341, Computer Systems Research Institute, University of Toronto, 1993.