repository
대규모 그래프 처리를 위한 Label-Propagation 기반 병렬 그래프 파티션 기법
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 오상윤 | - |
| dc.contributor.author | 배민호 | - |
| dc.date.accessioned | 2019-08-13T16:41:29Z | - |
| dc.date.available | 2019-08-13T16:41:29Z | - |
| dc.date.issued | 2019-08 | - |
| dc.identifier.other | 29211 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/15614 | - |
| dc.description | 학위논문(박사)--아주대학교 일반대학원 :컴퓨터공학과,2019. 8 | - |
| dc.description.tableofcontents | I Introduction 1 A. Motivation 1 B. Thesis Contribution 8 C. Thesis Outline 10 II Background and Related Work 11 A. Background 11 1. Categories of Graph Partitioning 11 2. Distributed Graph Processing Frameworks 16 B. Related Work 22 1. Heuristic Approaches 22 2. Multilevel Approach 31 3. State-of-the-Art Graph-Partitioning Algorithms 36 III Proposed Graph-Partitioning Algorithm 38 IV Parallel Graph-Partitioning Process 45 A. Data Structure 45 B. Parallel Graph-Partitioning Algorithm 51 1. Quick-Converging Label Propagation 51 2. Stabilization Process 62 3. Size-Constrained Partition 72 V Experiment 74 A. Experimental Environment 75 B. Comparison with Other Systems 78 1. Balance Ratio 78 2. Performance of graph partitioning 81 3. Edge-cut Result 87 C. Strong Scaling 92 VI Conclusion 94 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | 대규모 그래프 처리를 위한 Label-Propagation 기반 병렬 그래프 파티션 기법 | - |
| dc.title.alternative | Minho Bae | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.alternativeName | Minho Bae | - |
| dc.contributor.department | 일반대학원 컴퓨터공학과 | - |
| dc.date.awarded | 2019. 8 | - |
| dc.description.degree | Doctoral | - |
| dc.identifier.localId | 951967 | - |
| dc.identifier.uci | I804:41038-000000029211 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/common/orgView/000000029211 | - |
| dc.description.alternativeAbstract | The increasing importance of graph data in various fields makes the efficient processing of large-scale graph data highly necessary where well-balanced graph partitioning is a vital component of parallel/distributed graph processing. The goal of graph partitioning is to obtain a well-balanced graph topology that balances the size of each partition while reducing the number of edge-cuts. Moreover, the graph partitioning algorithm should achieve high performance and scalability. In this paper, we present a novel graph-partitioning algorithm that ensures low edge-cuts and high-performance processing capability for parallel processing. Based on the label propagation algorithm, we propose the formulas to improve the degree of edge-cuts and to achieve fast convergence. By removing the necessity of processing the label propagation for all nodes, our approach processes the label propagation of candidate nodes based on a proposed score metric. Our proposed algorithm introduces a stabilization phase in which remote and highly connected nodes are relocated to avoid the algorithm becoming trapped around local optima. Comparison results show that a prototype based on the proposed algorithm outperforms other well-known parallel graph-partitioning frameworks in terms of speed and balance. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Computer Engineering > 4. Theses(Ph.D)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,780,840
- Total Download :1,819
- Today View :2,277
