Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System

Authors:
Affiliations:
Venue:
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1996

Citing 0
Cited 12

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
Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
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
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
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
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective

Journal of Parallel and Distributed Computing
A novel O(1) time algorithm for 3D block-based medial axis transform by peeling corner shells

Parallel 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
Computing on the restricted LARPBS model

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the current fiber optic technology, a new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), is proposed in this paper. A parallel quicksort algorithm is implemented on the model, and its time complexity is analyzed. For a set of N numbers, the quicksort algorithm reported in this paper runs in O( log sub 2 N ) average time on a linear array with a reconfigurable pipelined bus system of size N. Besides proposing a new algorithm on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations can be used to design other parallel algorithms on the same model. Future research in this area is also identified in this paper.