1999
DOI: 10.1155/1999/71739
|View full text |Cite
|
Sign up to set email alerts
|

Single Step Undirected Reconfigurable Networks

Abstract: The reconfigurable mesh (RN-MESH) can solve a large class of problems in constant time, including problems that require logarithmic time by other, even shared memory, models such as the PRAM with a similar number of processors [3]. In this work we show that for the RN-MESH these constants can always be reduced to one, still using a polynomial number of processors. Given a reconfigurable mesh that computes a set of values in constant time, we show that it can be simulated by a single step reconfigurable mesh wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 12 publications
(26 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?