MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗
From MaRDI portal
Publication:4820154
DOI10.1080/10637199608915554zbMath1049.68553OpenAlexW2090924101MaRDI QIDQ4820154
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199608915554
Related Items (6)
Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system* ⋮ INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES ⋮ SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES ⋮ A new computation of shape moments via quadtree decomposition ⋮ From Parallelism to Nonuniversality: An Unconventional Trajectory ⋮ FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
- Constant time sorting on a processor array with a reconfigurable bus system
- Techniques for parallel manipulation of sparse matrices
- Sparse matrix computations on the hypercube and related networks
- Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
- On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
- The Parallel Simplicity of Compaction and Chaining
- Optimal bounds for decision problems on the CRCW PRAM
This page was built for publication: MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗