1 |
Dutt S . New faster kernighan-lin-type graph-partitioning algorithms. IEEE/ACM International Conference on IEEE, Santa Clara, CA, USA, 1993: 370~377
|
2 |
Fiduccia C M , Mattheyses R M . A linear-time heuristic for improving network partitions. 19th Conference on IEEE, Las Vegas, NV, USA, 1982: 175~181
|
3 |
Pothen A , Simon H D , Liou K P . Partitioning sparse matrices with eigenvectors of graphs. IAM Journal on Matrix Analysis and Applications, 1990, 11 (3): 430~452
|
4 |
Karypis G , Kumar V . A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing, 1998,20 (1): 359~392
|
5 |
周爽, 鲍玉斌, 王志刚 等. BHP:面向BSP 模型的负载均衡Hash图数据划分. 计算机科学与探索, 2014,8(1): 40~50
|
6 |
Kalnis P , Khayyat Z , Awara K ,et al. Mizan:optimizing graph mining in large parallel systems.
|
7 |
Ugander J , Backstrom L . Balanced label propagation for partitioning massive graphs. Proceedings of the sixth ACM International Conference on Web Search and Data Mining. ACM, Rome, Italy, 2013: 507~516.
|
8 |
Khayyat Z , Awara K , Alonazi A , et al. Mizan: a system for dynamic load balancing in large-scale graph processing. Proceedings of the 8th ACM European Conference on Computer Systems, Prague, Czech Republic, 2013
|
9 |
Vaquero L , Cuadrado F , Logothetis D ,et al. xdgp: a dynamic graph processing system with adaptive partitioning.
|
10 |
Tsourakakis C E , Gkantsidis C , Radunovic B , et al. Fennel:Streaming Graph Partitioning for Massive Scale Graphs. Microsoft Technical Report MSR-TR-2012-113, 2012
|
11 |
Karypis G , Kumar V . Metis-unstructured graph partitioning and sparse matrix ordering system,version 2.0.
|
12 |
Stanton I, , Kliot G . Streaming graph partitioning for large distributed graphs. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China , 2012
|
13 |
Dean J , Ghemawat S . MapReduce: simplified data processing on large clusters. Communications of the ACM, 2008, 51(1): 107~113
|
14 |
White T . Hadoop:The Definitive Guide. OˊReilly Media,Inc, 2012
|
15 |
Condie T , Conway N , Alvaro P ,et al. MapReduce Online. NSDI 2010, San Jose, USA, 2010
|
16 |
Bu Y , Howe B , Balazinska M . et al. HaLoop: efficient iterative data processing on large clusters. Proceedings of the VLDB Endowment, 20103(1-2): 285~296
|
17 |
Ekanayake J , Li H , Zhang B , et al. Twister: a runtime for iterative MapReduce. Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, New York, NY, USA , 2010
|
18 |
Zhang Y , Gao Q , Gao L , et al. Priter: a distributed framework for prioritized iterative computations. Proceedings of the 2nd ACM Symposium on Cloud Computing, San Jose, USA , 2011
|
19 |
Valiant L G . A bridging model for parallel computation. Communications of the ACM, 199033 (8): 103~111.
|
20 |
Malewicz G , Austern M H , Bik A J C ,et al. Pregel: a system for large-scale graph processing. Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, Snowbird, UT, USA , 2010: 135~146
|
21 |
Avery C . Giraph: large-scale graph processing infrastructure on Hadoop. Proceedings of the Hadoop Summit, Santa Clara, USA, 2011
|
22 |
Boyd S P , Vandenberghe L . Vandenberghe L. Cambridge: Cambridge University Press , 2004
|
23 |
Salihoglu S , Widom J . GPS: A Graph Processing System. Stanford University
|
24 |
Bao N T , Suzumura T . Towards highly scalable pregel-based graph processing platform with x10. Proceedings of the 22nd International Conference on World Wide Web Companion, International World Wide Web Conferences Steering Committee, Seoul, Korea, 2013: 501~508
|