Integer summing algorithms on reconfigurable meshes
From MaRDI portal
Publication:1128663
DOI10.1016/S0304-3975(97)00007-8zbMath0902.68089MaRDI QIDQ1128663
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Mathematical problems of computer architecture (68M07) Computer system organization (68M99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Constant time sorting on a processor array with a reconfigurable bus system
- Sorting on PRAMs with reconfigurable buses
- Deriving algorithms on reconfigurable networks based on function decomposition
- Sorting \(n\) numbers on \(n\times n\) reconfigurable meshes with buses
- Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems
- Bounds to Complexities of Networks for Sorting and for Switching
- Optimal bounds for decision problems on the CRCW PRAM
- Parallel computations on reconfigurable meshes
This page was built for publication: Integer summing algorithms on reconfigurable meshes