Abstract
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understandable graphs that have sufficiently high qualityto be printed in scientific journals. The focus is on common sense rules that are frequently useful and can be easily implemented using tools such as gnuplot1
This work was partiallys upported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
www.gnuplot.org. The source codes of the examples in this paper can be found under http://www.mpi-sb.mpg.de/~sanders/gnuplot/
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Alefragis, P. Sanders, T. Takkula, and D. Wedelin. Parallel integer optimization for crew scheduling. Annals of Operations Research, 99(1):141–166, 2000.
Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing, 29(1):180–200, February 2000.
P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: the heavily loaded case. In 32th Annual ACM Symposium on Theory of Computing (STOC’00), pages 745–754, 2000.
J. M. Chambers, W. S. Cleveland, B. Kleiner, and P. A. Tukey. Graphical Methods for Data Analysis. Duxbury Press, Boston, 1983.
W. S._Cleveland. Elements of Graphing Data. Wadsworth, Monterey, Ca, 2nd edition, 1994.
D. S. Johnson. A theoretician’s guide to the experimental analysis of algorithms. In M. Goldwasser, D. S. Johnson, and C. C. McGeoch, editors, Proceedings of the 5th and 6th DIMACS Implementation Challenges. American Mathematical Society, 2002.
M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACMTMCS: ACM Transactions on Modeling and Computer Simulation, 8:3–30, 1998. http://www.math.keio.ac.jp/~matumoto/emt.html.
C. C. McGeoch, D. Precup, and P. R. Cohen. How to find big-oh in your data set (and how not to). In Advances in Intelligent Data Analysis. Springer Lecture Notes in Computer Science 1280, pages 41–52, 1997.
C. C. McGeoch and B. M. E. Moret. How to present a paper on experimental work with algorithms. SIGACT News, 30(4):85–90, 1999.
B. M. E. Moret. Towards a discipline of experimental algorithmics. In 5th DIMACS Challenge, DIMACS Monograph Series, 2000. To appear.
W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992.
P. Sanders. Lastverteilungsalgorithmen für parallele Tiefensuche. Number 463 in Fortschrittsberichte, Reihe 10. VDI Verlag, 1997.
P. Sanders. Asynchronous scheduling of redundant disk arrays. In 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA’00), pages 89–98, 2000.
P. Sanders and R. Fleischer. Asymptotic complexity from experiments? A case study for randomized algorithms. In Proceedings of the 4th Workshop on Algorithm Engineering (WAE’00). Springer Lecture Notes in Computer Science 1982, pages 135–146, 2000.
P. Sanders and J. Sibeyn. A bandwidth latency tradeoff for broadcast and reduction. In Proceedings of the 6th International Euro-Par Conference. Springer Lecture Notes in Computer Science 1900, pages 918–926, 2000.
P. Sanders. Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics, 5, 2000.
E. R. Tufte. The Visual Display of Quantitative Information. Graphics Press, Cheshire, Connecticut, U.S.A., 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sanders., P. (2002). Presenting Data from Experiments in Algorithmics. In: Fleischer, R., Moret, B., Schmidt, E.M. (eds) Experimental Algorithmics. Lecture Notes in Computer Science, vol 2547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36383-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-36383-1_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00346-5
Online ISBN: 978-3-540-36383-5
eBook Packages: Springer Book Archive