Parallel Priorities: Optimizing Priority Queues for NUMA Machines
Umberto Mazziotta
Download PDF
Abstract:
This thesis is organized as follows. In the next chapter we make an overview of the main covered concepts, and we describe the Conflict Resilient Calendar Queue, which is the priority queue we used as starting point for our solutions. Then, we provide different solutions to optimize the priority queue, showing also the results obtained in the performance evaluation, and the results against similar approaches that are found in literature. Finally, we conclude with some remarks on the work done, and other possible steps that can be done toward a further improvement of these solutions.
BibTeX Entry:
@mastersthesis{tMazz20,
author = {Mazziotta, Umberto},
school = {Sapienza, University of Rome},
title = {Parallel Priorities: Optimizing Priority Queues for NUMA Machines},
year = {2020},
month = jan,
type = {mathesis},
comment = {Supervisor: A. Pellegrini - Co-Supervisor: R. Marotta}
}
author = {Mazziotta, Umberto},
school = {Sapienza, University of Rome},
title = {Parallel Priorities: Optimizing Priority Queues for NUMA Machines},
year = {2020},
month = jan,
type = {mathesis},
comment = {Supervisor: A. Pellegrini - Co-Supervisor: R. Marotta}
}