๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal Algorithms for Constrained Reconfigurable Meshes

โœ Scribed by Bryan Beresford-Smith; Oliver Diessel; Hossam ElGindy

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
220 KB
Volume
39
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

model the propagation delay on a bus-unit 1 by a constant, and to only permit the class of algorithms, denoted by A k , which configure bus components bound in size to at most k bus-units to run on the model.

We give a detailed description of our reconfigurable mesh model in the following section. Lower bounds are discussed in Section 3. In Section 4 we present an optimal algorithm for sorting on a constrained reconfigurable mesh. An optimal convex hull algorithm for constrained reconfigurable meshes is presented in Section 5. We conclude with some general remarks and open problems.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for PDE-constrained optimizat
Algorithms for PDE-constrained optimization
โœ Roland Herzog; Karl Kunisch ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 166 KB

Some first and second order algorithmic approaches for the solution of PDE-constrained optimization problems are reviewed. An optimal control problem for the stationary Navier-Stokes system with pointwise control constraints serves as an illustrative example. Some issues in treating inequality const

Constant-Time Algorithm for the Euclidea
Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes
โœ Amitava Datta; Subbiah Soundaralakshmi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 288 KB

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. In this paper, we p

Time-Efficient Maze Routing Algorithms o
Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures
โœ F Ercal; H.C Lee ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 396 KB

The routing problem is one of the most widely studied problems in VLSI design. Maze-routing algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on C. Y. Lee's algorithm (1961, IRE Trans. Electron. Comput. (Sept.), 34