๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal Distributed Algorithms for Sorting and Ranking

โœ Scribed by Zaks, Shmuel

Book ID
114606902
Publisher
IEEE
Year
1985
Tongue
English
Weight
981 KB
Volume
C-34
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tuning distributed control algorithms fo
Tuning distributed control algorithms for optimal functioning
โœ Marc Bui ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer US ๐ŸŒ English โš– 808 KB

In this paper, we present a model which characterizes distributed computing algorithms. The goals of this model are to offer an abstract representation of asynchronous and heterogeneous distributed systems, to present a mechanism for specifying externally observable behaviours of distributed process

A time-optimal distributed sorting algor
A time-optimal distributed sorting algorithm on a line network
โœ Atsushi Sasaki ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

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