Abstract
Chapter 1 introduced the idea of reconfiguration in terms of a simple segmentable-bus model and an informal description of the R-Mesh model. In this chapter we will build on these ideas and reconstruct the R-Mesh, this time more formally (Section 2.1). Although simple, the R-Mesh is general enough to capture most ideas in dynamic reconfiguration and will be the primary medium of expression for most of this book. In Section 2.2, we describe the pseudocode convention that we employ in this book. Following this, Section 2.3 will introduce several R-Mesh algorithmic techniques through examples spanning a wide range of applications. In the process we will also develop a palette of fundamental methods that other algorithms will invoke.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2004). The Reconfigurable Mesh: A Primer. In: Vaidyanathan, R., Trahan, J.L. (eds) Dynamic Reconfiguration. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-0-306-48428-5_2
Download citation
DOI: https://doi.org/10.1007/978-0-306-48428-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-48189-5
Online ISBN: 978-0-306-48428-5
eBook Packages: Springer Book Archive