A guide to experimental algorithmics

Bibliographic Information

A guide to experimental algorithmics

Catherine C. McGeoch

Cambridge University Press, 2012

  • : hardback
  • : pbk

Available at  / 10 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

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 (www.cs.amherst.edu/alglab) contains downloadable files, programs and tools for use in experimental projects.

Table of Contents

  • 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.

by "Nielsen BookData"

Details

  • NCID
    BB09075065
  • ISBN
    • 9781107001732
    • 9780521173018
  • LCCN
    2011047928
  • Country Code
    us
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    New York
  • Pages/Volumes
    x, 261 p.
  • Size
    24 cm
  • Classification
  • Subject Headings
Page Top