Results 1 
9 of
9
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...
Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh
"... 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. This paper presents three constant time algorithms to compute the contour of the maximal element ..."
Abstract

Cited by 7 (4 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. This paper presents three constant time algorithms to compute the contour of the maximal elements of N planar points on the RM. The first algorithm employs an RM of size N \ThetaN while the second one uses a 3D RM of size p N \Theta p N \Theta p N . We further extend the result to kD RM of size N 1=(k\Gamma1) \Theta N 1=(k\Gamma1) \Theta \Delta \Delta \Delta \Theta N 1=(k\Gamma1) . Keywords: Reconfigurable mesh; Parallel algorithm; Computational geometry 1 Introduction It is well known that interprocessor communications and simultaneous memory accesses often act as bottlenecks in presentday parallel machines [1]. Bus systems have been introduced recently to a number of parallel machines to address this problem. Examples include the Bus Automaton [2], the Reconfigurable ...
Threedimensional layers of maxima
 Algorithmica
"... Abstract. We present an O(n log n)time algorithm to solve the threedimensional layersofmaxima problem, an improvement over the prior O(n log n log log n)time solution. A previous claimed O(n log n)time solution due to Atallah, Goodrich, and Ramaiyer [SCG’94] has technical flaws. Our algorithm i ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We present an O(n log n)time algorithm to solve the threedimensional layersofmaxima problem, an improvement over the prior O(n log n log log n)time solution. A previous claimed O(n log n)time solution due to Atallah, Goodrich, and Ramaiyer [SCG’94] has technical flaws. Our algorithm is based on a common framework underlying previous work, but to implement it we devise a new data structure to solve a special case of dynamic planar point location in a staircase subdivision. Our data structure itself relies on a new extension to dynamic fractional cascading that allows vertices of high degree in the control graph. 1
Improved Scaling Simulation of the General Reconfigurable Mesh
"... The reconfigurable mesh (RMesh) has drawn much interest in recent years, due in part to its ability to admit extremely fast algorithms for a large number of problems. For these algorithms to be useful in practice, the RMesh must be scalable; that is, any algorithm designed for a large RMesh shoul ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The reconfigurable mesh (RMesh) has drawn much interest in recent years, due in part to its ability to admit extremely fast algorithms for a large number of problems. For these algorithms to be useful in practice, the RMesh must be scalable; that is, any algorithm designed for a large RMesh should be able to run on a smaller RMesh without significant loss of efficiency. This amounts to designing a "scaling simulation " that simulates an arbitrary step of an N N RMesh on a smaller P P RMesh in O N2 P 2 f(N; P) steps; f(N; P) is a nondecreasing function representing the simulation overhead. The aim is to minimize this overhead, ideally to a constant. In this paper, we present a scaling simulation for the general (unconstrained) RMesh. This simulation has an overhead of log N (smaller than the log P log N overhead of the previous fastest scaling simulation), P using a CREW LRNMesh (a weaker version of the General RMesh) as the simulating model; prior simulations needed concurrent write.
Reconfigurable architectures and algorithms: A research survey
 IJCSA
, 2009
"... Ever since the introduction of the Dynamically Reconfigurable Buses, the architecture gained a lot of popularity amongst the researchers and scientists for its high performance computing with general purpose processor used. It is a powerful model of computation in which communication pattern between ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Ever since the introduction of the Dynamically Reconfigurable Buses, the architecture gained a lot of popularity amongst the researchers and scientists for its high performance computing with general purpose processor used. It is a powerful model of computation in which communication pattern between the processors could be changed during the execution. Following the years several new architectures and efficient algorithms for these were proposed, and their implementation using FPGA’s have been shown. This paper presents a survey on the different architectures proposed, and few important algorithms presented for these specialized architectures over the period of last two decades. Keywords: PARBS, RMESH, RN, LARPBS, Polymorphic Torus Network, AROB. 1.
RealTime Communication Scheduling in a Multicomputer Video Server
"... In this paper, we will address the problem of scheduling communication over the interconnection network of a distributedmemory multicomputer video server. We will show that this problem is closely related to the problem of data distribution and movie scheduling in such a system. A solution is pr ..."
Abstract
 Add to MetaCart
In this paper, we will address the problem of scheduling communication over the interconnection network of a distributedmemory multicomputer video server. We will show that this problem is closely related to the problem of data distribution and movie scheduling in such a system. A solution is proposed in this paper that addresses these three issues at once. The movies are distributed evenly over all the nodes of the multicomputer. The proposed solution minimizes the contention for links over the switch. The proposed solution makes movie scheduling very simple  if the first block of the movie is scheduled, the rest of the movie is automatically scheduled. Moreover, if the first block of the movie stream is scheduled without network contention, the proposed solution guarantees that there will be no network contention during the entire duration of playback of that movie. We will show that the proposed approach to communication scheduling is optimal in utilizing the network res...
A Simulator for the Reconfigurable Mesh Architecture
"... In this paper we present a simulator for the recongurable mesh SIMD architecture. The purpose of the simulator is to assist the analysis of algorithms and the visualisation of their behaviour. Furthermore it can be used to demonstrate the abilities of reconguration in an educational environment. ..."
Abstract
 Add to MetaCart
In this paper we present a simulator for the recongurable mesh SIMD architecture. The purpose of the simulator is to assist the analysis of algorithms and the visualisation of their behaviour. Furthermore it can be used to demonstrate the abilities of reconguration in an educational environment. 1
An O((log log n)²) Time Convex Hull Algorithm on Reconfigurable Meshes
"... It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sublogarithmic time on a reconfigurable mesh of size p n \Theta p n. Our main contribution is to provide the first breakthrough: we propose an almost optimal algorithm runnin ..."
Abstract
 Add to MetaCart
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sublogarithmic time on a reconfigurable mesh of size p n \Theta p n. Our main contribution is to provide the first breakthrough: we propose an almost optimal algorithm running in O((log log n) 2 ) time on a reconfigurable mesh of size p n \Theta p n. With slight modifications this algorithm can be implemented to run in O((loglog n) 2 ) time on a reconfigurable mesh of size p n log log n \Theta p n log log n . Clearly, the latter algorithm is workoptimal. We also show that any algorithm that computes the convex hull of a set of n sorted points on an nprocessor reconfigurable mesh must take \Omega\Gamma log log n) time. Our result opens the door to efficient convexhullbased algorithms on reconfigurable meshes.
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.