Parallel priority queue and list contraction: The BSP approach
UNSPECIFIED. (2002) Parallel priority queue and list contraction: The BSP approach. COMPUTING AND INFORMATICS, 21 (1). pp. 59-90. ISSN 1335-9150Full text not available from this repository.
In this work we present efficient and practical randomized data structures on the Bulk-Synchronous Parallel (BSP) model of computation along with all experimental study of their performance. In particular, we study data structures for the realization of Parallel Priority Queues, (PPQs). We show that our algorithms are communication efficient and achieve optimality to within small multiplicative constant factors for a wide range of parallel machines. We also present an experimental ;study of our PPQ algorithms oil a Cray T3D. Finally, we present new randomized and deterministic BSP algorithms for list and tree contraction.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||COMPUTING AND INFORMATICS|
|Publisher:||SLOVAK ACADEMY SCIENCES INST INFORMATICS|
|Number of Pages:||32|
|Page Range:||pp. 59-90|
Actions (login required)