The Systolic Recon gurable Mesh
نویسنده
چکیده
In this paper, we introduce the Systolic Recon gurable Mesh (SRM), which combines aspects of the recon gurable mesh with that of systolic arrays. Every processor controls a local switch that can be recon gured during every clock cycle in order to control the physical connections between its four bi-directional bus lines. Data is input on one side of the systolic recon gurable mesh and output from another side, one row/column per unit time. E cient algorithms are presented for intermediate-level vision tasks, including histograming, connectivity, convexity, and proximity.
منابع مشابه
Optimal Algorithms for Constrained Recon gurable Meshes
This paper introduces a constrained recon gurable mesh model which incorporates practical assump tions about propagation delays on large sized buses Simulations of optimal recon gurable mesh algo rithms on the constrained recon gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems are then presented For the problems investigated the con strain...
متن کاملOptimal Algorithms for Constrained Reconfigurable Meshes
This paper introduces a constrained recon gurable mesh model which incorpo rates practical assumptions about propagation delays on large sized buses Sim ulations of AT optimal recon gurable mesh algorithms on the constrained re con gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems requiring less area are then presented For the problems inv...
متن کاملConstant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors
The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on recon gurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most e cient. For a problem with an N N imag...
متن کاملConstant Time Algorithms for Computing the Contour of Maximal Elements on the Recon gurable Mesh
Elements on the Recon gurable Mesh M. Manzur Murshed and Richard P. Brent Computer Sciences Lab, Research School of Information Sciences & Engg. The Australian National University, Canberra ACT 0200, Australia E-mail: fmurshed,[email protected] Abstract There has recently been an interest in the introduction of recon gurable buses to existing parallel architectures. Among them Recon gurable...
متن کاملA Java Applet to Visualize Algorithms on Reconfigurable Mesh
Recently, many e cient parallel algorithms on the recon gurable mesh have been developed. However, it is not easy to understand the behavior of a recon gurable mesh. This is mainly because the bus topology can change dynamically during the execution of algorithm. In this work, we have developed JRM, a Java applet for visualizing parallel algorithm on the recon gurable mesh to help on understand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004