The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
PowerLyra: differentiated graph computation and partitioning on skewed graphs
Abstract
Natural graphs with skewed distribution raise unique challenges to graph computation and partitioning. Existing graph-parallel systems usually use a "one size fits all" design that uniformly processes all vertices, which either suffer from notable load imbalance and high contention for high-degree vertices (e.g., Pregel and GraphLab), or incur high communication cost and memory consumption even for low-degree vertices (e.g., PowerGraph and GraphX).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · UC Berkeley · Cited by 4,891
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Distributed GraphLab: a framework for machine learning and data mining in the cloud
Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., & Hellerstein, J. M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212354 · Cited by 1,653
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Zhou, Y., Wilkinson, D., Schreiber, R., & Pan, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68880-8_32 · Cited by 700
X-Stream: edge-centric graph processing using streaming partitions
Roy, A., Mihailovic, I., & Zwaenepoel, W. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522740 · Cited by 673
Naiad: a timely dataflow system
Murray, D. G., McSherry, F., Isaacs, R., Isard, M., Barham, P., & Abadi, M. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522738 · Cited by 656
Scalable Collaborative Filtering Approaches for Large Recommender Systems
Takács, G., Pilászy, I., Németh, B., & Tikk, D. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577091 · Cited by 590
A lightweight infrastructure for graph analytics
Nguyen, D., Lenharth, A., & Pingali, K. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522739 · Cited by 579
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
GPS: a graph processing system
Salihoglu, S., & Widom, J. (2013) · Proceedings of the 25th International Conference on Scientific and Statistical Database Management · doi:10.1145/2484838.2484843 · Cited by 510
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
Streaming graph partitioning for large distributed graphs
Stanton, I., & Kliot, G. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339722 · Cited by 446
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
The Combinatorial BLAS: design, implementation, and applications
Buluç, A., & Gilbert, J. R. (2011) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342011403516 · Cited by 415
An architecture for parallel topic models
Smola, A., & Narayanamurthy, S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920931 · Cited by 399
From "think like a vertex" to "think like a graph"
Tian, Y., Balmin, A., Corsten, S. A., Tatikonda, S., & McPherson, J. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732232.2732238 · Cited by 352
On compressing social networks
Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., & Raghavan, P. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557049 · Cited by 349
FENNEL: streaming graph partitioning for massive scale graphs
Tsourakakis, C., Gkantsidis, C., Radunovic, B., & Vojnovic, M. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556213 · Cited by 341
Stochastic gradient boosted distributed decision trees
Ye, J., Chow, J.-H., Chen, J., & Zheng, Z. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646301 · Cited by 324
PLANET: massively parallel learning of tree ensembles with MapReduce
Panda, B., Herbach, J. S., Basu, S., & Bayardo, R. J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687569 · Cited by 267
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., & Catalyurek, U. (2005) · ACM/IEEE SC 2005 Conference (SC'05) · doi:10.1109/sc.2005.4 · Cited by 261
Kineograph: taking the pulse of a fast-changing and connected world
Cheng, R., Hong, J., Kyrola, A., Miao, Y., Weng, X., Wu, M., Yang, F., Zhou, L., Zhao, F., & Chen, E. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168846 · Cited by 247
Sharing graphs using differentially private graph models
Sala, A., Zhao, X., Wilson, C., Zheng, H., & Zhao, B. Y. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068825 · Cited by 240
Distributed Power-law Graph Computing: Theoretical and Empirical Analysis
Xie, C., Yan, L., Li, W.-J., & Zhang, Z. (2014) · neural information processing systems · Cited by 177
Measurement-calibrated graph models for social network experiments
Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., & Zhao, B. Y. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772778 · Cited by 171
NUMA-aware graph-structured analytics
Zhang, K., Chen, R., & Chen, H. (2015) · Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688507 · Cited by 169
Self-citationChronos: a graph engine for temporal graph analysis
Han, W., Miao, Y., Li, K., Wu, M., Yang, F., Zhou, L., Prabhakaran, V., Chen, W., & Chen, E. (2014) · Proceedings of the Ninth European Conference on Computer Systems · doi:10.1145/2592798.2592799 · Cited by 161
HADI: Mining Radii of Large Graphs
Kang, U., Tsourakakis, C. E., Appel, A. P., Faloutsos, C., & Leskovec, J. (2011) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1921632.1921634 · Cited by 146
Distributed socialite: a datalog-based language for large-scale graph analysis
Seo, J., Park, J., Shin, J., & Lam, M. S. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2556549.2556572 · Cited by 137
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
Çatalyürek, Ü. V., Aykanat, C., & Uçar, B. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/080737770 · Cited by 127
SYNC or ASYNC: time to fuse for distributed graph-parallel computation
Xie, C., Chen, R., Guan, H., Zang, B., & Chen, H. (2015) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688508 · Cited by 116
Self-citationLFGraph: simple and fast distributed graph analytics
Hoque, I., & Gupta, I. (2013) · doi:10.1145/2524211.2524218 · Cited by 63
Computation and communication efficient graph processing with distributed immutable view
Chen, R., Ding, X., Wang, P., Chen, H., Zang, B., & Guan, H. (2014) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/2600212.2600233 · Cited by 61
Self-citationReplication-Based Fault-Tolerance for Large-Scale Graph Processing
Wang, P., Zhang, K., Chen, R., Chen, H., & Guan, H. (2014) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2014.58 · Cited by 52
Self-citationOn the embeddability of random walk distances
Zhao, X., Chang, A., Sarma, A. D., Zheng, H.-T., & Zhao, B. Y. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2556549.2556554 · Cited by 42
Replication-Based Fault-Tolerance for Large-Scale Graph Processing
Chen, R., Yao, Y., Wang, P., Zhang, K., Wang, Z., Guan, H., Zang, B., & Chen, H. (2017) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2017.2703904 · Cited by 19
Self-citation(2002)
Cited by
GraphR: Accelerating Graph Processing Using ReRAM
Song, L., Zhuo, Y., Qian, X., Li, H., & Chen, Y. (2018) · 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2018.00052 · Cited by 295
Self-citationMcCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294
Metadata
- Authors
- Chen, R., Shi, J., Chen, Y., & Chen, H.
- Venue
- Proceedings of the Tenth European Conference on Computer Systems
- Publisher
- ACM
- Published
- 2015-04-17
- Pages
- 1-15
- OpenAlex
- W1986603225
- Cited by
- 299
- References
- 47
- FWCI
- 21.34
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.