2026-09-18T21:45:44Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/998672022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Nir Shavit. Coulombe, Michael Joseph Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2015-11-09T19:54:08Z 2015-11-09T19:54:08Z 2015 2015 http://hdl.handle.net/1721.1/99867 928028323 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). 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. by Michael Joseph Coulombe. S.M. 63 pages eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. MergeArray and scalable, relaxed, concurrent, mergeable priority queues Merge array and scalable, relaxed, concurrent, mergeable priority queues MergeArray and scalable, concurrent, relaxed, mergeable priority queues Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="48c7c3b0-78c9-40ed-b402-9c718a344fbb"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>MergeArray and scalable, relaxed, concurrent, mergeable priority queues</Title> <Subtitle>Merge array and scalable, relaxed, concurrent, mergeable priority queues</Subtitle> <Subtitle>MergeArray and scalable, concurrent, relaxed, mergeable priority queues</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2015</PublicationDate> <Authors> <Author> <DisplayName>Coulombe, Michael Joseph</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>