It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network

Authors:
Sanpawat Kantabutra;Wattana Jindaluang;Prapaporn Techa-angkoon
Affiliations:
The Theory of Computation Group, Computer Science Department, Chiang Mai University, Chiang Mai, Thailand;The Theory of Computation Group, Computer Science Department, Chiang Mai University, Chiang Mai, Thailand;The Theory of Computation Group, Computer Science Department, Chiang Mai University, Chiang Mai, Thailand
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 19
Cited 0

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Performance evaluation of LAN sorting algorithms

SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An Analytic/Empirical Study of Distributed Sorting on a Local Area Network

IEEE Transactions on Software Engineering
Introduction to algorithms

Introduction to algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel Quicksort in hypercubes

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Sorting with Linear Speedup on a Pipelined Hypercube

IEEE Transactions on Computers
On Crossbar Switch and Multiple Bus Interconnection Networks with Overlapping Connectivity

IEEE Transactions on Computers
Reflective interconnection networks

Computers and Electrical Engineering
Dynamic load-balancing of image processing applications on clusters of workstations

Parallel Computing
High-performance sorting on networks of workstations

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A sorting algorithm on a PC cluster

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
A time-optimal distributed sorting algorithm on a line network

Information Processing Letters
A Case for NOW (Networks of Workstations)

IEEE Micro
Balanced Parallel Sort on Hypercube Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer

IEEE Transactions on Parallel and Distributed Systems
Experiments with Scheduling Divisible Tasks in Clusters of Workstations

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Bitonic Sort on a Mesh-Connected Parallel Computer

IEEE Transactions on Computers
Systolic Sorting on a Mesh-Connected Network

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several parallel architectures exist in computer science literature. Motivated by the experimental overlapping connectivity network, we propose a new theoretical network called a completely overlapping network (CON). This network is an extension of the overlapping connectivity network with multiple buses. In this paper we investigate some properties of this network and demonstrate the use of CON and its usefulness by solving two toy problems: decimal number and one-digit binary number sortings.