Tournament based task allocation in a parallel MIS algorithm

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2014

Author dc:creator

• Ezeaka, Chidubem L

Advisor dc:contributor.advisor

• Nir Shavit.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/91440

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/91440