Hybrid preemptive scheduling of message passing interface applications on grids

International Journal of High Performance Computing Applications

Volumn 20, Issue 1, 2006, Pages 77-90

  Bouteiller, Aurelien ^a   Bouziane, Hinde Lilia ^a   Herault, Thomas ^a   Lemarinier, Pierre ^a   Cappello, Franck ^a  

^a INRIA   (France)

Author keywords

Co scheduling; Gang scheduling; Grid; Message passing interface; Performance; Scheduling; Time sharing

Indexed keywords

OPTIMAL SYSTEMS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; TIME SHARING SYSTEMS; USER INTERFACES;

GANG SCHEDULING; GRID; HYBRID PREEMPTIVE SCHEDULING; MESSAGE PASSING INTERFACE;

HYBRID COMPUTERS;

EID: 33646940970     PISSN: 10943420     EISSN: 17412846     Source Type: Journal    
DOI: 10.1177/1094342006062526     Document Type: Article

References (16)

1. Bailey, D., Harris, T., Saphir, W., Wijngaart, R. V. D., Woo, A., and Yarrow, M. 1995. The NAS Parallel Benchmarks 2.0. Report NAS-95-020, Numerical Aerodynamic Simulation Facility, NASA Ames Research Center.
2. Bouteiller, A., Lemarinier, P., Krawezik, G., and Cappello, F. 2003. Coordinated checkpoint versus message log for fault-tolerant MPI. Proceedings of the IEEE International Conference on Cluster Computing (Cluster 2003), Hong Kong, December, IEEE Computer Society Press, Los Alamitos, CA.
3. da Silva, F. A. B. and Scherson, I. D. 2000. Improving parallel job scheduling using runtime measurements. Proceedings of the 6th Workshop on Job Scheduling Strategies for Parallel Processing (IPPS'00), Cancun, Mexico, May, pp. 18-38.
4. Feitelson, D. G. and Jette, M. A. 1997. Improved utilization and responsiveness with gang scheduling. Proceedings of the 3rd Workshop on Job Scheduling Strategies for Parallel Processing (IPPS'97), Geneva, Switzerland, April, D. G. Feitelson and L. Rudolph, editors, Vol. 1291, Springer-Verlag, Berlin, pp. 238-261.
5. Gropp, W., Lusk, E., Doss, N., and Skjellum, A. 1996. High performance, portable implementation of the MPI message passing interface standard. Parallel Computing 22 (6): 789-828.
6. Henderson, R. L. 1995. Job scheduling under the portable batch system. Proceedings of the 1st Workshop on Job Scheduling Strategies for Parallel Processing (IPPS'95), Santa Barbara, CA, April, pp. 279-294.
7. Hori, A., Tezuka, H., Ishikawa, Y., Soda, N., Konaka, H., and Maeda, M. 1996. Implementation of gang-scheduling on workstation cluster. Proceedings of the 2nd Workshop on Job Scheduling Strategies for Parallel Processing (IPPS'96), Honolulu, HI, April, D. G. Feitelson and L. Rudolph, editors, Springer-Verlag, Berlin, pp. 126-139.
8. Hori, A., Tezuka, H., and Ishikawa, Y. 1998. Overhead analysis of preemptive gang scheduling. Lecture Notes in Computer Science, Vol. 1459, Springer-Verlag, Berlin, pp. 217-230.
9. Lee, W., Frank, M., Lee, V., Mackenzie, K., and Rudolph, L. 1997. Implications of I/O for gang scheduled workloads. Proceedings of the 3rd Workshop on Job Scheduling Strategies for Parallel Processing (IPPS'97), Geneva, Switzerland, April, D. G. Feitelson and L. Rudolph, editors, Vol. 1291, Springer-Verlag, Berlin, pp. 215-237.
10. Lemarinier, P., Bouteiller, A., Herault, T., Krawezik, G., and Cappello, F. 2004. Improved message logging versus improved coordinated checkpointing for fault-tolerant MPI. Proceedings of the IEEE International Conference on Cluster Computing (Cluster 2004), San Diego, CA, September, IEEE Computer Society Press, Los Alamitos, CA.
11. Parsons, E. W. and Sevcik, K. C. 1997. Implementing multiprocessor scheduling disciplines. Proceedings of the 3rd Workshop on Job Scheduling Strategies for Parallel Processing (IPPS'97), Geneva, Switzerland, April, D. G. Feitelson and L. Rudolph, editors, Vol. 1291, Springer-Verlag, Berlin, pp. 166-192.
12. Ryu, K. D., Pachapurkar, N., and Fong, L. L. 2004. Adaptive memory paging for efficient gang scheduling of parallel applications. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04), Santa Fe, NM, April.
13. Snell, Q., Mikler, A., and Gustafson, J. 1996. Netpipe: A network protocol independent performance evaluator. Proceedings of the IASTED International Conference on Intelligent Information Management and Systems, Washington, DC, June.
14. Strazdins, P. and Uhlmann, J. 2004. A comparison of local and gang scheduling on a Beowulf cluster. Proceedings of the 2004 IEEE International Conference of Cluster Computing, San Diego, CA, September, IEEE Computer Society Press, Los Alamitos, CA, pp. 55-62.
15. Tezuka, H., Hori, A., Ishikawa, Y., and Sato, M. 1997. PM: An operating system coordinated high performance communication library. Proceedings of the International Conference and Exhibition on High Performance Computing and Networking, Vienna, Austria, April, Springer-Verlag, Berlin, pp. 708-717.
16. Wiseman, Y. and Feitelson, D. G. 2003. Paired gang scheduling. IEEE Transactions on Parallel and Distributed Systems 14: 581-592.