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

Optimization of algorithms in mesh classes

โœ Scribed by G.S. Ganshin

Publisher
Elsevier Science
Year
1979
Weight
787 KB
Volume
19
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal Algorithms for Constrained Recon
Optimal Algorithms for Constrained Reconfigurable Meshes
โœ Bryan Beresford-Smith; Oliver Diessel; Hossam ElGindy ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

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.

An Optimal Sorting Algorithm on Reconfig
An Optimal Sorting Algorithm on Reconfigurable Mesh
โœ J. Jang; V.K. Prasanna ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 853 KB

This paper shows nontrivial ways to use the Reconfigurable Mesh to solve several basic arithmetic problems in constant time. These solutions are obtained by novel ways to represent numbers and by exploiting the reconfigurability of the architecture. In particular, a constant time algorithm to add \(