MergeArray and scalable, relaxed, concurrent, mergeable priority queues
Name
928028323-MIT.pdf
Description
Full printable version
Size
11.14 MB
Format
Adobe PDF
Checksum (MD5)
ce25c3ddb527c5f222afe6518f44ae5a
Author(s)
Coulombe, Michael Joseph
Advisor(s)
Nir Shavit.
Alternative Title
Merge array and scalable, relaxed, concurrent, mergeable priority queues
MergeArray and scalable, concurrent, relaxed, mergeable priority queues
Date Issued
2015
Publisher
Massachusetts Institute of Technology
Abstract
The priority queue is a well-studied data structure which has prospered in the ever-growing field of distributed computing. However, in the asynchronous shared-memory model, one operation was left behind: merge. I present the MergeArray, a framework for implementing scalable, relaxed, concurrent, and mergeable objects, which exploits disjoint access parallelism by using an array of sequential objects and performs merges lazily, index-by-index. I use MergeArray to build a linearizable and scalable priority queue with lock-free merge and insert and a relaxed, deadlock-free remove-min with expected worst-case rank-error of O(plogp) for p threads under common assumptions. I show experimental evidence that supports this rank-error estimate in practice as well as increased performance and scalability on a relaxed Minimum Spanning Tree benchmark compared to SprayList, a cutting-edge relaxed priority queue.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Title as it appears in MIT Commencement Exercises program, June 5, 2015: MergeArray and scalable, concurrent, relaxed, mergeable priority queues. Cataloged from PDF version of thesis.
Includes bibliographical references (pages 62-63).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
