Description
Book SynopsisAlgorithm engineering allows computer engineers to produce a computational machine that will execute an algorithm as efficiently and cost-effectively as possible given a set of constraints, such as minimal performance or the availability of technology. Addressing algorithm engineering in a parallel setting, regular array syntheses offer powerful computation and embody best practice, but often face the criticism that they are applicable only to restricted classes of algorithms.
Algorithm Engineering for Integral and Dynamic Problems reviews the basic principles of regular array synthesis and shows how to extend its use into classes of algorithms traditionally viewed to be beyond its domain of application. The author discusses the transformation of the initial algorithm specification into a specification with data dependencies of increased regularity in order to obtain corresponding regular arrays by direct application of the standard mapping techniques. The book includes a review of the basic principles of regular array synthesis followed by applications of these techniques to well-known algorithms, concluding with numerous case studies to illustrate the methods.
Researchers and practitioners in algorithm engineering will find that this text significantly extends their understanding of the applications of regular array synthesis and regular array processors beyond the traditionally narrow field of relevance.
Table of ContentsList of Figures. List of Tables. Preface. Acknowledgements. Introduction. Regular Array Synthesis. Integral Recurrence Equations. Dynamic Recurrence Equations. Case Studies. Conclusions. Appendix A: Notation. Appendix B: Graph Theory. Appendix C: Convex Sets and Polyhedra. Appendix D: Aspects of Linear Algebra. Bibliography. Index.
