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. This is a guidebook for those who want to use computationalexperiments 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. Computationalexperiments on algorithms can supplement theoretical analysis by showing whatalgorithms, implementations and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of themajor 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 (www.cs.amherst.edu/alglab) contains downloadable files, programsand tools for use in experimental projects. Advance praise: 'Catherine McGeoch is one of the founders of the field of experimental algorithmics, helping toinitiate the discipline with her 1986 dissertation, 'Experimental Analysis ofAlgorithms'. She has been deeply involved with the development of the methodology of experimental algorithmics over the past 25 years â€a 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 â€aHer advice is practical, authoritative, thoughtful, and applicable to the entire range of algorithm design, development, testing, and improvement â€a McGeoch's book presents a delightful dance of theoretical and experimental endeavors that in concert provide deep understanding of the algorithms that enable ourinformation age as well as the means to the continual improvement of those fundamental algorithms.' Richard Snodgrass, University of Arizona INDICE: 1. Introduction; 2. A plan of attack; 3. What to measure; 4. Tuning algorithms, tuning code; 5. The toolbox; 6. Creating analysis-friendly data;7. Data analysis.
- ISBN: 978-0-521-17301-8
- Editorial: Cambridge University
- Encuadernacion: Rústica
- Páginas: 272
- Fecha Publicación: 30/01/2012
- Nº Volúmenes: 1
- Idioma: Inglés