Multiple search problem on reconfigurable meshes
Resource
Information Processing Letters 58 (2): 65-69
Journal
Information Processing Letters
Journal Volume
58
Journal Issue
2
Pages
65-69
Date Issued
1996
Date
1996
Author(s)
Abstract
In this paper, a constant time algorithm on an n1/2 × n1/2 × n1/2 reconfigurable mesh is presented for solving the multiple search problem.
Subjects
Multiple search problem; Parallel algorithms; Reconfigurable mesh
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
31.pdf
Size
412.19 KB
Format
Adobe PDF
Checksum
(MD5):34f5659866733fff5e08c513f8e87057