Abstract
Statistics of a parallel workload on a 128-node iPSC/860 located at NASA Ames are presented. It is shown that while the number of sequential jobs dominates the number of parallel jobs, most of the resources (measured in node-seconds) were consumed by parallel jobs. Moreover, most of the sequential jobs were for system administration. The average runtime of jobs grew with the number of nodes used, so the total resource requirements of large parallel jobs were larger by more than the number of nodes they used. The job submission rate during peak day activity was somewhat lower than one every two minutes, and the average job size was small. At night, submission rate was low but job sizes and system utilization were high, mainly due to NQS. Submission rate and utilization over the weekend were lower than on weekdays. The overall utilization was 50%, after accounting for downtime. About 2/3 of the applications were executed repeatedly, some for a significant number of times.
Preview
Unable to display preview. Download preview PDF.
References
A. K. Agrawala, J. M. Mohr, and R. M. Bryant, “An approach to the workload characterization problem”. Computer 9(6), pp. 18–32, Jun 1976.
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.
E. Barszcz, “Intercube communication for the iPSC/860”. In Scalable High-Performance Comput. Conf., pp. 307–313, 1992.
M. Calzarossa and G. Serazzi, “A characterization of the variation in time of work-load arrival patterns”. IEEE Trans. Comput. C-34(2), pp. 156–162, Feb 1985.
M. Calzarossa and G. Serazzi, “Workload characterization: a survey”. Proc. IEEE 81(8), pp. 1136–1150, Aug 1993.
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.
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.
D. G. Feitelson and L. Rudolph, “Wasted resources in gang scheduling”. In 5th Jerusalem Conf. Information Technology, pp. 127–136, IEEE Computer Society Press, Oct 1990.
D. Ferrari, “Workload characterization and selection in computer performance measurement”. Computer 5(4), pp. 18–24, Jul/Aug 1972.
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.
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.
P. Heidelberger and S. S. Lavenberg, “Computer performance evaluation methodology”. IEEE Trans. Comput. C-33(12), pp. 1195–1220, Dec 1984.
Intel Corp., iPSC/860 Multi-User Accounting, Control, and Scheduling Utilities Manual. Order number 312261-002, May 1992.
D. Kotz and N. Nieuwejaar, “Dynamic file-access characteristics of a production parallel scientific workload”. In Supercomputing '94, pp. 640–649, Nov 1994.
S. Krakowiak, Principles of Operating Systems. MIT Press, 1988.
P. Krueger and R. Chawla, “The stealth distributed scheduler”. In 11th Intl. Conf. Distributed Comput. Syst., pp. 336–343, May 1991.
P. Krueger, T-H. Lai, and V. A. Radiya, “Processor allocation vs. job scheduling on hypercube computers”. In 11th Intl. Conf. Distributed Comput. Syst., pp. 394–401, May 1991.
M. Kumar, “Measuring parallelism in computation-intensive scientific/engineering applications”. IEEE Trans. Comput. 37(9), pp. 1088–1098, Sep 1988.
S. T. Leutenegger and M. K. Vernon, “The performance of multiprogrammed multiprocessor scheduling policies”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 226–236, May 1990.
S. Majumdar, D. L. Eager, and R. B. Bunt, “Characterisation of programs for scheduling in multiprogrammed parallel systems”. Performance Evaluation 13(2), pp. 109–130, 1991.
S. Majumdar, D. L. Eager, and R. B. Bunt, “Scheduling in multiprogrammed parallel systems”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 104–113, May 1988.
P. Messina, “The Concurrent Supercomputing Consortium: year 1”. IEEE Parallel & Distributed Technology 1(1), pp. 9–16, Feb 1993.
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.
K. C. Sevcik, “Characterization of parallelism in applications and their use in scheduling”. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 171–180, May 1989.
J. P. Singh, J. L. Hennessy, and A. Gupta, “Scaling parallel programs for multi-processors: methodology and examples”. Computer 26(7), pp. 42–50, Jul 1993.
X-H. Sun and L. M. Ni, “Scalable problems and memory-bounded speedup”. J. Parallel & Distributed Comput. 19(1), pp. 27–37, Sep 1993.
P. H. Worley, “The effect of time constraints on scaled speedup”. SIAM J. Sci. Statist. Comput. 11(5), pp. 838–858, Sep 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feitelson, D.G., Nitzberg, B. (1995). Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1995. Lecture Notes in Computer Science, vol 949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60153-8_38
Download citation
DOI: https://doi.org/10.1007/3-540-60153-8_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60153-1
Online ISBN: 978-3-540-49459-1
eBook Packages: Springer Book Archive