Path: utzoo!attcan!uunet!husc6!mailrus!uflorida!gatech!hubcap!kumar
From: kumar@cs.utexas.edu (Vipin Kumar)
Newsgroups: comp.parallel
Subject: Re: Information needed on parallel heaps
Summary: reference on parallel heap
Message-ID: <3617@hubcap.UUCP>
Date: 21 Nov 88 14:31:42 GMT
Sender: fpst@hubcap.UUCP
Lines: 21
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.  It needs to fully utilize a number of processors that is 
> unknown until run time.  I have been unable to find one after checking
> with both my professors and my library.  My current idea is a heap-like

The following papers present a concurrent formulation of heap:

Concurrent Access of Priority Queues.
(by V.N. Rao and Vipin Kumar)
IEEE Transactions on Computers,
Vol 37, Number 12, December 1988.

Concurrent Insertions and Deletions in a Priority Queue.
(by V.N. Rao and Vipin Kumar)
Proc of 1988 International Parallel Processing Conference,
August 1988.


Vipin
-----