Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers

Journal of Parallel and Distributed Computing

Volumn 58, Issue 1, 1999, Pages 109-125

  Dandamudi, Sivarama P ^a   Yu, Hai ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Processor scheduling; space sharing policies; distributed memory multicomputer systems; job structure; performance evaluation

Indexed keywords

EID: 0004426398     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1544     Document Type: Article

References (21)

1. Anastasiadis S. V., Sevcik K. C. Parallel application scheduling on networks of workstations. J. Parallel Distrib. Comput. 43:1997;109-124.
2. Au S. L., Dandamudi S. P. The impact of program structure on the performance of scheduling policies in multiprocessor systems. J. Comput. Their Appl. 3:April 1996;17-30.
3. S. Ayachi and S. Dandamudi, A hierarchical processor scheduling policy for multiprocessor systems, in IEEE Sympos. Parallel and Distributed Processing, New Orleans, 1996, pp. 100-109.
4. Dandamudi S. P. Reducing run queue contention in shared memory multiprocessors. IEEE Computer. 30:March 1997;82-89.
5. S. P. Dandamudi and T. K. Thyagaraj, A hierarchical processor scheduling policy for distributed-memory multicomputer systems, in Int. Conf. High Performance, Computing, Bangalore, India, December 1997, pp. 218-223.
6. Dandamudi S. P., Cheng S. P. A hierarchical task queue organization for shared-memory multiprocessor systems. IEEE Trans. Parallel and Distributed Systems. 6:January 1995;1-16.
7. Feitelson D. G., Rudolph L. Parallel job scheduling: Issues and approaches. Feitelson D., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science. 949:1995;1-18 Springer-Verlag, New York/Berlin.
8. Feitelson D. G., Nitzberg B. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. Feitelson D., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science. 949:1995;337-360 Springer-Verlag.
9. Feitelson D. G., Rudolph L., Schwiegelshohn U., Sevcik K. C., Wong P. Theory and practice in parallel job scheduling. Feitelson D., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science. 1291:1997;1-34 Springer-Verlag.
10. Feitelson D. G., Rudolph L. Job scheduling strategies for parallel processing. IPPS Workshop Proceedings. Lecture Notes in Computer Science. 1995-1998;Springer-Verlag.
11. Hotovy S. Workload evolution on the Cornell theory center IBM SP2. Feitelson D., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science. 1162:1996;27-40 Springer-Verlag.
12. Jann J., Pattnaik P., Franke H., Wang F., Skovira J., Riordan J. Modeling of workload in MPPs. Feitelson D. G., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science. 1997;95-116 Springer-Verlag.
13. S. T. Leutenegger and M. K. Vernon, The performance of multiprogrammed multiprocessor scheduling policies, in Proc. of ACM Sigmetrics Conf., Boulder, 1990, pp. 226-236.
14. Majumdar S., Eager D. L., Bunt R. B. Scheduling in multiprogrammed parallel systems. Proc. of ACM Sigmetrics Conf. May 1988;. p. 104-113.
15. Parsons E., Sevcik K. C. Multiprocessor scheduling for high-variability service time distributions. Feitelson D., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science. 949:1995;127-145 Springer-Verlag.
16. Rosti E., Smirni E., Serazzi G., Dowdy L. W., Carlson B. M. Robust partitioning policies for multiprocessor systems. Perform. Eval. 19:1994;141-165.
17. Rosti E., Smirni E., Dowdy L. W., Serrazi G., Sevcik K. C. Processor saving scheduling policies for multiprocessor systems. IEEE Trans. Comput. 47:February 1998;178-189.
18. Setia S. K., Squillante M. S., Tripathi S. K. Processor scheduling on multiprogrammed, distributed memory parallel systems. Proc. ACM SIGMETRICS Conference. May 1993;. p. 158-170.
19. Sevcik K. C. Application scheduling and processor allocation in multiprogrammed parallel processing systems. Performance Evaluation. 19:1994;107-140.
20. Squillante M. S. On the benefits and limitations of dynamic partitioning in parallel computer systems. Feitelson D., Rudolph L. Job Scheduling Strategies for Parallel Processing. Lecture notes in Computer Science. 949:1995;219-238 Springer-Verlag.
21. Yu H. M.Sc. Project Report. 1997.