A Java API for Experimental analysis of algorithms

Traditionally, the emphasis among computer scientists has been on the more rigorous and theoretical modes of worstcase and average-case analysis of algorithms. However, theoretical analysis cannot tell the full story about realworld performance of algorithms. This has resulted in a growing interest in experimental analysis. This paper presents the development of a solution that aides in the experimental analysis of Java-based implementations.

[1]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

[2]  A. Duffy,et al.  Algorithm Analysis a Technical Report , 2004 .

[3]  Lorna Smith,et al.  Benchmarking Java Grande Applications , 2000 .

[4]  Claire Whelan,et al.  A Java API for polynomial arithmetic , 2003, PPPJ.

[5]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[6]  Martin D. Westhead,et al.  A benchmark suite for high performance Java , 2000, Concurr. Pract. Exp..

[7]  C. Pomerance,et al.  Prime Numbers: A Computational Perspective , 2002 .