Portable Distributed Priority Queues with MPI

Portable Distributed Priority Queues with MPI (1995)

Cached

Download Links

[coral.cs.jcu.edu.au]
[www.cs.jcu.edu.au]

Other Repositories/Bibliography

DBLP

by Bernard Mans , North Queensland

Citations:

9 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Portable Distributed Priority Queues with MPI	user correction - Legacy Corrections
AUTHOR NAME	Bernard Mans	SVM HeaderParse 0.1
AUTHOR AFFIL	JAMES COOK UNIVERSITY	SVM HeaderParse 0.2
AUTHOR NAME	North Queensland	SVM HeaderParse 0.1
AUTHOR AFFIL	; DEPARTMENT OF COMPUTER SCIENCE; TOWNSVILLE; Contact Information Department of Computer Science; James Cook University	SVM HeaderParse 0.2
AUTHOR ADDR	; AUSTRALIA; Townsville, Qld 4811; Australia	SVM HeaderParse 0.1
ABSTRACT	Part of this work has been presented in [17]. This paper analyzes the performances of portable distributed priority queues by examining the theoretical features required and by comparing various implementations. In spite of intrinsic bottlenecks and induced hot-spots, we argue that tree topologies are attractive to manage the natural centralized control required for the deletemin operation in order to detect the site which holds the item with the largest priority. We introduce an original perfect balancing to cope with the load variation due to the priority queue operations which continuously modify the overall number of items in the network. For comparison, we introduce the d-heap and the binomial distributed priority queue. The purpose of this experiment is to convey, through executions on Cray-T3D and MeikoT800, an understanding of the nature of the distributed priority queues, the range of their concurrency and a comparison of their efficiency to reduce requests latency. In particu...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	31 found	ParsCit 1.0