The complexity of sorting on distributed systems
Information and Control
Distributed sorting algorithms for multi-channel broadcast networks
Theoretical Computer Science
An Analytic/Empirical Study of Distributed Sorting on a Local Area Network
IEEE Transactions on Software Engineering
Science of Computer Programming
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Distributed Algorithms
Reliable Distributed Sorting Through the Application-Oriented Fault Tolerance Paradigm
IEEE Transactions on Parallel and Distributed Systems
On the impact of the migration topology on the Island Model
Parallel Computing
Brief announcement: sorting on skip chains
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.89 |
We have achieved a strict lower time bound of n -1 for distributed sorting on a line network, where n is the number of processes. The lower time bound has traditionally been considered to be n because it is proved based on the number of disjoint comparison-exchange operations in parallel sorting on a linear array. Our result has overthrown the traditional common belief.