Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Journal of Parallel and Distributed Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
Solving graph theory problems using reconfigurable pipelined optical buses
Parallel Computing
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Parallel and Distributed Systems
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus
IEEE Transactions on Computers
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
More Efficient Topological Sort Using Reconfigurable Optical Buses
The Journal of Supercomputing
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
(C) Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
Faster optimal parallel prefix circuits: New algorithmic construction
Journal of Parallel and Distributed Computing
Computation-efficient parallel prefix
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Two families of parallel prefix algorithms for multicomputers
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Parallel prefix algorithms on the multicomputer
WSEAS Transactions on Computer Research
Fast problem-size-independent parallel prefix circuits
Journal of Parallel and Distributed Computing
New parallel prefix algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
New families of computation-efficient parallel prefix algorithms
WSEAS Transactions on Computers
simulating a PR-mesh on an larpbs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A class of almost-optimal size-independent parallel prefix circuits
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We present several fast algorithms for multiple addition and prefix sum on the Linear Array with a Reconfigurable Pipelined Bus System (LARPBS), a recently proposed architecture based on optical buses. Our algorithm for adding N integers runs on an N log M-processor LARPBS in O(log* N) time, where log* N is the number of times logarithm has to be taken to reduce N below 1 and M is the largest integer in the input. Our addition algorithm improves the time complexity of several matrix multiplication algorithms proposed by Li, Pan and Zheng (IEEE Trans. Parallel and Distributed Systems, 9(8):705–720, 1998). We also present several fast algorithms for computing prefix sums of N integers on the LARPBS. For integers with bounded magnitude, our first algorithm for prefix sum computation runs in O(log log N) time using N processors and in O(1) time using N1+ϵ processors, for \frac{1}{3} ≤ ϵ O(log log N log* N) time using N log M processors, when M is the largest integer in the input. Our second algorithm for multiple addition runs in O(log* N) time using N1+ϵ log M processors, for \frac {1}{3} ≤ ϵ