Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ukma!gatech!hubcap!dfk
From: dfk@romeo.cs.duke.edu (David F. Kotz)
Newsgroups: comp.parallel
Subject: Re: Information needed on parallel heaps
Summary: concurrent heaps
Message-ID: <3594@hubcap.UUCP>
Date: 20 Nov 88 23:58:21 GMT
Sender: fpst@hubcap.UUCP
Lines: 24
Approved: parallel@hubcap.clemson.edu

In article <3538@hubcap.UUCP>, ucdavis!csusac!polyslo!cerez@UCBVAX.BERKELEY.EDU (Chet Erez) writes:
> I am looking for information regarding a parallel priority data
> structure.

The best version I know of is a paper by Rao and Kumar. They refer to
a paper by Biswas and Brown that has an earlier algorithm that does
not perform as well and is much harder to code. 

@inproceedings {rao:priority,
	   author = "V. Nageshwara Rao and Vipin Kumar",
	   title = "Concurrent Access of Priority Queues",
	   booktitle = icpp88,
	   volume = 3,
	   year = 1988,
	   pages = "207--211"
}

icpp88 = ICPP '88 is the International Conference on Parallel Processing.

David Kotz
Department of Computer Science, Duke University, Durham, NC 27706
ARPA:	dfk@cs.duke.edu
CSNET:	dfk@duke        
UUCP:	decvax!duke!dfk