Using moldability to improve the performance of supercomputer jobs

Journal of Parallel and Distributed Computing

Volumn 62, Issue 10, 2002, Pages 1571-1601

  Cirne, Walfredo ^a   Berman, Francine ^b  

^a FEDERAL UNIVERSITY OF CAMPINA GRANDE   (Brazil)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036802314     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(02)91869-1     Document Type: Article

References (36)

1. K. Aida, Effect of job size characteristics on job scheduling performance, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1911, Springer-Verlag, Berlin, 2000.
2. K. Aida, H. Kasahara, and S. Narita, Job scheduling scheme for pure space sharing among rigid jobs, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1459, Springer-Verlag, Berlin, 1998.
3. S. Anastasiadis and K. Sevcik, Parallel application scheduling on networks of workstations (Special Issue on Workstation Clusters and Network-based Computing), J. Parallel Distrib. Comput., 43(2) (June 1997), 109-124.
4. F. Berman and R. Wolski, The AppLeS Project: A status report, in "Proceedings of the 8th NEC Research Symposium," Berlin, Germany, May 1997, available at http://www.cs.ucsd.edu/groups/hpcl/ apples/hetpubs.html
5. S.-H. Chiang, R. Mansharamani, and M. Vernon, Use of applications characteristics and limited pre-emption for run-to-completion parallel processor scheduling policies, in "Proceedings of the 1994 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems," Nashville, TN, 1994.
6. W. Cirne, "Using Moldability to Improve the Performance of Supercomputer Jobs." Ph.D. thesis, University of California, San Diego, February 2001, available at http://walfredo.dsc.ufpb.br/ publications/thesis.pdf
7. W. Cirne and F. Berman, A model for moldable supercomputer jobs, in "Proceedings of the IPDPS 2001: International Parallel and Distributed Processing Symposium," San Francisco, CA, April 2001, available at http://walfredo.dsc.ufpb.br/resume.html#publications
8. W. Cirne and F. Berman, A comprehensive model of the supercomputer workload, in "Proceedings of the WWC-4: IEEE 4th Annual Workshop on Workload Characterization," Austin, TX, December 2001, available at http://walfredo.dsc.ufpb.br/resume.html#publications
9. W. Cirne and F. Berman, When the herd is smart: Aggregate behavior in the selection of job request, IEEE Trans. Parallel Distrib. Systems (2001), Accepted for publication, available at http://walfredo.dsc.ufpb.br/resume.html#publications
10. A. Downey, "A Model for Speedup of Parallel Programs," U.C. Berkeley Technical Report CSD-97-933, January 1997, available at http://www.sdsc.edu/~downey/model/
11. A. Downey, Predicting queue times on space-sharing parallel computers, in "Proceedings of the IPPS'97: 11th International Parallel Processing Symposium," Geneva, Switzerland, April 1997, available at http://www.sdsc.edu/~downey/predicting/
12. A. Downey, Using queue time predictions for processor allocation, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1297, Springer-Verlag, Berlin, 1997, available at http://www.sdsc.edu/~downey/predalloc/
13. A. Downey and D. Feitelson, The elusive goal of workload characterization, Performance Evaluation Rev. 26(4), (March 1999) 14-29, available at http://www.cs.huji.ac.il/~feit/pub.html
14. D. Eager, J. Zahorjan, and E. Lazowska, Speedup versus efficiency in parallel systems, IEEE Trans. Comput. 138(3) (March 1989) 408-423.
15. D. Feitelson and A. Mu'alem Weil, Utilization and predictability in scheduling the IBM SP2 with backfilling, in "Proceeding of the 12th International Parallel Processing Symposium," pp. 542-546, Orlando, FL, April 1998, available at http://www.cs.huji.ac.il/~feit/pub.html
16. D. Feitelson and L. Rudolph, Metrics and benchmarking for parallel job scheduling, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1459, pp. 1-24, Springer-Verlag, Berlin, 1998.
17. D. Feitelson, L. Rudolph, U. Schweigelshohn, K. Sevcik, and P. Wong, Theory and practice in parallel job scheduling, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1297, pp. 1-34, Springer-Verlag, Berlin, 1997, available at http://www.cs.huji.ac.il/~feit/parsched/parsched97.html
18. D. Ghosal, G. Serazzi, and S.K. Tripathi, The processor working set and its use in scheduling multiprocessor systems, IEEE Trans. Software Eng. 17(5) (May 1991), 443-453.
19. R. Gibbons, A historical application profiler for use by parallel schedulers, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1297, pp. 58-75, Springer-Verlag, Berlin, 1997.
20. R. Henderson, Job scheduling under the portable batch system, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 949, pp. 337-360, Springer-Verlag, Berlin, 1995.
21. T. Hogg and B. Huberman, Controlling chaos in distributed systems, IEEE Trans. Systems, Man, Cybernet. 21(6) (November/December 1991), 1325-1332.
22. J. Krallmann, U. Schwiegelshohn, and R. Yahyapour, On the design and evaluation of job scheduling algorithms, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1659, Springer-Verlag, Berlin, 1999.
23. D. Lifka, The ANL/IBM SP scheduling system, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 949, Springer-Verlag, Berlin, 1995, available at http://www.tc.cornell.edu/UserDoc/SP/Batch/what.html
24. V. Lo, J. Mache, and K. Windisch, A comparative study of real workload traces and synthetic workload models for parallel job scheduling, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1459, pp. 25-46, Springer-Verlag, Berlin, 1998.
25. Maui High Performance Computing Center, The Maui scheduler web page, available at http://wailea.mhpcc.edu/maui/
26. M. Mitzenmacher, How useful is old information? in "PODC 97," 1997, available at http://www.research.digital.com/SRC/personal/michaelm/WORK/papers.html
27. D. Patterson, J. Hennessy, and D. Goldberg, "Computer Architecture: A Quantitative Approach," 2nd Ed, Morgan Kaufmann Publishing, Los Altos, CA, 1996.
28. Platform Computing Corp, Load sharing facility web page, available at http://www.platform.com/ platform/platform.nsf/webpage/LSF?OpenDocument
29. E. Rosti, E. Smirni, L. Dowdy, G. Serazzi, and B. Carlson, Robust partitioning schemes of multiprocessor systems, Performance Evaluation 19(2-3), (March 1994), 141-165.
30. E. Rosti, E. Smirni, L. Dowdy, G. Serazzi, and B. Carlson, Analysis of non-work-conserving processor partitioning policies, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 949, pp. 101-111, Springer-Verlag, Berlin, 1995.
31. K. Sevcik, Characterization of parallelism in applications and their use in scheduling, in "Proceedings of the 1989 ACM Sigmetrics and PERFORMANCE'89 Conference," pp. 171-80, Berkeley, CA, May 1989.
32. K. Sevcik, Application scheduling and processor allocation in multiprogrammed parallel processing systems, Performance Evaluation 19 (1994), 107-140.
33. W. Smith, V. Taylor, and I. Foster, Using run-time predictions to estimate queue wait times and improve scheduler performance, in "Job Scheduling Strategies for Parallel Processing" (D. Feitelson and L. Rudolph, Eds.), Lecture Notes in Computer Science, Vol. 1659, Springer-Verlag, Berlin, 1999, available at http://www-fp.mcs.anl.gov/~wsmith/papers.html
34. Standard Performance Evaluation Corporation, The SPEC web page, available at http: //www.spec.org/
35. J. Subhlok, T. Gross, and T. Suzuoka, Impact of job mix on optimizations for space sharing schedulers, in "Supercomputing'96," Pittsburgh, PA, 1996, available at http://www.supercomp.org/ sc96/proceedings/SC96PROC/TTITLES.HTM
36. D. Zotkin and P. Keleher, Job-length estimation and performance in backfilling schedulers, in "Proceedings of the HPDC'99: 8th International Symposium on High Performance Distributed Computing," Redondo Beach, CA, USA, 3-6 August 1999.