Path: utzoo!attcan!uunet!husc6!bloom-beacon!gatech!hubcap!Chet
From: ucdavis!csusac!polyslo!cerez@UCBVAX.BERKELEY.EDU (Chet Erez)
Newsgroups: comp.parallel
Subject: Information needed on parallel heaps
Message-ID: <3538@hubcap.UUCP>
Date: 14 Nov 88 13:42:35 GMT
Sender: fpst@hubcap.UUCP
Lines: 14
Approved: parallel@hubcap.clemson.edu

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
structure with a head for each processor.  Please e-mail me either
information on the proper implementation or what papers and books I 
should be trying to find.  In case it is useful, I am programming in
C on a Sequent Balance machine.
                                         Thanks in advance,
-- 
                                          Chet Erez
                                          DOSiple of St. $ilicon
Internet: cerez@polyslo.CalPoly.EDU       "Has your data been saved?"
UUCP: {csun, voder, trwind}!polyslo!cerez