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).
Heap : parallel implementation of priority queues
1992
Abstract
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).File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_453771-doc_174515.pdf
accesso aperto
Descrizione: Heap : parallel implementation of priority queues
Dimensione
941.22 kB
Formato
Adobe PDF
|
941.22 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
