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

Analysing a class of distributive partitioning sort algorithms

โœ Scribed by M. van der Nat; A.A. Verrijn-Stuart

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
539 KB
Volume
7
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A class of dynamic rough partitive algor
A class of dynamic rough partitive algorithms
โœ Georg Peters; Richard Weber ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB

Partitive algorithms, like cluster algorithms, are frequently used methods in data mining. Most of them are static in the sense that they detect pattern in stable data structures, i.e. the data structure remains unchanged over time. However, many real-life situations are characterized by changing da

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