Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!iuvax!rutgers!gatech!hubcap!Mike
From: macg%alberta.uucp@RELAY.CS.NET (Mike MacGregor)
Newsgroups: comp.parallel
Subject: Re: Information needed on parallel heaps
Message-ID: <3599@hubcap.UUCP>
Date: 21 Nov 88 00:06:06 GMT
Sender: fpst@hubcap.UUCP
Lines: 17
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.

Try looking at Douglas Jones' remarks on top-down skew heaps and splay trees
in "An Empirical Comparison of Priority-Queue and Event-Set Implementations",
Comm. ACM, Vol. 29, #4, Pp. 300-311, April, 1986.

Regards,
Mike

uucp: macg@alberta   analog: (403)432-3978   Mike MacGregor, Dept of Comp. Sci.
ean:  macg@pembina.alberta.cdn               U of Alberta, Edmonton AB, T6G 2H1
               Our universe: The original "one size fits all".