Results 1  10
of
43
Reconfigurable Computing Systems
 Proceedings of the IEEE
, 2002
"... Reconfigurable computing is emerging as the new paradigm for satisfying the simultaneous demand for application performance and flexibility. The ability to customize the architecture to match the computation and the dataflow of the application has demonstrated significant performance benefits compar ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
Reconfigurable computing is emerging as the new paradigm for satisfying the simultaneous demand for application performance and flexibility. The ability to customize the architecture to match the computation and the dataflow of the application has demonstrated significant performance benefits compared to general purpose architectures. Computer vision applications are one class of applications that have significant heterogeneity in their computation and communication structures. At the low level vision algorithms have regular, repetitive computations operating on large sets of image data with predictable data dependencies. At the higher level the computations have irregular dependencies. Computer vision application characteristics have significant overlap with the advantages of reconfigurable architectures. The main focus of the paper is on outlining the methodologies required to realize the potential of reconfigurable architectures for vision applications. After giving a broad introduction to reconfigurable computing, the advantages of utilizing reconfigurable architectures for vision applications are outlined and illustrated using example computations. The paper discusses the development of fundamental configurable computing models that abstract the underlying hardware for high level application mapping. The Hybrid System Architecture Model and algorithms utilizing the model are illustrated to demonstrate a formal framework. The paper also outlines ongoing research and provides a comprehensive list of references for further reading.
The Complexity of Reconfiguring Network Models
, 1992
"... This paper concerns some of the theoretical complexity aspects of the reconfigurable network model. The computational power of the model is investigated under several variants, depending on the type of switches (or switch operations) assumed by the network nodes. Computational power is evaluated by ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
This paper concerns some of the theoretical complexity aspects of the reconfigurable network model. The computational power of the model is investigated under several variants, depending on the type of switches (or switch operations) assumed by the network nodes. Computational power is evaluated by focusing on the set of problems computable in constant time in each variant. A hierarchy of such problem classes corresponding to different variants is shown to exist and is placed relative to traditional classes of complexity theory. Department of Mathematics and Computer Science, The Haifa University, Haifa, Israel. Email: yosi@mathcs2.haifa.ac.il y Department of Computer Science, Technische Universitat Munchen, 80290 Munchen, Germany. Email: lange@informatik.tumuenchen.de z Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel. Email: peleg@wisdom.weizmann.ac.il. Supported in part by an Allon Fellowship, by a Bantrell Fellowship an...
A Novel Deterministic Sampling Scheme with Applications to BroadcastEfficient Sorting on the Reconfigurable Mesh
 Journal of Parallel and Distributed Computing
, 1996
"... The main contribution of this work is to present a simple deterministic sampling strategy that, when used for bucket sorting, yields buckets that are remarkably well balanced, making costly balancing unnecessary. To the best of our knowledge this is the first instance of a deterministic sampling ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
The main contribution of this work is to present a simple deterministic sampling strategy that, when used for bucket sorting, yields buckets that are remarkably well balanced, making costly balancing unnecessary. To the best of our knowledge this is the first instance of a deterministic sampling strategy featuring this performance. Although the strategy is perfectly general, we illustrate its power by devising a VLSIoptimal, O(1) time sorting algorithm for the reconfigurable mesh. As a byproduct of the inherent simplicity of our sampling and bucketing scheme we show that our sorting algorithm can be implemented using only 35 broadcast operations, a substantial improvement over the previously best known algorithm that requires 59 broadcasts. Keywords: deterministic sampling, bucket sort, reconfigurable meshes, sorting, VLSI optimal algorithms, constanttime algorithms 1 Introduction Sorting is, unquestionably, one of the fundamental operations in computer science. A natura...
Selection on the Reconfigurable Mesh
 Proc. Frontiers of Massively Parallel Computation
, 1992
"... Our main result is a \Theta(log n) time algorithm to select the kth smallest element in a set of n elements on a reconfigurable mesh with n processors. This improves on the previous fastest algorithm's running time by a factor of log n. We also show that some variants of this problem can be solved e ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Our main result is a \Theta(log n) time algorithm to select the kth smallest element in a set of n elements on a reconfigurable mesh with n processors. This improves on the previous fastest algorithm's running time by a factor of log n. We also show that some variants of this problem can be solved even faster. First we show that a good approximation to the median of n elements can be found in \Theta(log log n) time. This can be used to solve twodimensional linear programming over n equations in \Theta(log n log log n) time, an improvement of log n= log log n time over the previous fastest algorithm. Next, we show that, for any constant ffl ? 0, selecting the kth smallest element in a set of n 1\Gammaffl elements evenly spaced throughout the mesh can be done in constant time. We also show that one can select the kth smallest element from n bbit words in \Theta((b= log b) maxflog n \Gamma log b; 1g) time, which implies that if the elements come from a polynomial range, one can...
Routing and Sorting on Meshes with Row and Column Buses
, 1994
"... of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 264273, 1986. [50] T. Suel. Routing and sorting on meshes with row and column buses. In Proceedings of the 8th International Parallel Processing Symposium, April 1994. [51] B. Wang and G. Chen. Constant time algorithms fo ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 264273, 1986. [50] T. Suel. Routing and sorting on meshes with row and column buses. In Proceedings of the 8th International Parallel Processing Symposium, April 1994. [51] B. Wang and G. Chen. Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems. IEEE Transactions on Parallel and Distributed Systems, 1:500507, 1990. [27] M. Kunde. Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound. In Proceedings of the 1st Annual European Symposium on Algorithms, September 1993. [28] R. E. Ladner, J. Lampe, and R. Rogers. Vector prefix addition on subbus mesh computers. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 387396, June 1993. [29] F. T. Leighton. Tight bounds on the com
Multicast Virtual Topologies for Collective Communication in MPCs and ATM Clusters
 In Proceedings of the Supercomputing
, 1995
"... This paper de#nes and describes the properties of a multicast virtual topology, the Marray, and a resourcee#cient variation, the REMarray. It is shown how several collective operations can be implemented e#ciently using these virtual topologies, while maintaining low complexity. Because the metho ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper de#nes and describes the properties of a multicast virtual topology, the Marray, and a resourcee#cient variation, the REMarray. It is shown how several collective operations can be implemented e#ciently using these virtual topologies, while maintaining low complexity. Because the methods are applicable to any parallel computing environment that supports multicast communication in hardware, they provide a framework for collective communication libraries that are portable and yet take advantage of such lowlevel hardware functionality.Inparticular, the paper describes the practical issues of using these methods in wormholerouted massively parallel computers #MPCs# and in workstation clusters connected by Asynchronous Transfer Mode #ATM# networks. Performance results are given for both environments. # This work was supported in part by DOE grant DEFG0293ER25167,and by NSF grants MIP9204066, CDA9222901, and CCR9503838. 1 Introduction The supercomputer market now inc...
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 the Reconfigurable Mesh
"... There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents two O(1) time algorithms to compute the contour of the maximal elements of N pla ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents two O(1) 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 \Theta N while the second one uses a 3D RM of size p N \Theta p N \Theta p N . 1 Introduction It is wellknown that interprocessor communications and simultaneous memory accesses often act as bottlenecks in presentday parallel machines. Bus systems have been intro Corresponding author. duced recently to a number of parallel machines to address this problem. Examples include the Bus Automaton [15], the Reconfigurable Mesh (RM) [11], the content addressable array processor [16], and the Polymorphic torus [9]. A bus system is called reconfigurable if it can be dynamically changed according to either global or local i...
Optimal average case sorting on arrays
 Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, number 900 in Lecture Notes in Computer Science
, 1995
"... Abstract. We present algorithms for sorting and routing on twodimensional meshconnected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. We present algorithms for sorting and routing on twodimensional meshconnected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were known even for a load of one. Our algorithm is optimal for every load. Other architectures we consider include meshes with diagonals and reconfigurable meshes. Furthermore, the method applies to meshes of arbitrary higher dimensions and also enables optimal solutions for the routing problem. 1 Introduction We present deterministic algorithms that sort and route on meshconnected computers fast on average. For important, fundamental classes of problems (so called hh relations) we completely solve the problem in that sense that our approach is optimal for all cases. (We present matching lower bounds.) A twodimensional meshconnected computer is a processor array, where each processor has one bidirectional connection to each of its four neighbors. Meshes are a promising parallel architecture due to their scalability, their regular interconnection structure with its locality of communication, and since they need only linear space in the VLSImodel. We also consider meshes with wraparound connections, also known as tori, meshes with additional diagonal connections, and reconfigurable meshes.
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 7 (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 ...