Dynamic Reconfiguration, 2003 Architectures and Algorithms Series in Computer Science Series

Dynamic Reconfiguration: Architectures and Algorithms offers a comprehensive treatment of dynamically reconfigurable computer architectures and algorithms for them. The coverage is broad starting from fundamental algorithmic techniques, ranging across algorithms for a wide array of problems and applications, to simulations between models. The presentation employs a single reconfigurable model (the reconfigurable mesh) for most algorithms, to enable the reader to distill key ideas without the cumbersome details of a myriad of models. In addition to algorithms, the book discusses topics that provide a better understanding of dynamic reconfiguration such as scalability and computational power, and more recent advances such as optical models, run-time reconfiguration (on FPGA and related platforms), and implementing dynamic reconfiguration. The book, featuring many examples and a large set of exercises, is an excellent textbook or reference for a graduate course. It is also a useful reference to researchers and system developers in the area.

List of Figures. Preface. I: Basics. 1. Principles and issues. 2. The reconfigurable mesh: a primer. 3. Models of configuration. II: Algorithms. 4. Arithmetic on the R-mesh. 5. Sorting and selection. 6. Graph algorithms. 7. Computational geometry and image processing. III: Simulations and Complexity. 8. Model and algorithmic scalability. 9. Computational complexity of reconfiguration. IV: Other Reconfigurable Architectures. 10. Optical reconfigurable models. 11. Run-time reconfiguration. References. Index.