عنوان

A guide to experimental algorithmics /

(Number (ISBN

0521173019 (pbk.)

(Number (ISBN

1107001730 (hardback)

(Number (ISBN

9780521173018 (pbk.)

(Number (ISBN

9781107001732 (hardback)

Number

dltt

Title Proper

A guide to experimental algorithmics /

General Material Designation

[Book]

First Statement of Responsibility

Catherine C. McGeoch

Place of Publication, Distribution, etc.

New York :

Name of Publisher, Distributor, etc.

Cambridge University Press,

Date of Publication, Distribution, etc.

2012

Specific Material Designation and Extent of Item

x, 261 p. :

Other Physical Details

ill. ;

Dimensions

25 cm

Text of Note

Includes bibliographical references and index

Text of Note

Machine generated contents note: 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

8

Text of Note

"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? Answering these questions needs ideas from algorithm design and analysis, operating systems and memory hierarchies, 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. Numerous case studies and examples show how to apply these concepts. All the necessary concepts in computer architecture and data analysis are covered so that 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/ccm/alglab) contains downloadable files, programs, and tools for use in projects"--

Text of Note

"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? Answering these questions needs ideas from algorithm design and analysis, operating systems and memory hierarchies, 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. Numerous case studies and examples show how to apply these concepts. All the necessary concepts in computer architecture and data analysis are covered so that 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/ccm/alglab) contains downloadable files, programs, and tools for use in projects"--

Computer algorithms

Number

Edition

Class number

Book number

McGeoch, Catherine C.,1959-

Date of Transaction

20120324125759.0

Electronic name

[Book]

Y