The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
X-Stream: edge-centric graph processing using streaming partitions
Open accessAbstract
X-Stream is a system for processing both in-memory and out-of-core graphs on a single shared-memory machine. While retaining the scatter-gather programming model with state stored in the vertices, X-Stream is novel in (i) using an edge-centric rather than a vertex-centric implementation of this model, and (ii) streaming completely unordered edge lists rather than performing random access. This design is motivated by the fact that sequential bandwidth for all storage media (main memory, SSD, and magnetic disk) is substantially larger than random access bandwidth.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
(1999) · Cited by 12,854
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
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
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
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
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019604 · Cited by 1,527
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
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121137 · Cited by 970
Evaluating MapReduce for Multi-core and Multiprocessor Systems
Ranger, C., Raghuraman, R., Penmetsa, A., Bradski, G., & Kozyrakis, C. (2007) · 2007 IEEE 13th International Symposium on High Performance Computer Architecture · doi:10.1109/hpca.2007.346181 · Cited by 966
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
Clearing the clouds: a study of emerging scale-out workloads on modern hardware
Ferdman, M., Adileh, A., Kocberber, O., Volos, S., Alisafaee, M., Jevdjic, D., Kaynak, C., Popescu, A. D., Ailamaki, A., & Falsafi, B. (2012) · Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/2150976.2150982 · Cited by 814
Frigo, M., Leiserson, C. E., Prokop, H., & Ramachandran, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814600 · Cited by 803
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
The Diameter of a Scale-Free Random Graph
Bollob�s*, B., & Riordan, O. (2004) · Combinatorica · doi:10.1007/s00493-004-0002-2 · Cited by 594
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
On graph problems in a semi-streaming model
Joan Feigenbaum, A., Kannan, S., McGregor, A., Suri, S., & Zhang, J. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.013 · Cited by 402
Write amplification analysis in flash-based solid state drives
Hu, X.-Y., Eleftheriou, E., Haas, R., Iliadis, I., & Pletka, R. (2009) · Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference · doi:10.1145/1534530.1534544 · Cited by 313
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
Hong, S., Oguntebi, T., & Olukotun, K. (2011) · 2011 International Conference on Parallel Architectures and Compilation Techniques · doi:10.1109/pact.2011.14 · Cited by 269
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
TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC
Han, W.-S., Lee, S., Park, K., Lee, J.-H., Kim, M.-S., Kim, J., & Yu, H. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487581 · Cited by 259
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
Scalable Graph Exploration on Multicore Processors
Agarwal, V., Petrini, F., Pasetto, D., & Bader, D. A. (2010) · 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2010.46 · Cited by 223
Towards compressing Web graphs
Adler, M., & Mitzenmacher, M. (2002) · Proceedings DCC 2001. Data Compression Conference · doi:10.1109/dcc.2001.917151 · Cited by 223
Algorithms and Data Structures for External Memory
Vitter, J. S. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601981073 · Cited by 172
HyperANF: approximating the neighbourhood function of very large graphs on a budget
Boldi, P., Rosa, M., & Vigna, S. (2011) · International World Wide Web Conference (WWW) · doi:10.1145/1963405.1963493 · Cited by 120
Managing large graphs on multi-cores with graph awareness
Prabhakaran, V., Wu, M., Weng, X., McSherry, F., Zhou, L., & Haridasan, M. (2012) · USENIX Annual Technical Conference · Cited by 94
Four Degrees of SeparationPreprint
Bäckström, L., Boldi, P., Rosa, M., Ugander, J. H., & Vigna, S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.4570 · Cited by 66
Optimal sparse matrix dense vector multiplication in the I/O-model
Bender, M. A., Brodal, G. S., Fagerberg, R., Jacob, R., & Vicari, E. (2007) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1248377.1248391 · Cited by 36
An update-aware storage system for low-locality update-intensive workloads
Simha, D. N., Lu, M., & Chiueh, T. (2012) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2150976.2151016 · Cited by 9
Cited by
PowerLyra: differentiated graph computation and partitioning on skewed graphs
Chen, R., Shi, J., Chen, Y., & Chen, H. (2015) · Proceedings of the Tenth European Conference on Computer Systems · doi:10.1145/2741948.2741970 · Cited by 299
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
McCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294
Graphicionado: A high-performance and energy-efficient accelerator for graph analytics
Ham, T. J., Wu, L., Sundaram, N., Satish, N., & Martonosi, M. (2016) · 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2016.7783759 · Cited by 277
PARTIES: QoS-Aware Resource Partitioning for Multiple Interactive Services
Chen, S., Delimitrou, C., & Martínez, J. F. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304005 · Cited by 267
Metadata
- Authors
- Roy, A., Mihailovic, I., & Zwaenepoel, W.
- Venue
- Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
- Publisher
- ACM
- Published
- 2013-11-03
- Pages
- 472-488
- OpenAlex
- W2053076698
- Cited by
- 673
- References
- 33
- FWCI
- 31.57
- Type
- conference paper
- Language
- en
- Open access
- gold
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.