A Loosely Coordinated Model for Heap-Based Priority Queues in Multicore Environments

Abstract

Heap-based priority queues are very common dynamical data structures used in several fields, ranging from operating systems to scientific applications. However, the rise of new multicore CPUs introduced new challenges in the process of design of these data structures: in addition to traditional requirements like correctness and progress, the scalability is… (More)
DOI: 10.1007/s10766-015-0398-x

Topics

6 Figures and Tables

Cite this paper

@article{Laccetti2015ALC, title={A Loosely Coordinated Model for Heap-Based Priority Queues in Multicore Environments}, author={Giuliano Laccetti and Marco Lapegna and Valeria Mele}, journal={International Journal of Parallel Programming}, year={2015}, volume={44}, pages={901-921} }