A Guide to Experimental Algorithmics

Author: Catherine C. McGeoch

This guidebook is for those who want to use computational experiments to support their work in algorithm design and analysis.

This is a guidebook for those who want to use computational experiments to support their work in algorithm design and analysis. Numerous case studies and examples show how to apply these concepts. All the necessary concepts in computer architecture and data analysis are covered.

Product Unavailable

PRODUCT INFORMATION

Summary

This guidebook is for those who want to use computational experiments to support their work in algorithm design and analysis.

Description

Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure? What inputs should I test? How do I analyze the data? To answer these questions the book draws on ideas from algorithm design and analysis, computer systems, and statistics and data analysis. The wide-ranging discussion includes a tutorial on system clocks and CPU timers, a survey of strategies for tuning algorithms and data structures, a cookbook of methods for generating random combinatorial inputs, and a demonstration of variance reduction techniques. The book can be used by anyone who has taken a course or two in data structures and algorithms. A companion website, AlgLab contains downloadable files, programs and tools for use in experimental projects.

Critic Reviews

“'This book provides guidelines and suggestions for performing experimental algorithmic analysis. It contains many examples and includes links to a companion website with code for some specific experiments … The book is a good read with generally good examples, and is short enough to be easily digested.' Jeffrey Putnam, Computing Reviews”

'Catherine McGeoch is one of the founders of the field of experimental algorithmics, helping to initiate the discipline with her 1986 dissertation, 'Experimental Analysis of Algorithms'. She has been deeply involved with the development of the methodology of experimental algorithmics over the past 25 years … This book contains a breadth of advice, examples, and anecdotes, benefiting from her wealth of experience and many collaborations with other innovators in the discipline … Her advice is practical, authoritative, thoughtful, and applicable to the entire range of algorithm design, development, testing, and improvement … McGeoch's book presents a delightful dance of theoretical and experimental endeavors that in concert provide deep understanding of the algorithms that enable our information age as well as the means to the continual improvement of those fundamental algorithms.' Richard Snodgrass, University of Arizona

About the Author

Dr Catherine C. McGeoch is the Beitzel Professor of Technology and Society in the Department of Computer Science at Amherst College. Professor McGeoch was co-founder (with David S. Johnson) in 1990 of the Discrete Mathematics and Theoretical Computer Science (DIMACS) Implementation Challenges. In 1999 she co-founded (with Michael Goodrich) the annual Workshop on Algorithm Engineering and Experimentation (ALENEX), sponsored by SIAM. She was Editor-in-Chief of the ACM Journal of Experimental Algorithmics from 2003 to 2008 and currently serves on the ACM Publications Board.