✦ LIBER ✦

Multiple search problem on reconfigurable meshes

✍ Scribed by Chia-Chiang Chao; Wen-Tsuen Chen; Gen-Huey Chen

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 412 KB
Volume: 58
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00033-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Visibility Computation on Reconfigurable

Visibility Computation on Reconfigurable Meshes

✍ Kikuo Fujimura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 435 KB

In this paper, we first report an O(1) time algorithm to Visibility problems are investigated using reconfigurable solve the visibility problem in the plane containing a total meshes. A number of algorithms are proposed on the architecof n disjoint edges using an n ϫ n R-mesh. Thus, the ture for vis

Scaling multiple addition and prefix sum

Scaling multiple addition and prefix sums on the reconfigurable mesh

✍ Jerry L. Trahan; Ramachandran Vaidyanathan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 77 KB

Multiple addition is the problem of adding N b-bit integers. Prefix sums and multiple addition play fundamental roles in many algorithms, particularly on the reconfigurable mesh (R-Mesh). Scaling algorithms on the R-Mesh to run with the same or increased efficiency on fewer processors is a challengi

Constant-time thresholding on reconfigur

Constant-time thresholding on reconfigurable mesh

✍ Kuo-Liang Chung 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 388 KB

hresholding is a very important labeling operation on a gray-scale image. It refers to setting all the gray levels below a certain level to binary value 0; above that certain level to binary value 1. Given the histogram of one N X N image, this paper presents a constant-time thresholding on a reconf

A Time-Optimal Multiple Search Algorithm

A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications

✍ D. Bhagavathi; S. Olariu; W. Shen; L. Wilson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 739 KB

Given a sorted sequence \(A=a_{1}, a_{2}, \ldots, a_{n}\) of items from a totally ordered universe, along with an arbitrary sequence \(Q=q_{1}\), \(q_{2}, \ldots, q_{m}(1 \leq m \leq n)\) of queries, the multiple search problem involves computing for every \(q_{j}(1 \leq j \leq m)\) the unique \(a_{

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 \(

P-Bandwidth Priority Queues on Reconfigu

P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes

✍ Alan A. Bertossi; Alessandro Mei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 356 KB

This paper shows a parallel implementation of a priority queue with bandwidth P and maximum size nP by means of a network with reconfigurable buses. The proposed solution is based on a tree of meshes architecture of O(nP 2 ) processors and O(P log n) maximum subbus length. The computational times re