An optimal parallel algorithm to construct a deap

DOI10.1080/00207169208804050MaRDI QIDQ3989753zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, Zhaofang Wen

Publication date 28 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169208804050

zbMATH Keywords

CRCW-PRAMdeapdouble-ended priority queueEREW-PRAMheapoptimal algorithms

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Parallel processing of the Build Hull algorithm to address the large-scale DEA problem
• scientific article; zbMATH DE number 2107027
• Parallel algorithm for unconstrained optimization based on decomposition techniques
• An optimal parallel algorithm for the multiselection problem
• scientific article; zbMATH DE number 1294384
• scientific article; zbMATH DE number 3885226
• scientific article; zbMATH DE number 3894470
• Optimal implementation of parallel divide and conquer algorithm on de Bruijn networks
• An optimal parallel connectivity algorithm
• scientific article; zbMATH DE number 4082988

Cites work

• A note on the construction of the data structure ``deap
• An optimally efficient selection algorithm
• Dynamic parallel memories
• Faster optimal parallel prefix sums and list ranking
• scientific article; zbMATH DE number 3848585 (Why is no real title available?)
• scientific article; zbMATH DE number 4213472 (Why is no real title available?)
• scientific article; zbMATH DE number 3633709 (Why is no real title available?)
• Min-max heaps and generalized priority queues
• On the Expected Performance of Scanning Disks
• Priority queue administration by sublist index

Cited in

(4)

• Optimal parallel construction of heaps
• A note on the construction of the data structure ``deap
• The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
• An effective computational attempt in DDEA

This page was built for publication: An optimal parallel algorithm to construct a deap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989753)