Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
How to share memory in a distributed system
Journal of the ACM (JACM)
Deterministic simulation of idealized parallel computers on more realistic ones
SIAM Journal on Computing
A probabilistic simulation of PRAMs on a bounded degree network
Information Processing Letters
Sorting in c log n parallel steps
Combinatorica
SIAM Journal on Computing
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Deterministic P-RAM simulation with constant redundancy
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Journal of Computer and System Sciences
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
Wavelength Division Multiple Access Channel Hypercube Processor Interconnection
IEEE Transactions on Computers
Deterministic Simulations of Prams on Bounded Degree Networks
SIAM Journal on Computing
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
Singular value decomposition on processor arrays with a pipelined bus system
Journal of Network and Computer Applications
Parallel computation: models and methods
Parallel computation: models and methods
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing - Special issue: high performance computing 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
Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system
Future Generation Computer Systems
Parallel hashing: an efficient implementation of shared memory
Journal of the ACM (JACM)
Parallel Computing Using Optical Interconnections
Parallel Computing Using Optical Interconnections
Time-Division Optical Communications in Multiprocessor Arrays
IEEE Transactions on Computers
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Computation and communication aspects of arrays with optical pipelined buses
Computation and communication aspects of arrays with optical pipelined buses
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Computers
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
Fast and Scalable Algorithms for Euclidean Distance Transform on the LARPBS
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient Graph Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Journal of Parallel and Distributed Computing
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Fast All Nearest Neighbor Algorithms from Image Processing Perspective
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
Computers and Electrical Engineering
Computing on the restricted LARPBS model
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Faster sorting on a linear array with a reconfigurable pipelined bus system
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Fast parallel algorithms for the longest common subsequence problem using an optical bus
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Scheduling light-trails on WDM rings
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
In this paper, we present deterministic and probabilistic methods for simulating PRAM computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The following results are established in this paper. (1) Each step of a p-processor PRAM with m=O(p) shared memory cells can be simulated by a p-processors LARPBS in O(log p) time, where the constant in the big-O notation is small. (2) Each step of a p-processor PRAM with m=Ω(p) shared memory cells can be simulated by a p-processors LARPBS in O(log m) time. (3) Each step of a p-processor PRAM can be simulated by a p-processor LARPBS in O(log p) time with probability larger than 1−1/p^c for all c0. (4) As an interesting byproduct, we show that a p-processor LARPBS can sort p items in O(log p) time, with a small constant hidden in the big-O notation. Our results indicate that an LARPBS can simulate a PRAM very efficiently.