Architecture independent parallel selection with applications to parallel priority queues

✍ Scribed by Alexandros V. Gerbessiotis; Constantinos J. Siniolakis

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 344 KB
• Volume: 301
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(02)00572-8

✦ Synopsis

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 algorithms improve previous results upon both the communication requirements and the amount of parallel slack required to achieve optimal performance. We also establish that optimality to within small multiplicative constant factors can be achieved for a wide range of parallel machines. While these algorithms are fairly simple themselves, descriptions of their performance in terms of the BSP parameters is somewhat involved; the main reward of quantifying these complications is that it allows transportable software to be written for parallel machines that ÿt the model.