We consider the problems of selection, routing, and sorting on an n-star graph (with n! nodes), an interconnection network which has been proven to possess many special properties. We identify a tree like subgraph (which we call a "(k, 1, k) chain network") of the star graph which enables us to desi
Analytic variations on bucket selection and sorting
✍ Scribed by Hosam Mahmoud; Philippe Flajolet; Philippe Jacquet; Mireille Régnier
- Publisher
- Springer-Verlag
- Year
- 2000
- Tongue
- English
- Weight
- 200 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
rithm given by Cole [3] runs in O(log n log\* n) time on an EREW PRAM and in O(log n log\* n/log log n) time on a CRCW PRAM. Both algorithms perform O(n) operations. However, not much work has been done on parallel algorithms for constrained selection. The sequential algorithm in [5] is parallelizab
In the past few years, there has been considerable interest in general purpose computational models of parallel computation to enable independent development of hardware and software. The BSP and related models represent an important step in this direction, providing a simple view of a parallel mach