Applications of reconfigurable meshes to constant-time computations

DOI10.1016/0167-8191(93)90052-MMaRDI QIDQ1208520zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, James L. Schwing, Jingyuan Zhang

Publication date 16 May 1993

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90052-m

zbMATH Keywords

bus systemsinteger sortingparallel algorithmsparantheses matchingprefix sumsreconfigurable meshessorting algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Constant time sorting on reconfigurable meshes
• Integer summing algorithms on reconfigurable meshes
• Integer sorting on a mesh-connected array of processors
• Constant-time convexity problems on reconfigurable meshes
• Constant time sorting on a processor array with a reconfigurable bus system

Cited in

(8)

• Integer summing algorithms on reconfigurable meshes
• A constant-time channel-assignment algorithm on reconfigurable meshes
• Parallel finding all initial palindromes and periods of a string on reconfigurable meshes
• A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes
• Simulating shared memory in real time: On the computation power of reconfigurable architectures
• SIMULATING AN R-MESH ON AN LR-MESH IN CONSTANT TIME
• Constant time sorting on reconfigurable meshes
• An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh

This page was built for publication: Applications of reconfigurable meshes to constant-time computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208520)