18,372 Hits in 3.9 sec

Streaming Balanced Graph Partitioning Algorithms for Random Graphs [chapter]

Isabelle Stanton
2013 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms  
We give lower bounds on the approximation ratio that any streaming algorithm for balanced graph partitioning can obtain on both a random and adversarial ordering of the graph.  ...  Contributions This paper focuses on developing a rigorous understanding of two greedy streaming balanced graph partitioning algorithms.  ...  The author would also like to thank Anindya De, Gabriel Kliot, Miklos Racz, Satish Rao, Alexandre Stauffer and Ngoc Mai Tran for their helpful discussions.  ... 
doi:10.1137/1.9781611973402.95 dblp:conf/soda/Stanton14 fatcat:52pp4ouqxvhixoussfjqcslcpe

Edge Property Based Stream Order Reduce the Performance of Stream Edge Graph Partition

T Ayall, H Duan, C Liu
2019 Journal of Physics, Conference Series  
stream order on stream edge graph partition algorithms.  ...  Even if the stream edge graph partition has shown better partition quality than vertex graph partition for skew degree distribution of a graph and support big graph partition, the stream order has affected  ...  Algorithm Description The stream edge graph partition categories into three: (i) Hash based: It uses hash value to allocate the incoming edges to the partitions ,For example Hashing and DBH [13] are  ... 
doi:10.1088/1742-6596/1395/1/012010 fatcat:m3iyhpulvfhd3je2g7ljk6w5v4

S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut [article]

Cong Xie, Wu-Jun Li, Zhihua Zhang
2015 arXiv   pre-print
In distributed computation, graph partitioning (GP) methods assign the vertices or edges of a graph to different machines in a balanced way so that some distributed algorithms can be adapted for.  ...  Hence, streaming graph partitioning (SGP) methods, which can partition graphs in an online way, have recently attracted great attention in distributed computation.  ...  Grid GraphBuilder [6] provides a Grid-based Constrained Random Vertex-cut algorithm, which can also be adapted for streaming graph partitioning.  ... 
arXiv:1511.02586v1 fatcat:ahsgyfktmzh63ivzn6o7nggkee

Streaming graph partitioning for large distributed graphs

Isabelle Stanton, Gabriel Kliot
2012 Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12  
Observing that the graph has to be loaded into the cluster, we ask if the partitioning can be done at the same time with a lightweight streaming algorithm.  ...  Using our streaming partitioning methods, we are able to speed up PageRank computations on Spark [32], a distributed computation system, by 18% to 39% for large social networks.  ...  For graph data, this is called balanced graph partitioning.  ... 
doi:10.1145/2339530.2339722 dblp:conf/kdd/StantonK12 fatcat:nqaphisol5bozfusje4zxuqdze

Streaming graph partitioning

Zainab Abbas, Vasiliki Kalavri, Paris Carbone, Vladimir Vlassov
2018 Proceedings of the VLDB Endowment  
Otherwise, model-agnostic techniques trade off data locality for lower partitioning costs and balanced workloads which is beneficial when executing data-parallel single-pass graph algorithms.  ...  Graph partitioning is an essential yet challenging task for massive graph analysis in distributed computing.  ...  HDRF has lower σ using Random order compared to the DFS order.Vertex Partitioning Load Balance. Table6displays results for ρ using vertex partitioning algorithms on different stream orders.  ... 
doi:10.14778/3236187.3236208 fatcat:ehsvpqdykbc35odmga2rcyvlfq

Restreaming graph partitioning

Joel Nishimura, Johan Ugander
2013 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13  
In this work we introduce restreaming graph partitioning and develop algorithms that scale similarly to streaming partitioning algorithms yet empirically perform as well as fully offline algorithms.  ...  In streaming partitioning, graphs are partitioned serially in a single pass.  ...  We thank Jon Kleinberg, Isabel Kloumann, and Justin Vincent for helpful comments. This work was supported in part by NSF grants IIS-0910664 and IIS-1016099.  ... 
doi:10.1145/2487575.2487696 dblp:conf/kdd/NishimuraU13 fatcat:thvj2brvwrggref37q7bguc6by

Prioritized Restreaming Algorithms for Balanced Graph Partitioning [article]

Amel Awadelkarim, Johan Ugander
2020 arXiv   pre-print
Balanced graph partitioning is a critical step for many large-scale distributed computations with relational data.  ...  As graph datasets have grown in size and density, a range of highly-scalable balanced partitioning algorithms have appeared to meet varied demands across different domains.  ...  ACKNOWLEDGMENTS We thank Brian Karrer, Joel Nishimura, Arjun Seshadri, and Hao Yin for helpful comments and discussions.  ... 
arXiv:2007.03131v1 fatcat:plvwrdpgirfpncjfzg5g63u2e4


Fabio Petroni, Leonardo Querzoni, Khuzaima Daudjee, Shahin Kamali, Giorgio Iacoboni
2015 Proceedings of the 24th ACM International on Conference on Information and Knowledge Management - CIKM '15  
In this paper, we propose High-Degree (are) Replicated First (HDRF ), a novel streaming vertex-cut graph partitioning algorithm that effectively exploits skewed degree distributions by explicitly taking  ...  Balanced graph partitioning is a fundamental problem that is receiving growing attention with the emergence of distributed graph-computing (DGC) frameworks.  ...  In this paper, we pro-posed HDRF, a novel stream-based graph partitioning algorithm for distributed graph-computing frameworks.  ... 
doi:10.1145/2806416.2806424 dblp:conf/cikm/PetroniQDKI15 fatcat:msu5mow4nfh7zavfyikn5p5kee

Streaming Balanced Graph Partitioning for Random Graphs [article]

Isabelle Stanton
2012 arXiv   pre-print
We model the problem of loading a graph onto a distributed cluster as computing an approximately balanced k-partitioning of a graph in a streaming fashion with only one pass over the data.  ...  This motivates the need for streaming algorithms that can compute approximate solutions without full random access to all of the data.  ...  One-pass streaming balanced graph partitioning with a random stream order can not be approximated within o(n). Proof. Again, we seek a balanced 2 partition for a cycle graph with a random ordering.  ... 
arXiv:1212.1121v1 fatcat:23q4x5udffexrbjn4yxcseg6oe


Charalampos Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, Milan Vojnovic
2014 Proceedings of the 7th ACM international conference on Web search and data mining - WSDM '14  
In this work, we introduce a unifying framework for graph partitioning which enables a well principled design of scalable, streaming graph partitioning algorithms that are amenable to distributed implementation  ...  For instance, for the Twitter graph with more than 1.4 billion of edges, our method partitions the graph in about 40 minutes achieving a balanced partition that cuts as few as 6.8% of edges, whereas it  ...  Acknowledgements We would like to thank to those who kindly helped us in getting access to some of the graph data that we used for our evaluation, including Nick Craswell, Bodo Billerbeck, Gabriel Kliot  ... 
doi:10.1145/2556195.2556213 dblp:conf/wsdm/TsourakakisGRV14 fatcat:wh5soym5xbfspaobgolmvkktsa

Streaming Min-max Hypergraph Partitioning

Dan Alistarh, Jennifer Iglesias, Milan Vojnovic
2015 Neural Information Processing Systems  
Motivated by scalability requirements, we focus on the class of streaming computation algorithms with memory limited to be at most linear in the number of components.  ...  This is a clustering problem with various applications, e.g. partitioning of a set of information objects such as documents, images, and videos, and load balancing in the context of modern computation  ...  It is also of interest to consider the recovery problem for a wider set of random bipartite graph models.  ... 
dblp:conf/nips/AlistarhIV15 fatcat:273bmgw355fqflviypyyjugoum

Streaming Graph Partitioning in the Planted Partition Model

Charalampos Tsourakakis
2015 Proceedings of the 2015 ACM on Conference on Online Social Networks - COSN '15  
In this work we contribute to the recent research line of streaming graph partitioning [30, 31, 34] which computes an approximately balanced k-partitioning of the vertex set of a graph using a single pass  ...  In this work we introduce the use of higher length walks for streaming graph partitioning and show that their use incurs a minor computational cost which can significantly improve the quality of the graph  ...  Acknowledgements The author would like to thank Professor Alan Frieze and Professor Moez Draief and the anonymous reviewers for their feedback.  ... 
doi:10.1145/2817946.2817950 dblp:conf/cosn/Tsourakakis15 fatcat:y3m4zokqxbfd5chq3dgwd66xr4

Streaming Graph Partitioning in the Planted Partition Model [article]

Charalampos E. Tsourakakis
2014 arXiv   pre-print
In this work we contribute to the recent research line of streaming graph partitioning stantonstreaming,stanton,fennel which computes an approximately balanced k-partitioning of the vertex set of a graph  ...  In this work we introduce the use of higher length walks for streaming graph partitioning and show that their use incurs a minor computational cost which can significantly improve the quality of the graph  ...  Acknowledgements The author would like to thank Alan Frieze and Moez Draief for their feedback on the manuscript.  ... 
arXiv:1406.7570v2 fatcat:imjhgg72xzbyhoi3l2vmp2uz3q

2PS: High-Quality Edge Partitioning with Two-Phase Streaming [article]

Ruben Mayer and Kamil Orujzade and Hans-Arno Jacobsen
2020 arXiv   pre-print
In this paper, we propose 2PS, a novel two-phase streaming algorithm for high-quality edge partitioning.  ...  Streaming is a viable approach to partition graphs that exceed the memory capacities of a single server.  ...  From the group of streaming partitioners, we compare to HDRF [32] , DBH [41] and SNE (a streaming version of the random-access partitioning algorithm NE [43] ).  ... 
arXiv:2001.07086v1 fatcat:unwy5scskbemhgy3wlbjmaulfq


Ning Xu, Lei Chen, Bin Cui
2014 Proceedings of the VLDB Endowment  
In addition, the onepass streaming partitioning result is not always satisfactory for the algorithms' local view of the graph.  ...  LogGP utilizes the historical partitioning results to generate a hyper-graph and uses a novel hyper-graph streaming partitioning approach to generate a better initial streaming graph partitioning result  ...  This result has divided the graph into several partitions generated by the streaming partitioning algorithm. Although not optimized, it provides us a better initial input than random graph.  ... 
doi:10.14778/2733085.2733097 fatcat:cmxl6rr5xffqxk75zx4agws6gu
« Previous Showing results 1 — 15 out of 18,372 results