Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System

Authors:
Amitava Datta;Robyn A. Owens;Subbiah Soundaralakshmi
Affiliations:
-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 6
Cited 1

Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes

IEEE Transactions on Computers
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 and scalable quicksort on a linear array with a reconfigurable pipelined bus system

Future Generation Computer Systems
Models and Algorithms for Optical and Optoelectronic Parallel Computers

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal

Fast and Scalable Algorithms for Euclidean Distance Transform on the LARPBS

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fast algorithm for sorting on a linear array with a reconfigurable pipelined bus system (LARPBS), one of the recently proposed parallel architectures based on optical buses. Our algorithm sorts N numbers in O(log N log logN) worst-case time using N processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of O(log2 N).