Managing large graphs on multi-cores with graph awareness

Proceedings of the 2012 USENIX Annual Technical Conference, USENIX ATC 2012

Volumn , Issue , 2019, Pages 41-52

  Prabhakaran, Vijayan ^a   Wu, Ming ^a   Weng, Xuetian ^a   McSherry, Frank ^a   Zhou, Lidong ^a   Haridasan, Maya ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS;

GRAPH PARTITIONING; INHERENT PARALLELISM; ITERATIVE COMPUTATION; KEY-VALUE STORES; LARGE GRAPHS; MANAGEMENT SYSTEMS; ORDERS OF MAGNITUDE; VERTEX ORDERING;

GRAPH THEORY;

EID: 85077120620     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. BerkeleyDB. http://www.oracle.com/technetwork/database/berkeleydb/ overview/index.html.
2. Clueweb09. http://lemurproject.org/clueweb09/.
3. CodeAnalyst. http://developer.amd.com/tools/codeanalyst/Pages/default.aspx.
4. Hadoop. http://hadoop.apache.org/.
5. METIS. http://glaros.dtc.umn.edu/gkhome/metis/metis/overview.
6. Neo4j. http://neo4j.org.
7. VTune. http://software.intel.com/en-us/articles/intel-vtune-amplifier-xe/.
8. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader. Scalable graph exploration on multicore processors. In Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC'10, pages 1-11, Washington, DC, USA, 2010. IEEE Computer Society.
9. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: fast access to linkage information on the Web. In Proceedings of the 7th international conference on World Wide Web 7, pages 469-477, 1998.
10. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107-117, 1998.
11. G. Cong and K. Makarychev. Optimizing large-scale graph analysis on a multi-threaded, multi-core platform. In IPDPS, pages 688-697, 2011.
12. J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04, pages 137-150, 2004.
13. A. A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan. Clustering techniques for minimizing external path length. In VLDB'96, September 3-6, Mumbai (Bombay), India, pages 342-353, 1996.
14. D. Gregor and A. Lumsdaine. Lifting sequential graph algorithms for distributed-memory parallel computation. In OOPSLA'05, pages 423-437, New York, NY, USA, 2005. ACM.
15. D. Gregor and A. Lumsdaine. The parallel bgl: A generic library for distributed graph computations. In In Parallel Object-Oriented Scientific Computing (POOSC'05), 2005.
16. S. Hong, T. Oguntebi, and K. Olukotun. Efficient parallel graph exploration on multi-core cpu and gpu. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, PACT'11, pages 78-88, 2011.
17. Imranul Hoque and Indranil Gupta. Social Network-Aware Disk Management. Technical report, University of Illinois at Urbana-Champaign, 2010-12-03.
18. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20:359-392, December 1998.
19. G. Karypis, V. Kumar, and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48:96-129, 1998.
20. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. Hellerstein. GraphLab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence, 2010.
21. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD'10, pages 135-146, New York, NY, USA, 2010. ACM.
22. Y. Mao, E. Kohler, and R. T. Morris. Cache craftiness for fast multicore key-value storage. In EuroSys'12, Bern, Switzerland, pages 183-196, 2012.
23. F. McSherry, R. Isaacs, M. Isard, and D. G. Murray. Naiad: The animating spirit of rivers and streams. Poster Session of Symposium on Operating Systems Principles (SOSP'11), 2011.
24. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, IMC'07, pages 29-42, New York, NY, USA, 2007. ACM.
25. M. Najork. The scalable hyperlink store. In Proceedings of the 20th ACM conference on Hypertext and Hypermedia, pages 89-98, 2009.
26. J. Nelson, B. Myers, A. H. Hunter, P. Briggs, L. Ceze, C. Ebeling, D. Grossman, S. Kahan, and M. Oskin. Crunching large graphs with commodity processors. In Proceedings of the 3rd USENIX conference on Hot topic in parallelism, HotPar'11, pages 10-10, Berkeley, CA, USA, 2011. USENIX Association.
27. J. M. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez. The Little Engine(s) That Could: Scaling Online Social Networks. In SIGCOMM'10, New Delhi, India, Aug. 2010.
28. C. Ranger, R. Raghuraman, A. Penmetsa, G. Bradski, and C. Kozyrakis. Evaluating mapreduce for multi-core and multiprocessor systems. In HPCA'07, pages 13-24. IEEE Computer Society, 2007.
29. D. A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. In FOCS, pages 96-105, 1996.
30. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33:103-111, August 1990.
31. G. Weikum and G. Vossen. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, 2009.
32. Y. Yu, M. Isard, D. Fetterly, M. Budiu, U. Erlingsson, P. K. Gunda, and J. Currey. DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language. In OSDI'08, San Diego, California, pages 1-14, 2008.