Memory usage in the LANL CM-5 workload

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

Volumn 1291, Issue , 1997, Pages 78-94

  Feitelson, Dror G ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

DISCRETE COMPONENTS; MEMORY REQUIREMENTS; MEMORY SCHEDULING; MEMORY-RESIDENT; PARALLEL JOBS; PARALLEL MACHINE; PROCESSOR MEMORY; PRODUCTION WORKLOADS;

PARALLEL PROCESSING SYSTEMS;

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

References (20)

1. G. Alverson, S. Kahan, R. Korry, C. McCann, and B. Smith, “Scheduling on the Tera MTA”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitel-son and L. Rudolph (eds.), pp. 19-44, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.
2. G. M. Amdahl, “Validity of the single processor approach to achieving large scale computer capabilities”. In AFIPS Spring Joint Comput. Conf., vol. 30, pp. 483-485, Apr 1967.
3. J. J. Dongarra, H. W. Meuer, and E. Strohmaier, “TopSOO supercomputer sites”. http://www.netlib.org/benchmark/top500.html. (updated every 6 months).
4. D. G. Feitelson, “Packing schemes for gang scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 89-110, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.
5. D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. 3. Watson Research Center, Oct 1994.
6. D. G. Feitelson and M. A. Jette, “Improved utilization and responsiveness with gang scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer Verlag, 1997. Lecture Notes in Computer Science (this volume).
7. D. G. Feitelson and B. Nitzberg, “Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 337-360, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.
8. D. G. Feitelson and L. Rudolph, “Parallel job scheduling: issues and approaches”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1-18, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.
9. D. G. Feitelson and L. Rudolph, “Toward convergence in job schedulers for parallel supercomputers”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1-26, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.
10. J. L. Gustafson, “Reevaluating Amdahl’s law”. Comm. ACM 31(5), pp. 532-533, May 1988. See also Comm. ACM 32(2), pp. 262-264, Feb 1989, and Comm. ACM 32(8), pp. 1014-1016, Aug 1989.
11. C. McCann and J. Zahorjan, “Scheduling memory constrained jobs on distributed memory parallel computers”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 208-219, May 1995.
12. Minnesota Supercomputer Center, Inc., The Distributed Job Manager Administration Guide. 1993. ftp://ec.msc.edu/pub/LIGHTNING/djm_1.0.0_src.tar.Z.
13. E. W. Parsons and K. C. Sevcik, “Coordinated allocation of memory and processors in multiprocessors”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 57-67, May 1996.
14. V. G. J. Peris, M. S. SquiUante, and V. K. Naik, “Analysis of the impact of memory in distributed parallel processing systems”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 5-18, May 1994.
15. S. K. Setia, “The interaction between memory allocation and adaptive partitioning in message-passing multicomputers”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 146-165, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.
16. J. P. Singh, J. L. Hennessy, and A. Gupta, “Scaling parallel programs for multiprocessors: methodology and examples”. Computer 26(7), pp. 42-50, Jul 1993.
17. X-H. Sun and L. M. Ni, “Scalable problems and memory-bounded speedup”, J. Parallel & Distributed Comput. 19(1), pp. 27-37, Sep 1993.
18. Thinking Machines Corp., Connection Machine CM-5 Technical Summary. Nov 1992.
19. K. Y. Wang and D. C. Marinescu, “Correlation of the paging activity of individual node programs in the SPMD execution model”. In 28th Hawaii Intl. Conf. System Sciences, vol. I, pp. 61-71, Jan 1995.
20. P. H. Worley, “The effect of time constraints on scaled speedup”. SIAM J. Sci. Statist. Comput. 11(5), pp. 838-858, Sep 1990.