Results 1  10
of
14
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
 IEEE Transactions on Parallel and Distributed Systems
, 1997
"... The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time so ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time solutions to the following computational geometry problems on the reconfigurable mesh: allpairs nearest neighbors, convex hull, triangulation, twodimensional maxima, twoset dominance counting, and smallest enclosing box. All these solutions accept N planar points as input and employ an N  N reconfigurable mesh. The basic scheme employed in our implementations is to recursively find an O(1) time solution. The number of recursion levels and the size of the subproblems at each level of recursion are optimized such that the problem decomposition and the solution to the problem can be obtained in constant time. As a result, we have developed some efficient merge techniques to combine th...
Permutation routing and sorting on the reconfigurable mesh
 International Journal of Foundations of Computer Science
, 1992
"... Abstract In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorithms for both packet routing and sorting on a reconfigurable mesh connected computer. The run times of these algorithms are better than the best achievable time bounds on a conventional mesh. ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorithms for both packet routing and sorting on a reconfigurable mesh connected computer. The run times of these algorithms are better than the best achievable time bounds on a conventional mesh. Many variations of the reconfigurable mesh can be found in the literature. We define yet another variation which we call as Mr. Wealsomakeuseofthestandard PARBUS model. We showthat permutation routing problem can be solved on a linear array Mr of size n in 3n steps, whereas n − 1 is the best possible run time without recon4 figuration. A trivial lower bound for routing on Mr will be n 2.OnthePARBUS linear array, n is a lower bound and hence any standard nstep routing algorithm will be optimal. We also showthat permutation routing on an n × n reconfigurable mesh Mr can be done in time n + o(n) using a randomized algorithm or in time 1.25n + o(n) deterministically. In contrast, 2n − 2 is the diameter of a conventional mesh and hence routing and sorting will need at least 2n−2 steps on a conventional mesh. A lower bound of n 2 is in effect for routing on the 2D mesh Mr as well. On the other 1 hand, n is a lower bound for routing on the PARBUS and our algorithms have the same time bounds on the PARBUS as well. Thus our randomized routing algorithm is optimal upto a lower order term. In addition we show that the problem of sorting can be solved in randomized time n + o(n) onMr as well as on PARBUS. Clearly, this sorting algorithm will be optimal on the PARBUS model. The time bounds of our randomized algorithms hold with high probability.
Reconfigurable Meshes: Theory and Practice
 In Reconfigurable Architectures Workshop, RAW'97
, 1997
"... Configurable computing has recently gained much attention with the promise of delivering an order of magnitude performance improvement over general purpose processors. In this paper we contrast the abstract models of reconfigurable architectures and actual hardware available for configurable computi ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Configurable computing has recently gained much attention with the promise of delivering an order of magnitude performance improvement over general purpose processors. In this paper we contrast the abstract models of reconfigurable architectures and actual hardware available for configurable computing systems. There is a wealth of ideas related to abstract models of reconfigurable architectures and fast parallel algorithms which exploit the reconfiguration potential in nontrivial ways. We summarize these abstract models and illustrate the power of these models using several example algorithms. We identify the practical problems in implementing these models in VLSI and describe some prototype implementations. Commercial FPGA devices which are being touted as the solution for building configurable computing systems are also examined. The MAARC 2 project at USC endeavors to bridge this gap between the abstract and the real worlds. 1 This work was supported by DARPA under contract DABT...
Efficient Self Simulation Algorithms for Reconfigurable Arrays
, 1995
"... There are several reconfiguringnetwork models of parallel computation that are considered in the published literature, depending on their switching capabilities. Can these reconfigurable models be the basis for the design of massively parallel computers? Perhaps the most fundamental related issue i ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
There are several reconfiguringnetwork models of parallel computation that are considered in the published literature, depending on their switching capabilities. Can these reconfigurable models be the basis for the design of massively parallel computers? Perhaps the most fundamental related issue is virtual parallelism, or the self simulation problem: given an algorithm which is designed for a large reconfigurable mesh, can it be executed efficiently on a smaller reconfigurable mesh? In this work we give several positive answers to the self simulation problem. We show that the simulation of a reconfiguring mesh by a smaller one can be carried optimally and using standard methods on the model in which buses are established along rows or along columns. A novel technique is shown to achieve asymptotically optimal self simulation on models which allow buses to switch column and row edges, provided that a bus is a "linear" path of connected edges. Finally, for models in which a bus is any ...
A ManyCore Implementation Based on the Reconfigurable Mesh Model
 in Proc. Int. Conf. on Field Programmable Logic and Applications, FPL
"... The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus configuration, communication, and constanttime computation on all processing elements in a lockstep. In this paper, w ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus configuration, communication, and constanttime computation on all processing elements in a lockstep. In this paper, we investigate the use of reconfigurable meshes as coprocessors to accelerate important algorithmic kernels. We discuss the development of a reconfigurable mesh on FPGA technology, including the host integration and the programming tool flow. Then, we present implementation results and a proofofconcept case study. 1.
Algorithms for Optimal SelfSimulation of Some Restricted Reconfigurable Meshes
, 1997
"... There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them the Reconfigurable Mesh (RM) draws much attention because of its simplicity. However the wide acceptance of RM depends on its scalability through selfsimulation. This pa ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them the Reconfigurable Mesh (RM) draws much attention because of its simplicity. However the wide acceptance of RM depends on its scalability through selfsimulation. This paper presents a simple selfsimulation algorithm which can selfsimulate the monotonic RM model optimally and the piecewisemonotonic RM model asymptotically optimally. We claim here that our algorithm preserves the essence of configurational computation and uses less broadcasts than simulation by the contraction and linearconnected component computation methods [1].
The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320)
 International Journal of Foundations of Computer Science
, 1997
"... Reconfigurable communication networks for massively parallel multiprocessor systems offer the possibility to realize a number of application demands like special communication patterns or realtime requirements. This paper presents the design principle of a reconfigurable network which is able to re ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Reconfigurable communication networks for massively parallel multiprocessor systems offer the possibility to realize a number of application demands like special communication patterns or realtime requirements. This paper presents the design principle of a reconfigurable network which is able to realize any graph of maximal degree four. The architecture is based on a special multistage Clos network, constructed out of a number of static routing switches of equal size. Upper bounds on the cut size of 4regular graphs, if split into a number of clusters, allow minimizing the number of switches and connections while still offering the desired reconfiguration capabilities as well as large scalability and flexible multiuser access. Efficient algorithms configuring the architecture are based on an old result by Petersen 27 about the decomposition of regular graphs. The concept presented here is the basis for the Parsytec SC series of reconfigurable MPPsystems. The currently largest reali...
The Reconfigurable Mesh: Programming Model, SelfSimulation, Adaptability, Optimality, and Applications
"... Typeset in Palatino by TEX and LATEX 2ε.Except where otherwise indicated, this thesis is my own original work and has not been submitted for any other degree. ..."
Abstract
 Add to MetaCart
Typeset in Palatino by TEX and LATEX 2ε.Except where otherwise indicated, this thesis is my own original work and has not been submitted for any other degree.
Reconfigurable Meshes: Theory and Practice 1
, 1997
"... Configurable computing has recently gained much attention with the promise of delivering an order of magnitude performance improvement over general purpose processors. In this paper we contrast the abstract models of reconfigurable architectures and actual hardware available for configurable computi ..."
Abstract
 Add to MetaCart
Configurable computing has recently gained much attention with the promise of delivering an order of magnitude performance improvement over general purpose processors. In this paper we contrast the abstract models of reconfigurable architectures and actual hardware available for configurable computing systems. There is a wealth of ideas related to abstract models of reconfigurable architectures and fast parallel algorithms which exploit the reconfiguration potential in nontrivial ways. We summarize these abstract models and illustrate the power of these models using several example algorithms. We identify the practical problems in implementing these models in VLSI and describe some prototype implementations. Commercial FPGA devices which are being touted as the solution for building configurable computing systems are also examined. The MAARC2 project at USC endeavors to bridge this gap between the abstract and the real worlds. 1 This work was supported by DARPA under contract DABT6396C0049 monitored by Fort Hauchuca.
Constant Time Computational Geometry On Reconfigurable Meshes With Buses
, 1992
"... We develop O(1) time algorithms for the following computational geometry problems: convex hull, smallest enclosing box, ECDF search, and triangulation. Our algorithms are for the reconfigurable mesh with buses architecture and run on the RMESH, PARBUS, and MRN models. Keywords And Phrases Convex hu ..."
Abstract
 Add to MetaCart
We develop O(1) time algorithms for the following computational geometry problems: convex hull, smallest enclosing box, ECDF search, and triangulation. Our algorithms are for the reconfigurable mesh with buses architecture and run on the RMESH, PARBUS, and MRN models. Keywords And Phrases Convex hull, enclosing box, ECDF search, triangulation, reconfigurable mesh with buses. ############### * This research was supported, in part, by the National Science Foundation under grant MIP9103379.  2  1. Introduction Several different mesh like architectures with reconfigurable buses have been proposed in the literature. These include the content addressable array processor (CAAP) of Weems et al. [WEEM87,89], the polymorphic torus of Li and Maresca [LI89ab, MARE89], the reconfigurable mesh with buses (RMESH) of Miller et al. [MILL88abc], the processor array with a reconfigurable bus system (PARBUS) of Wang and Chen [WANG90ab], and the reconfigurable network (RN) of BenAsher et al. [BENA9...