MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗

DOI10.1080/10637199608915554zbMATH Open1049.68553OpenAlexW2090924101MaRDI QIDQ4820154FDOQ4820154

Authors: Sandy Pavel, Selim G. Akl 

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer system organization (68M99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal bounds for decision problems on the CRCW PRAM
• Title not available (Why is that?)
• On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
• Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
• The Parallel Simplicity of Compaction and Chaining
• Constant time sorting on a processor array with a reconfigurable bus system
• An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
• Techniques for parallel manipulation of sparse matrices
• Sparse matrix computations on the hypercube and related networks

Cited In (6)

• A new computation of shape moments via quadtree decomposition
• FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
• Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system*
• From parallelism to nonuniversality: an unconventional trajectory
• SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
• Integer sorting and routing in arrays with reconfigurable optical buses

This page was built for publication: MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗

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