Dynamic Reconfiguration Architectures and Algorithms
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 alg
- PDF / 20,819,453 Bytes
- 525 Pages / 325.984 x 489.173 pts Page_size
- 35 Downloads / 227 Views
SERIES IN COMPUTER SCIENCE Series Editor: Rami G. Melhem University of Pittsburgh Pittsburgh, Pennsylvania
DYNAMIC RECONFIGURATION Architectures and Algorithms Ramachandran Vaidyanathan and Jerry L. Trahan ENGINEERING ELECTRONIC NEGOTIATIONS A Guide to Electronic Negotiation Technologies for the Design and Implementation of Next-Generation Electronic Markets—Future Silkroads of eCommerce Michael Ströbel HIERARCHICAL SCHEDULING IN PARALLEL AND CLUSTER SYSTEMS Sivarama Dandamudi MOBILE IP Present State and Future Abdul Sakib Mondal OBJECT-ORIENTED DISCRETE-EVENT SIMULATION WITH JAVA A Practical Introduction José M. Garrido A PARALLEL ALGORITHM SYNTHESIS PROCEDURE FOR HIGHPERFORMANCE COMPUTER ARCHITECTURES Ian N. Dunn and Gerard G. L. Meyer PERFORMANCE MODELING OF OPERATING SYSTEMS USING OBJECT-ORIENTED SIMULATION A Practical Introduction José M. Garrido POWER AWARE COMPUTING Edited by Robert Graybill and Rami Melhem THE STRUCTURAL THEORY OF PROBABILITY New Ideas from Computer Science on the Ancient Problem of Probability Interpretation Paolo Rocchi
Dynamic Reconfiguration Architectures and Algorithms Ramachandran Vaidyanathan and
Jerry L. Trahan Louisiana State University Baton Rouge, Louisiana
KLUWER ACADEMIC PUBLISHERS NEW YORK, BOSTON, DORDRECHT, LONDON, MOSCOW
eBook ISBN: Print ISBN:
0-306-48428-5 0-306-48189-8
©2004 Kluwer Academic Publishers New York, Boston, Dordrecht, London, Moscow Print ©2003 Kluwer Academic/Plenum Publishers New York All rights reserved No part of this eBook may be reproduced or transmitted in any form or by any means, electronic, mechanical, recording, or otherwise, without written consent from the Publisher Created in the United States of America Visit Kluwer Online at: and Kluwer's eBookstore at:
http://kluweronline.com http://ebooks.kluweronline.com
To
Sudha, Shruti, and Deepti
and Suzanne, Dana, and Drew
Contents
List of Figures Preface
xiii xix
Part I Basics 1. PRINCIPLES AND ISSUES 1.1 Illustrative Examples 1.2 The R-Mesh at a Glance 1.3 Important Issues Problems Bibliographic Notes
3 4 9 11 13 14
2. THE RECONFIGURABLE MESH: A PRIMER 2.1 The Reconfigurable Mesh 2.1.1 The (Two-Dimensional) R-Mesh 2.2 Expressing R-Mesh Algorithms 2.3 Fundamental Algorithmic Techniques 2.3.1 Data Movement 2.3.2 Efficiency Acceleration—Adding Bits 2.3.3 Neighbor Localization—Chain Sorting 2.3.4 Sub-R-Mesh Generation—Maximum Finding 2.3.5 Distance Embedding—List Ranking 2.3.6 Connectivity Embedding— Connectivity 2.3.7 Function Decomposition—Adding N Numbers 2.4 Why an R-Mesh? Problems Bibliographic Notes
17 17 18 22 23 24 27 33 40 43 46 49 58 58 68
viii
DYNAMIC RECONFIGURATION
3. MODELS OF RECONFIGURATION 3.1 The Reconfigurable Mesh—A Second Coat 3.1.1 Restricted Bus Structure 3.1.2 Word Size 3.1.3 Accessing Buses 3.1.4 Higher Dimensions 3.1.5 One-Way Streets 3.2 More Ways to Reconfigure 3.2.1 Reconfigurable Network 3.2.2 Reconfigurable Multiple Bus Machine 3.2.3 Optical Models 3.2.4 Reconfiguration in FPGAs 3.3 How Powerful Is Reconfiguration? Problems Bibliographic Notes
71
Data Loading...
