We present a randomized selection algorithm whose performance is analyzed in an architecture independent way on the bulk-synchronous parallel (BSP) model of computation along with an application of this algorithm to dynamic data structures, namely parallel priority queues. We show that our algorithm
โฆ LIBER โฆ
Many-Sources Delay Asymptotics with Applications to Priority Queues
โ Scribed by Sanjay Shakkottai; R. Srikant
- Book ID
- 110316240
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Weight
- 144 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0257-0130
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Architecture independent parallel select
โ
Alexandros V. Gerbessiotis; Constantinos J. Siniolakis
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 344 KB
Optimal control of finite source priorit
โ
D. Asztalos
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 618 KB
Structured priority queueing systems wit
โ
Moshe Sidi; Adrian Segall
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 577 KB
Two-level heaps: a new priority queue st
โ
K. Subramani; Kamesh Madduri
๐
Article
๐
2010
๐
Springer Vienna
๐
English
โ 822 KB
Application of the many sources asymptot
โ
Costas Courcoubetis; Vasilios A. Siris; George D. Stamoulis
๐
Article
๐
1999
๐
Springer US
๐
English
โ 342 KB
Amortization Results for Chromatic Searc
โ
Joan Boyar; Rolf Fagerberg; Kim S Larsen
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 396 KB
The intention in designing data structures with relaxed balance, such as chromatic search trees, is to facilitate fast updating on shared-memory asynchronous parallel architectures. To obtain this, the updating and rebalancing have been uncoupled, so extensive locking in connection with updates is a