Measuring empirical computational complexity

6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE 2007

Volumn , Issue , 2007, Pages 395-404

  Goldsmith, Simon F ^a   Aiken, Alex S ^b   Wilkerson, Daniel S ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Stanford University   (United States)

^c NONE

Author keywords

Empirical computational complexity; Trend prof

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTATIONAL COMPLEXITY; MEASUREMENT THEORY; CODES (SYMBOLS); PROBABILITY DENSITY FUNCTION; PROGRAM DEBUGGING; SOFTWARE ENGINEERING;

EMPIRICAL COMPUTATIONAL COMPLEXITY; THEORETICAL ASYMPTOTIC BOUNDS; ASYMPTOTIC BEHAVIORS; ASYMPTOTIC BOUNDS; BASIC BLOCKS; COMPLEXITY BOUNDS; CONSTRUCTING MODELS; CRITICAL CODES; LARGE PROGRAMS; ORDERS OF MAGNITUDES; TREND-PROF;

COMPUTER PROGRAMMING LANGUAGES; COMPUTATIONAL COMPLEXITY;

EID: 37849052544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287624.1287681     Document Type: Conference Paper

References (19)

1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model -One step closer towards a realistic model for parallel computation. In SPAA '95: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 95-105, New York, NY, USA, 1995. ACM Press.
2. G. Ammons, J.-D. Choi, M. Gupta, and N. Swamy. Finding and removing performance bottlenecks in large systems. In ECOOP 2004. Springer Berlin / Heidelberg.
3. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. Ph.d. thesis, DIKU, Unversity of Copenhagen, 1994.
4. T. Ball and J. R. Larus. Optimally profiling and tracing programs. ACM Trans. Program. Lang. Syst., 16(4):1319-1360, 1994.
5. E. A. Brewer. High-level optimization via automated statistical modeling. In PPOPP '95: Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 80-91, New York, NY, USA, 1995. ACM Press.
6. bzip2 project homepage, http://www.bzip.org/.
7. gcov documentation. http://gcc.gnu.org/onlinedocs/gcc/Gcov.html.
8. S. L. Graham, P. B. Kessler, and M. K. Mckusick. Gprof: A call graph execution profiler. In SIGPLAN '82: Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction, pages 120-126, New York, NY, USA, 1982. ACM Press.
9. M. Kluge, A. Knüpfer, and W. E. Nagel. Knowledge based automatic scalability analysis and extrapolation for MPI programs. In Euro-Par 2005 Parallel Processing: 11th International Euro-Par Conference, Lecture Notes in Computer Science. Springer-Verlag.
10. J. Kodumal and A. Aiken. Banshee: A scalable constraint-based analysis toolkit. In SAS '05: Proceedings of the 12th International Static Analysis Symposium. London, United Kingdom, September 2005.
11. S. McPeak and G. C. Necula. Elkhound: A fast, practical GLR parser generator. In Conference on Compiler Construction (CC04), 2004.
12. D. L. Métayer. ACE: An automatic complexity evaluator. ACM Trans. Program. Lang. Syst., 10(2):248-266, 1988.
13. J. A. Rice. Mathematical Statistics and Data Analysis. Duxbury Press, 2006.
14. M. Rosendahl. Automatic complexity analysis. Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture, pages 144-156, 1989.
15. R. Rugina and K. Schauser. Predicting the running times of parallel programs by simulation. In Proceedings of the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, 1998.
16. V. Sarkar. Determining average program execution times and their variance. In PLDI '89: Proceedings of the ACM SIGPLAN 1989 Conference on Programming Language Design and Implementation, pages 298-312, New York, NY, USA, 1989. ACM Press.
17. G. Sevitsky, W de Pauw, and R. Konuru. An information exploration tool for performance analysis of Java programs. In TOOLS '01: Proceedings of the Technology of Object-Oriented Languages and Systems, page 85, Washington, DC, USA, 2001. IEEE Computer Society.
18. E. Ukkonen. A linear-time algorithm for finding approximate shortest common superstrings. In Algorithmica, volume 5, pages 313-323, 1990.
19. B. Wegbreit. Mechanical program analysis. Commun. ACM, 18(9):528-539, 1975.