[...]... Proximity indexing Euler tour of a tree Preorder-inorder traversal Merging preorder and inorder traversals Finding distances in a directed graph List ranking with a balanced subset Embedding a list in an N × N R-Mesh An Euler path as a list of vertex copies Convex hull of a set of planar points Example of supporting line for two convex hulls Partitioning a set of points using four extreme points Angles... Marking active processors of a quadtree Contraction, windows, and folds mappings Lower bound using contraction mapping Multiple disjoint segments of one bus in a window Entering segment with an awakening partner Dual bus structure of mimicking that of Linear connected components (LCC) example Slices and windows of simulated FR-Mesh Illustration of horizontal prefix assimilation Linear configurations and. .. not employ the attribute dynamic in their names We will use the terms “reconfigurable” and “dynamically reconfigurable” interchangeably in this book In Chapter 11, we will dis­ cuss a form of reconfiguration called run-time reconfiguration (RTR) in which structural and functional changes in the computing device incur a significant penalty in time One benefit of dynamic reconfiguration is the potential... processors simulating an APPBS processor APPBS processors simulating an LR-Mesh processor Generic structure of an FPGA A logic cell in the Xilinx Virtex family of FPGAs Hybrid System Architecture Model (HySAM) KCM multiplying 8-bit inputs using 4-bit LUTs LUT entries in a KCM for Example of reconfiguring while executing Morphing Pipeline A into Pipeline B Basic flow of data in an FIR filter Using KCMs for... 10 and 11) touches on capturing, in the models themselves, the effect of practical constraints, providing a bridge between theory and practice Each chapter is rea­ PREFACE xxi sonably self-contained and includes a set of exercises and bibliographic notes The presentation in this book is suitable for a graduate level course and only presupposes basic ideas in parallel computing Such a course could include... addition on an R-Mesh Examples of and Neighbor localization example Chain sorting Concatenating lists in chain sorting Maximum finding example List ranking strategy Illustration of the connectivity algorithm Adding a distributed unary integer to 1-bit numbers Dividing a distributed unary integer by 2 Illustration of terms for adding integers Module for carry generation 5 6 6 9 10 10 17 19 20 20 25 27... explored reconfiguration in the setting of Field Programmable Gate Arrays (FPGAs) Originally designed for rapid prototyping, FPGAs did not emphasize rapid reconfiguration Subse­ quently, ideas such as partial reconfiguration, context switching, and self -reconfiguration made their way into an FPGA-type setting, giving rise to the notion of run-time reconfiguration or RTR (as opposed to reconfiguring between... that a bus starting at the top left corner of the R-Mesh terminates in row 1’s That of the rightmost column if and only if the input contains 10 DYNAMIC RECONFIGURATION is, one could use this bus configuration to count the number of 1’s in the input Notice in Figure 1.6 that all processors in a column with a 0 input bit hold the same configuration In this configuration, a signal entering the column... matrix mul­ tiplication Chapter 5: Sorting and Selection This chapter deals with problems on totally ordered sets and includes techniques for selection, area-optimal sorting, and speed-efficiency trade-offs Chapter 6: Graph Algorithms Methods for embedding graphs in reconfigurable models are described xxii DYNAMIC RECONFIGURATION in the context of list ranking and graph connectivity Along with other... among points and the Points in labeled with Illustration of contact points and upper hull tangent Proximity order for an 8 × 8 array Upper, lower, and crossing common tangents Supporting lines for polygons and samples Example Voronoi diagram Connected components of an image Gray values in sub-R-Meshes before a merge Quadtree representation An example to illustrate quadtree construction Determining block . 7.3 Partitioning a set of points using four extreme points. 235 7.4 Angles among points and the 236 7.5 Points in labeled with 237 7.6 Illustration of contact points and upper hull. KCM multiplying 8-bit inputs using 4-bit LUTs. 425 11.5 LUT entries in a KCM for 426 11.6 Example of reconfiguring while executing. 427 11.7 Morphing Pipeline A into Pipeline B. 427. Neighbor localization example. 34 2.11 Chain sorting. 36 2.12 Concatenating lists in chain sorting. 39 2.13 Maximum finding example. 42 2.14 List ranking strategy. 45 2.15 Illustration