Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

Authors:
Sanguthevar Rajasekaran;Sartaj Sahni
Affiliations:
Univ. of Florida, Gainesville;Univ. of Florida, Gainesville
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 14
Cited 22

Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
Optimal bounds for decision problems on the CRCW PRAM

Journal of the ACM (JACM)
Space multiplexing of waveguides in optically interconnected multiprocessor systems

The Computer Journal - Special issue on object-oriented programming
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
The power of reconfiguration

Journal of Parallel and Distributed Computing
Efficient optical communication in parallel computers

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel Computations on Reconfigurable Meshes

IEEE Transactions on Computers
A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Reconfigurable Buses with Shift Switching: Concepts and Applications

IEEE Transactions on Parallel and Distributed Systems
Expected time bounds for selection

Communications of the ACM
Fundamentals of Computer Alori

Fundamentals of Computer Alori
An Optimal Sorting Algorithm on Reconfigurable Mesh

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection

ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

The Journal of Supercomputing - Special issue: high performance computing systems
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems

The Journal of Supercomputing
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Computers
L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses

IEEE Transactions on Parallel and Distributed Systems
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus

IEEE Transactions on Computers
More Efficient Topological Sort Using Reconfigurable Optical Buses

The Journal of Supercomputing
Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Computing Distance Maps Efficiently Using an Optical Bus

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Degree of scalability: scalable reconfigurable mesh algorithms for multiple addition and matrix-vector multiplication

Parallel Computing
A Scalable Interconnection Network Architecture for Petaflops Computing

The Journal of Supercomputing
Merging, sorting and matrix operations on the SOME-bus multiprocessor architecture

Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System

The Journal of Supercomputing
An improved, randomized algorithm for parallel selection with an experimental study

Journal of Parallel and Distributed Computing
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system

Journal of Parallel and Distributed Computing
Efficient Parallel Hierarchical Clustering Algorithms

IEEE Transactions on Parallel and Distributed Systems
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective

Journal of Parallel and Distributed Computing
An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Computers and Electrical Engineering
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal
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
Scheduling light-trails on WDM rings

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we present efficient algorithms for sorting, selection, and packet routing on the AROB (Array with Reconfigurable Optical Buses) model. One of our sorting algorithms sorts n general keys in O(1) time on an AROB of size $n^\epsilon \times n$ for any constant $\epsilon 0.$ We also show that selection from out of n elements can be done in randomized O(1) time employing n processors. Our routing algorithm can route any h-relation in randomized O(h) time. All these algorithms are clearly optimal.