Journal of Information Processing
Parallelization of Extracting Connected Subgraphs with Common Itemsets in Distributed Memory Environments
Shingo OkunoTasuku HiraishiHiroshi NakashimaMasahiro YasugiJun Sese
Author information
JOURNALS FREE ACCESS

Volume 25 (2017) Pages 256-267

Details
Download PDF (1019K) Contact us
Abstract

This paper proposes a parallel implementation of graph mining that extracts all connected subgraphs with common itemsets, of which the size is not less than a given threshold, from a graph and from itemsets associated with vertices of the graph, in distributed memory environments using the task-parallel language Tascell. With regard to this problem, we have already proposed parallelization of a backtrack search algorithm named COPINE and its implementation in shared memory environments. In this implementation, all workers share a single table, which is controlled by locks, that contains the knowledge acquired during the search to obviate the need for unnecessary searching. This sharing method is not practical in distributed memory environments because it would lead to a drastic increase in the cost of internode communications. Therefore, we implemented a sharing method in which each computing node has a table and sends its updates to the other nodes at regular time intervals. In addition to this, the high task creation cost for COPINE is problematic and thus the conventional work-stealing strategy in Tascell, which aims to minimize the number of internode work-steals, significantly degrades the performance since it increases the number of intranode work-steals for small tasks. We solved this problem by promoting workers to enable them to request tasks from external nodes. We also employed a work-stealing strategy based on estimation of the sizes of tasks created by victim workers. This approach enabled us to achieve good speedup performance with up to 8 nodes × 16 workers.

Information related to the author
© 2017 by the Information Processing Society of Japan
Previous article Next article

Recently visited articles
feedback
Top