A framework for measuring supercomputer productivity

International Journal of High Performance Computing Applications

Volumn 18, Issue 4, 2004, Pages 417-432

  Snir, Marc ^a   Bader, David A ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b University of New Mexico   (United States)

Author keywords

Benchmarks; High performance computing; Performance metrics; Productivity

Indexed keywords

BENCHMARKING; COMPUTER SOFTWARE; COSTS; DECISION MAKING; PRODUCTIVITY; PROGRAM DEBUGGING; RISK MANAGEMENT; SOFTWARE ENGINEERING;

EXECUTION TIME; HIGH PERFORMANCE COMPUTING; PERFORMANCE METRICS; PROGRAMMING TIME; SOFTWARE PRODUCTIVITY; UTILITY THEORY;

COMPUTER SYSTEMS;

EID: 9744245025     PISSN: 10943420     EISSN: None     Source Type: Journal    
DOI: 10.1177/1094342004048535     Document Type: Article

References (30)

1. Abandah, G. A. and Davidson, E. S. 1998. Configuration independent analysis for characterizing shared-memory applications. Proceedings of the 12th International Parallel Processing Symposium, 485-491, Orlando, Fl.
2. Aggarwal, A., Chandra, A. K., and Snir, M. 1989. On communication latency in PRAM computations Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, 11-21.
3. Aggarwal, A., Chandra, A. K., and Snir, M. 1990. Communication complexity of PRAMs. Theoretical Computer Science 71(1):3-28.
4. Albrecht, A. J. and Gaffney, J. E. Jr. 1983. Software function source lines of code and development effort prediction: a software science validation. IEEE Transactions on Software Engineering 6:639-647.
5. Allen, F. et al. 2001. Blue Gene: a vision for protein science using a petaflop supercomputer. IBM Systems Journal 40(2):310-327.
6. Anderson, D. P., Cobb, J., Korpela, E., Lebofsky, M., and Werthimer, D. 2002. SETIηome: an experiment in public-resource computing. Communications of the ACM 45(11):56-61.
7. Bailey, D.H. et al. 1995. The NAS Parallel Benchmarks 2.0, Report NAS-95-010.
8. Blelloch, G. E. 1996. Programming parallel algorithms. Communications of the ACM 39(3):85-97.
9. Blelloch, G. E. and Greiner, J. 1996. A provable time and space efficient implementation of NESL. Proceedings of ACM SIGPLAN International Conference on Functional Programming, Philadelphia, PA, 213-225.
10. Blumofe, R. D., Frigo, M., Joerg, C. F., Leiserson, C. E. and Randall, K. H. 1996. An analysis of dag-consistent distributed shared-memory algorithms. Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Padua, Italy, 297-308.
11. Boehm, B., Clark, B., Horowitz, E., Westland, C., Madachy, R. and Selby, R. 1995. Cost models for future software life cycle processes: COCOMO 2.0. Annals of Software Engineering 1:57-94.
12. Brooks, F. P. 1975. The Mythical Man-Month: Essays on Software Engineering, Addison-Wesley, Reading, MA.
13. Culler, D. E., Karp, R. M., Patterson, D. A., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R. and von Eickson, T. 1993. LogP: towards a realistic model of parallel computation. Proceedings of Principles and Practice of Parallel Programming, San Diego, CA, 1-12.
14. Fishburn, P. C. 1970. Utility Theory for Decision Making, Lively, New York.
15. Hey, T. and Lancaster, D. 2000. The development of Parkbench and performance prediction. International Journal of High Performance Computing Applications 14(3):205-215.
16. Hristea, C., Lenoski, D., and Keen, J. 1997. Measuring memory hierarchy performance of cache-coherent multiprocessors using micro benchmarks. Proceedings of Conference on Supercomputing, San Jose, CA, 1-12.
17. JaJa, J. 1992. An Introduction to Parallel Algorithms, Addison-Wesley, New York.
18. Kerbyson, D. J., Alme, H. J., Hoisie, A., Petrini, F., Wasserman, H. J. and Gittings, M. 2001. Predictive performance and scalability modeling of a large-scale application. Proceedings of Supercomputing Conference (SCO1), Denver, CO.
19. McCabe, T. J. and Watson, A. H. 1994. Software complexity. Crosstalk, Journal of Defense Software Engineering 7(12):5-9.
20. McCalpin, J. D. 2004. STREAM: sustainable memory bandwidth in high performance computers, http://www.cs.virginia.edu/stream/.
21. Peterson, V. L., Kim, J., Holst, T. L., Deiwert, G. S., Cooper, D. M., Watson, A. B. and Bailey, F. R. 1989. Supercomputer requirements for selected disciplines important to aerospace. Proceedings of the IEEE 77(7):1038-1055.
22. Reif, J. H. 1993. Synthesis of Parallel Algorithms, Morgan Kaufmann, San Francisco, CA.
23. RTI. 2002. The Economic Impacts of Inadequate Infrastructure for Software Testing, Report 02-3.
24. Shirts, M. and Pande, V. S. 2000. Screen savers of the world unite! Science 1903-1904.
25. Snavely, A., Carrington, L., Wolter, N., Labarta, J., Badia, R. and Purkayastha, A. 2002. A framework for performance modeling and prediction. Proceedings of Supercomputing (SC02), Baltimore, MD.
26. Tahvildari, L. and Singh, A. 2000a. Categorization of objectoriented software metrics. Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, Halifax, Canada, 235-239.
27. Tahvildari, L. a0nd Singh, A. 2000b. Impact of using patternbased systems on the qualities of parallel application. Proceedings of the IEEE International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV, 1713-1719.
28. Verner, J. M., Tate, G., Jackson, B., and Hayward, R. G. 1989. Technology dependence in function point analysis: a case study and critical review. Proceedings of the 11th International Conference on Software Engineering, Pittsburgh, PA, 375-382.
29. von Neumann, J. and Morgenstern, O. 1947. Theory of Games and Economic Behavior, 1953 edition. Princeton University Press, Princeton, NJ.
30. Young, H. P. 1994. Cost allocation. Handbook of Game Theory with Economic Applications, R. J. Aumann and S. Hart, editors, Elsevier, Burlington, MA, 1193-2235.