Automatic Algorithm Selection for Complex Simulation Problems

✍ Scribed by Roland Ewald (auth.)

• Publisher: Vieweg+Teubner Verlag
• Year: 2012
• Tongue: English
• Leaves: 387
• Edition: 1
• Category: Library

✦ Synopsis

To select the most suitable simulation algorithm for a given task is often difficult. This is due to intricate interactions between model features, implementation details, and runtime environment, which may strongly affect the overall performance. An automated selection of simulation algorithms supports users in setting up simulation experiments without demanding expert knowledge on simulation.

Roland Ewald analyzes and discusses existing approaches to solve the algorithm selection problem in the context of simulation. He introduces a framework for automatic simulation algorithm selection and describes its integration into the open-source modelling and simulation framework James II. Its selection mechanisms are able to cope with three situations: no prior knowledge is available, the impact of problem features on simulator performance is unknown, and a relationship between problem features and algorithm performance can be established empirically. The author concludes with an experimental evaluation of the developed methods.

✦ Table of Contents

Front Matter....Pages i-xxi
Introduction....Pages 1-15
Front Matter....Pages 17-17
Algorithm Selection....Pages 19-91
Simulation Algorithm Performance Analysis....Pages 93-115
Front Matter....Pages 117-117
A Framework for Simulation Algorithm Selection....Pages 119-151
Storage of Performance Data....Pages 153-175
Selection Mapping Generation....Pages 177-201
Experimentation Methodology....Pages 203-246
Automatic Simulation Algorithm Selection in JAMES II....Pages 247-269
Front Matter....Pages 271-271
Case Study I: Chemical Reaction Networks....Pages 273-301
Case Study II: Parallel Discrete-Event Simulation....Pages 303-320
Conclusions....Pages 321-333
Back Matter....Pages 335-382

✦ Subjects

Computer Science, general