Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860

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

Volumn 949, Issue , 1995, Pages 337-360

  Feitelson, Dror G ^a   Nitzberg, Bill ^b,c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b NASA AMES RESEARCH CENTER   (United States)

^c NASA Contract NAS 2 12981 ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

JOB CHARACTERISTICS; JOB SUBMISSION; PARALLEL WORKLOADS; RESOURCE REQUIREMENTS; SCIENTIFIC WORKLOADS; SEQUENTIAL JOBS; SYSTEM ADMINISTRATION; SYSTEM UTILIZATION;

NASA;

EID: 84947791890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60153-8_38     Document Type: Conference Paper

References (27)

1. A. K. Agrawala, J. M. Mohr, and R. M. Bryant, “An approach to the work/oad characterization problem”. Computer 9(6), pp. 18-32, Jun 1975.
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, Apt 1967.
3. E. Barszcz, “Intercube communication for the LPSC/860”. In Scalable High- Performance Comput. Conf., pp. 307-313, 1992.
4. M. Calzarossa and G. Serazzi, “A characterization of the variation in time of workload arrival patterns”. IEEE Trans. Comput. C-34(2), pp. 156-162, Feb 1985.
5. M. Calsarossa and G. Serazzi, “Workload characterization: a survey”. Proc. IEEE 81(8), pp. 1136-1150, Aug 1993.
6. S-H. Chiang, R. K. Mansharamani, and M. K. Vernon, “Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 33-44, May 1994.
7. M. V. Devarakonda and R. K. Iyer, “Predictability of process resource usage: a measurement-based study on UNIX”. IEEE Trans. Softw. Eng. 15(12), pp. 1579-1586, Dec 1989.
8. D. G. Feitelson and L. Rudolph, “Wasted resources in gang scheduling”. In 5th Jerusalem Conf. Information Technology, pp. 127-135, IEEE Computer Society Press, Oct 1990.
9. D. Ferrari, “Workload characterization and selection in computer performance measurement”. Computer 5(4), pp. 18-24, Jul/Aug 1972.
10. J. L. Gustafson, “Reevaluating Amdahl's law”. Comml ACM 31(5), pp. 532-533, May 1988. See also Comm. ACM32(2), pp. 262-264, Feb 1989, and Comm. ACM a2(8), spp. 1014-1016, Aug 1989.
11. J. L. Gustafson, G. R. Montry and R. E. Benner, “Development of parallel methods for a 1024-processor hypercube”. SIAM J. Sci. Statist. Comput. 9(4), pp. 609-638, Jul 1988.
12. P. Heidelberger and S. S. Lavenberg, “Computer performance evaluation methodology”. IEEE Trans. Comput. C-33(12), pp. 1195-1220, Dec 1984.
13. Intel Corp., iPSC/860 Multi-User Accounting, Control, and Scheduling Utilities Manual. Order number 312261-002, May 1992.
14. D. Kotz and N. Nieuwejaar, “Dynamic Ale-access characteristics of a production parallel scientis workload”. In Supercomputing ‘94, pp. 640-649, Nov 1994.
15. S. Krakowiak, Principles of Operating Systems. MIT Press, 1988.
16. P. Krueger and R. Chawla, “The stealth distributed scheduler”. In 11th Intl. Conf. Distributed Comput. Syst., pp. 336-343, May 1991.
17. P. Krueger, T-H. Lai, and V. A. Radiya, “Processor aflocation vs. job scheduling on hypercube computers”. In 11th Intl. Conf. Distributed Comput. Syst., pp. 394-401, May 1991.
18. M. Kumar, “Measuring parallelism in computation-intensive scientific/engineering applications”. IEEE Trans. Comput. 37(9), pp. 1088-1098, Sep 1988.
19. S. T. Leutenegger and M. K. Vernon, “The performance of multi programmed multi proeessor scheduling policies”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 226-236, May 1990.
20. S. Majumdar, D. L. Eager, and R. B. Bunt, “Charaeterisation of programs for scheduling in multiprogrammed parallel systems”. Performance Evaluation 13(2), pp. 109-130, 1991.
21. S. Majumdar, D. L. Eager, and R. B. Bunt, “Scheduling in multiprogrammed parnile1 systems”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 104-113, May 1988.
22. P. Messina, “The Concurrent Supercomputing Consortium: year 1”. IEEE Parallel &J Distributed Technology 1(1), pp. 9-16, Feb 1993.
23. V. K. Naik, S. K. Setia, and M. S. Squillante, Performance Analysis of Job Scheduling Policies in Parallel Supercomputer Environments. Research Report RC 19138 (82333), IBM T. J. Watson Research Center, Sep 1993. Also in Supercomputing ‘93.
24. K. C. Sevcik, “Characterization of parallelism in applications and their use in scheduling”. In SIGMETRIOS Conf. Measurement & Modeling of Gomput. Syst., pp. 171-180, May 1989.
25. J. P. Singh, J. L. ttennessy, and A. Gupta, “Sealing parallel programs for multiprocessors: methodology and examples”. Computer 26(7), pp. 42-50, Jul 1993.
26. X-H. Sun and L. M. Ni, “Sealable problems and memory-bounded speedup”. J. Parallel & J Distributed Gomput. 19(1), pp. 27-37, Sep 1993.
27. P. H. Worley, “The effect of time constraints on sealed speedup”. SIAM J. Sci. Statist. Oomput. 11(5), pp. 838-858, Sep 1990