Book ChapterDOI
Fast merging and sorting on a partitioned optical passive stars network
TLDR
This work presents fast algorithms for merging and sorting of data on a multiprocessor system connected through a Partitioned Optical Passive Stars (POPS) network and their sorting algorithm is more efficient compared to a simulated hypercube sorting algorithm on the POPS.Abstract:
We present fast algorithms for merging and sorting of data on a multiprocessor system connected through a Partitioned Optical Passive Stars (POPS) network. In a POPS(d,g) network there are n = dg processors and they are divided into g groups of d processors each. There is an optical passive star (OPS) coupler between every pair of groups. Each OPS Coupler can receive an optical signal from any one of its source nodes and broadcast the signal to all the destination nodes. The time needed to perform this receive and broadcast is referred to as a slot and the complexity of an algorithm using the POPS network is measured in terms of number of slots it uses. Our sorting algorithm is more efficient compared to a simulated hypercube sorting algorithm on the POPS.read more
Citations
More filters
Proceedings ArticleDOI
Parallel algorithms for the medial axis transform on linear arrays with a reconfigurable pipelined bus system
TL;DR: An O(log log N) bus cycles parallel algorithm for the medial axis transform of an N/spl times/N binary image on a linear array with a reconfigurable pipelined bus system using N/sup 2/ processors is provided.
Journal ArticleDOI
Packet routing and selection on the POPS network
TL;DR: A randomized algorithm is presented in this paper that performs better than the best prior algorithms on the POPS network and also presents a randomized algorithm for selection on thePOPS network.
Journal ArticleDOI
Randomized sorting on the pops network
TL;DR: In this article, the authors presented an algorithm that solves the problem of sparse enumeration sorting of d∊ keys in the Partitioned Optical Passive Stars (POPS) network.
Proceedings ArticleDOI
Packet routing and selection on the POPS network
TL;DR: A randomized algorithm is presented in this paper that performs better than the best prior algorithms on the POPS network and also presents a randomized algorithm for selection on thePOPS network.
Journal ArticleDOI
Optimal hypercube simulation on the partitioned optical passive stars network
TL;DR: It is shown that one-hop movements on the hypercube along the same dimension can be simulated on the POPS(d,g) network in slots for d≠g and in 2 slots ford=g.
References
More filters
Book
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
TL;DR: This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Book
An introduction to parallel algorithms
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.
Book
Introduction to Parallel Algorithms
C. Xavier,S. S. Iyengar +1 more
TL;DR: Algorithms for Parallel Computing: Algebraic Equations and Matrices, Differentiation and Integration, and Tree Algorithms.
Journal ArticleDOI
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
TL;DR: The author, a well-known researcher in paralle l computing, once again has proved his expertise and authority on the materials covered and this book will certainly have an impact to the psychology of students and researchers alike.
Proceedings ArticleDOI
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
R. Cypher,C. G. Plaxton +1 more
TL;DR: A deterministic sorting algorithm, called Sharesort, is presented that sorts n records on an n -processor hypercube, shuffle-exchange, or cube-connected cycles in O (log n (log log n ) 2 ) time in the worst case.