Istituto di Scienza e Tecnologie dell'Informazione     
Pinotti M. C., Pucci G. Heap : parallel implementation of priority queues. Internal note IEI-B4-04, 1992.
An implementation of PQ on the EREW-PRAM model of computation based on the traditional binary heap organization is presented. Parallel algorithms for insertion, deletion and construction are devised, which achieve optimal paralle time for a particular range of the number of the processors. These results are obtained by means of some auxiliary structures associated with the heap organization. The overall space requirement is always bounded by Θ(n).
Subject Data structures
Parallel algorithms
Analysis of algorithms

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional