skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Distributed-Memory Fast Maximal Independent Set

Abstract

The Maximal Independent Set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of MIS problems suggests the use of distributed-memory hardware as a cost-effective approach to providing necessary compute and memory resources. Luby proposed four randomized algorithms to solve the MIS problem. All those algorithms are designed focusing on shared-memory machines and are analyzed using the PRAM model. These algorithms do not have direct efficient distributed-memory implementations. In this paper, we extend two of Luby’s seminal MIS algorithms, “Luby(A)” and “Luby(B),” to distributed-memory execution, and we evaluate their performance. We compare our results with the “Filtered MIS” implementation in the Combinatorial BLAS library for two types of synthetic graph inputs.

Authors:
; ;
Publication Date:
Research Org.:
Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1434878
Report Number(s):
PNNL-SA-129122
453040135
DOE Contract Number:  
AC05-76RL01830
Resource Type:
Conference
Resource Relation:
Conference: IEEE High Performance Extreme Computing Conference (HPEC 2017), September 12-14, 2017, Waltham, Massachusetts, 1-7
Country of Publication:
United States
Language:
English
Subject:
distributed memory parallel; Maximal Independent Set

Citation Formats

Kanewala Appuhamilage, Thejaka Amila J., Zalewski, Marcin J., and Lumsdaine, Andrew. Distributed-Memory Fast Maximal Independent Set. United States: N. p., 2017. Web. doi:10.1109/HPEC.2017.8091032.
Kanewala Appuhamilage, Thejaka Amila J., Zalewski, Marcin J., & Lumsdaine, Andrew. Distributed-Memory Fast Maximal Independent Set. United States. doi:10.1109/HPEC.2017.8091032.
Kanewala Appuhamilage, Thejaka Amila J., Zalewski, Marcin J., and Lumsdaine, Andrew. Wed . "Distributed-Memory Fast Maximal Independent Set". United States. doi:10.1109/HPEC.2017.8091032.
@article{osti_1434878,
title = {Distributed-Memory Fast Maximal Independent Set},
author = {Kanewala Appuhamilage, Thejaka Amila J. and Zalewski, Marcin J. and Lumsdaine, Andrew},
abstractNote = {The Maximal Independent Set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of MIS problems suggests the use of distributed-memory hardware as a cost-effective approach to providing necessary compute and memory resources. Luby proposed four randomized algorithms to solve the MIS problem. All those algorithms are designed focusing on shared-memory machines and are analyzed using the PRAM model. These algorithms do not have direct efficient distributed-memory implementations. In this paper, we extend two of Luby’s seminal MIS algorithms, “Luby(A)” and “Luby(B),” to distributed-memory execution, and we evaluate their performance. We compare our results with the “Filtered MIS” implementation in the Combinatorial BLAS library for two types of synthetic graph inputs.},
doi = {10.1109/HPEC.2017.8091032},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Wed Sep 13 00:00:00 EDT 2017},
month = {Wed Sep 13 00:00:00 EDT 2017}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: