Algorithms and experiments: The new (and old) methodology

Journal of Universal Computer Science

Volumn 7, Issue 5, 2001, Pages 434-446

  Moret, Bernard M E ^a   Shapiro, Henry D ^a  

^a University of New Mexico   (United States)

Author keywords

Algorithm engineering; Cache aware algorithms; Efficiency; Experimental algorithmics; External memory algorithms; Implementation; Methodology

Indexed keywords

EID: 0000684112     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. [ACVW01] L. Arge, J. Chase, J. S. Vitter, and R. Wickremesinghe, Efficient sorting using registers and caches, Proc. 4th Workshop on Algorithm Eng. WAE 2000, Springer Verlag, 2001, to appear in LNCS.
2. [AMO93] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows, Prentice Hall, Englewood Cliffs, NJ, 1993.
3. [Ben82] J. E. Bentley, Writing efficient programs, Prentice-Hall, Englewood Cliffs, NJ, 1982.
4. [Ben83] _, Programming pearls: cracking the oyster, Commun. ACM 26 (1983), no. 8, 549-552.
5. [Ben90] _, Experiments on geometric traveling salesman heuristics, Report CS TR 151, AT&T Bell Laboratories, 1990.
6. [Ben99] _, Programming pearls, ACM Press, New York, 1999.
7. +00] R. E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling, MIP: Theory and practice-closing the gap, System Modelling and Optimization: Methods, Theory and Applications (M. J. D. Poweel and S. Scholtes, eds.), Kluwer Acad. Pub., 2000, pp. 19-49.
8. [BH80] E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Math. Progr. 12 (1980), 37-60.
9. [BMQ98] J. R. Black, C. U. Martel, and H. Qi, Graph and hashing algorithms for modern architectures: design and performance, Proc. 2nd Workshop on Algorithm Eng. WAE 98, Max-Planck Inst, für Informatik, 1998, in TR MPI-1-98-1-019, pp. 37-48.
10. [CaDRKES97] C. S. Chekuri, A. V. Goldberg adn D. R. Karger, M. S. Levine, and C. Stein, Experimental study of minimum cut algorithms, Proc. 8th ACM/SIAM Symp. on Discrete Algs. SODA 97, SIAM Press, 1997, pp. 324-333.
11. [CG97] B. V. Cherkassky and A. V. Goldberg, On implementing the push-relabel method for the maximum flow problem, Algorithmica 19 (1997), 390-410.
12. +98] B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi, Augment or push: a computational study of bipartite matching and unitcapacity flow algorithms, ACM J. Exp. Algorithmics 3 (1998), no. 8, www.jea.acm.org/1998/CherkasskyAugment/.
13. [CGR96] B. V. Cherkassky, A. V. Goldberg, and T. Radzik, Shortest paths algorithms: theory and experimental evaluation, Math. Progr. 73 (1996), 129-174.
14. [DS85] S. P. Dandamudi and P. G. Sorenson, An empirical performance comparison of some variations of the k-d tree and bd tree, Int'l J. Computer and Inf. Sciences 14 (1985), no. 3, 134-158.
15. [ERS90] N. Eiron, M. Rodeh, and I. Stewarts, Matrix multiplication: a case study of enhanced data cache utilization, ACM J. Exp. Algorithmics 4 (1990), no. 3, www.jea.acm.org/1999/EironMatrix/.
16. [Fel99] M. Fellows, 1999, private communication.
17. [FM97] U. Finkler and K. Mehlhorn, Runtime prediction of real programs on real machines, Proc. 8th ACM/SIAM Symp. on Discrete Algs. SODA 97, SIAM Press, 1997, pp. 380-389.
18. [GT01] A. V. Goldberg and K. Tsioutsiouliklis, Cut tree algorithms: an experimental study, J. Algs. 38 (2001), no. 1, 51-83.
19. [JAMS89] D. S. Johnson, C. R. Aragon, E. A. McGeoch, and C. Schevon, Optimization by simulated annealing: an experimental evaluation. I. graph partitioning, Operations Research 37 (1989), 865-892.
20. [JAMS91] _, Optimization by simulated annealing: an experimental evaluation. 2. graph coloring and number partitioning, Operations Research 39 (1991), 378-406.
21. [JM93] D. S. Johnson and C. C. McGeoch (eds.), Network flows and matching: First DIMACS implementation challenge, vol. 12, Amer. Math. Soc., 1993.
22. [Joh01] D. S. Johnson, A theoretician's guide to the experimental analysis of algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Amer. Math. Soc., 2001, to appear.
23. [Jon86] D. W. Jones, An empirical comparison of priority queues and event-set implementations, Commun. ACM 29 (1986), 300-311.
24. [JT96] D. S. Johnson and M. Trick, Cliques, coloring, and satisfiability: Second DIMACS implementation challenge, vol. 26, Amer. Math. Soc., 1996.
25. [Knu93] D. E. Knuth, The Stanford GraphBase: A platform for combinatorial computing, Addison-Wesley, Reading, Mass., 1993.
26. [Knu98] _, The art of computer programming, vols I (3rd ed.), II (3rd ed.), and III (2nd ed.), Addison-Wesley, Reading, Mass., 1997, 1997, and 1998.
27. [LL96] A. LaMarca and R. Ladner, The influence of caches on the performance of heaps, ACM J. Exp. Algorithmics 1 (1996), www.jea.acm.org/1996/LaMarcaInfluence/.
28. [LL97] _, The influence of caches on the performance of sorting, Proc. 8th ACM/SIAM Symp. on Discrete Algs. SODA 97, SIAM Press, 1997, pp. 370-379.
29. [McG92] C. C. McGeoch, Analysis of algorithms by simulation: variance reduction techniques and simulation speedups, ACM Comput. Surveys 24 (1992), 195-212.
30. [MN95] K. Mehlhorn and S. Näher, LEDA, a platform for combinatorial and geometric computing, Commun. ACM 38 (1995), 96-102.
31. [MN99] K. Melhorn and S. Näher, The LEDA platform of combinatorial and geometric computing, Cambridge U. Press, Cambridge, UK, 1999.
32. [MS85] B. M. E. Moret and H. D. Shapiro, On minimizing a set of tests, SIAM J. Scientific & Statistical Comput. 6 (1985), 983-1003.
33. [MS91a] _, Algorithms from P to NP, volume I: Design and efficiency, BenjaminCummings Publishing Co., Menlo Park, CA, 1991.
34. [MS91b] C. Morgenstern and H. D. Shapiro, Heuristics for rapidly four-coloring large planar graphs, Algorithmica 6 (1991), 869-891.
35. [MS94] B. M. E. Moret and H. D. Shapiro, An empirical assessment of algorithms for constructing a minimal spanning tree, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (N. Dean and G. Shannon, eds.), vol. 15, Amer. Math. Soc., 1994, pp. 99-117.
36. +01] B. M. E. Moret, S. K. Wyman, D. A. Bader, T. Warnow, and M. Yan, A new implementation and detailed study of breakpoint analysis, Proc. 6th Pacific Symp. Biocomputing PSB 2001, World Scientific Pub., 2001, pp. 583-594.
37. [Rei94] G. Reinelt, The traveling salesman: Computational solutions for tsp applications, Springer Verlag, Berlin, 1994, in LNCS 840.
38. [RR99] N. Rahman and R. Raman, Analysing cache effects in distribution sorting, Proc. 3rd Workshop on Algorithm Eng. WAE 99 (Berlin), Springer Verlag, 1999, in LNCS 1668, pp. 183-197.
39. [RS85] N. Robertson and P. Seymour, Graph minors - a surveys, Surveys in Combinatorics (J. Anderson, ed.), Cambridge U. Press, Cambridge, UK, 1985, pp. 153-171.
40. [San00] P. Sanders, Fast priority queues for cached memory, ACM J. Exp. Algorithmics 5 (2000), no. 7, www.jea.acm.org/2000/SandersPriority/.
41. [SV87] J. T. Stasko and J. S. Vitter, Pairing heaps: experiments and analysis, Commun. ACM 30 (1987), 234-249.
42. [Vit01] J. S. Vitter, External memory algorithms and data structures: dealing with massive data, ACM Comput. Surveys (2001), to appear, available at www.cs.duke.edu/jsv/Papers/Vit.IO_survey.ps.gz.
43. [XZK00] E. Xiao, X. Zhang, and S. Kubricht, Improving memory performance of sorting algorithms, ACM J. Exp. Algorithmics 5 (2000), no. 3, www.jea.acm.org/2000/XiaoMemory/.