Tournament based task allocation in a parallel MIS algorithm
Name
893675600-MIT.pdf
Description
Full printable version
Size
1.03 MB
Format
Adobe PDF
Checksum (MD5)
803b2835f1078dd430950fbfa53699c7
Author(s)
Ezeaka, Chidubem L
Advisor(s)
Nir Shavit.
Date Issued
2014
Publisher
Massachusetts Institute of Technology
Abstract
This paper explores the use of a tournament data structure for task allocation and dependency tracking in a parallel Maximal Independent Set (MIS) algorithm as a way to reduce contention in counter updates and improve runtime. The tournament data structure adds a noticeable overhead to the algorithm that causes T time of the algorithm to increase but then there is a steady improvement in performance as we increase the number of worker threads. Running the tournament algorithm with 12 threads in our experimental setup, we are able to get an average speedup of 1.13 for our test suite of 7 real-world graphs.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
2
Cataloged from PDF version of thesis.
Includes bibliographical references (page 16).
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
