Performance evaluation of gang scheduling for parallel and distributed multiprogramming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1291, Issue , 1997, Pages 277-298

  Wang, Fang ^a   Papaefthymiou, Marios ^b   Squillante, Mark ^c  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPROGRAMMING; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

EVENT-DRIVEN SIMULATORS; GANG SCHEDULING; HIERARCHICAL CONTROL; JOB MIGRATION; MEMORY OVERHEADS; PERFORMANCE IMPACT; POTENTIAL BENEFITS; TIME QUANTUM;

JOB SHOP SCHEDULING;

EID: 84956998801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63574-2_26     Document Type: Conference Paper

References (30)

1. T. Beretvas and W. H. Tetzlaff. Paging enhancements in VM/SP HPO 3.4. Technical Report TB GG22-9467, IBM Washington Syst. Center, May 1984.
2. D. L. Eager, J. Zahorjan, and E. D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Trans. Comp., 38:408-423, March 1989.
3. D. G. Feitelson. Packing schemes for gang scheduling. In Job Sched. Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pages 89-110. Springer-Verlag, 1996. LNCS Vol. 1162.
4. D. G. Feitelson and L. Rudolph. Distributed hierarchical control for parallel processing. Computer, pages 65-77, May 1990.
5. D. G. Feitelson and L. Rudolph. Mapping and scheduling in a shared parallel environment using distributed hierarchical control. In Proc. International Conf. Parallel Processing, volume I, pages 1-8, August 1990.
6. D. G. Feitelson and L. Rudolph. Gang scheduling performance benefits for fine- grain synchronization. J. Parallel and Distr. Comp., 16(4):306-318, December 1992.
7. D. G. Feitelson and L. Rudolph. Evaluation of design choices for gang scheduling using distributed hierarchical control. J. Parallel and Distr. Comp., 35:18-34, 1996.
8. H. Franke, P. Pattnaik, and L. Rudolph. Gang scheduling for highly efficient distributed multiprocessor systems. In Proc. Frontiers’96, 1996.
9. A. Hori, H. Tezuka, Y. Ishikawa, N. Soda, H. Konaka, and M. Maeda. Implementation of gang-scheduling on workstation cluster. In Job Sched. Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pages 126-139. Springer-Verlag, 1996. LNCS Vol. 1162.
10. S. G. Hotovy. Workload evolution on the Cornell Theory Center IBM SP2. In Job Sched. Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pages 27-40. Springer-Verlag, 1996. LNCS Vol. 1162.
11. S. G. Hotovy. Personal communication. 1997.
12. S. G. Hotovy, D. J. Schneider, and T. O’Donnell. Analysis of the early workload on the Cornell Theory Center IBM SP2. In Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Comp. Syst., pages 272-273, May 1996.
13. N. Islam, A. Prodromidis, M. S. Squillante, L. L. Fong, and A. S. Gopal. Extensible resource mangement for cluster computing. In Proc. International Conf. Distr, Comp. Syst., May 1997.
14. N. Islam, A. Prodromidis, M. S. Squillante, A. S. Gopal, and L. L. Fong. Extensible resource scheduling for parallel scientific applications. In Proc. Eighth SIAM Conf. Parallel Processing for Scientific Comp., March 1997.
15. T. Kimbrel, A. Tomkins, R. H. Patterson, B. Bershad, P. Cao, E. W. Felten, G. A. Gibson, A. R. Karlin, and K. Li. A trace-driven comparison of algorithms for parallel prefetching and caching. In Proc. USENIX Symp. Operating Syst. Design and Implementation (OSDI), pages 19-34, October 1996.
16. V. M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Trans. Comp., 37(11):1384-1397, November 1988.
17. T. C. Mowry, A. K. Demke, and O. Krieger. Automatic compiler-inserted I/O prefetching for out-of-core applications. In Proc. USENIX Symp. Operating Syst. Design and Implem. (OSDI), pages 3-17, October 1996.
18. J. K. Ousterhout. Scheduling techniques for concurrent syst. In Proc. Third International Conf. Distr. Comp. Syst., pages 22-30, October 1982.
19. V. G. Peris, M. S. Squillante, and V. K. Naik. Analysis of the impact of memory in distributed parallel processing systems. In Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Comp. Syst., pages 5-18, May 1994.
20. J. Skovira, W. Chan, H. Zhou, and D. Lifka. The EASY-LoadLeveler API project. In Job Sched. Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pages 41-47. Springer-Verlag, 1996. LNCS Vol. 1162.
21. M. S. Squillante, F. Wang, and M. Papaefthymiou. An analysis of gang scheduling for multiprogrammed parallel computing environments. In Proc. Annual ACM Symp. Parallel Algorithms and Architectures (SPAA), pages 89-98, June 1996.
22. M. S. Squillante, F. Wang, and M. Papaefthymiou. Stochastic analysis of gang scheduling in parallel and distributed syst. Perf. Eval., 27&28;273-296, 1996.
23. W. H. Tetzlaff. Paging in the VM/XA system product. CMG Trans., 66:55-64, 1989.
24. W. H. Tetzlaff. Paging in VM/ESA. In Proc. CMG’91 Conf., pages 723-734, 1991.
25. W. H. Tetzlaff and T. Beretvas. Paging in VM/370 operating systems. CMG Trans., 53:65-76, 1986.
26. W. H. Tetzlaff, T. Beretvas, W. M. Buco, J. Greenberg, D. R. Patterson, and G. A. Spivak. A page-swapping prototype for VM/HPO. IBM Syst. J., 26:215-230, 1987.
27. W. H. Tetzlaff and R. Flynn. A comparison of page replacement algorithms. In Proc. CMG’92 Conf., pages 1136-1143, 1992.
28. W. H. Tetzlaff, M. G. Kienzle, and J. A. Garay. Analysis of block-paging strategies. IBM J. Res. and Devel, 33(1):51-59, January 1989.
29. F. Wang. Multiprogramming for parallel and distributed systems. PhD thesis, Computer Science Department, Yale University, 1997.
30. F. Wang, H. Franke, M. Papaefthymiou, P. Pattnaik, L. Rudolph, and M. S. Squillante. A gang scheduling design for multiprogrammed parallel computing environments. In Job Sched. Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pages 111-125. Springer-Verlag, 1996. LNCS Vol. 1162.