A lightweight infrastructure for graph analytics

SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles

Volumn , Issue , 2013, Pages 456-471

  Nguyen, Donald ^a   Lenharth, Andrew ^a   Pingali, Keshav ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN SPECIFIC LANGUAGES; END-TO-END PERFORMANCE; GENERAL PROGRAMMING MODEL; GENERAL SYSTEMS; GRAPH ANALYTICS; ORDERS OF MAGNITUDE; SPECULATIVE EXECUTION; TASK-SCHEDULING;

ALGORITHMS; PROBLEM ORIENTED LANGUAGES;

GRAPHIC METHODS;

EID: 84889648298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2517349.2522739     Document Type: Conference Paper

References (34)

1. E. D. Berger, K. S. McKinley, R. D. Blumofe, and P. R. Wilson. Hoard: a scalable memory allocator for multithreaded applications. SIGPLAN Not., 35(11):117-128, Nov. 2000.
2. D. P. Bertsekas, F. Guerriero, and R. Musmanno. Parallel asynchronous label-correcting methods for shortest paths. J. Optim. Theory Appl., 88(2):297-320, Feb. 1996.
3. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and distributed computation: numerical methods. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989.
4. U. Brandes. A faster algorithm for betweenness centrality. J. Mathematical Sociology, 25(2):163-177, 2001.
5. N. G. Bronson, J. Casper, H. Chafi, and K. Olukotun. A practical concurrent binary search tree. In Proc. ACM SIGPLAN Symp. Principles And Practice of Parallel Programming, PPoPP '10, pages 257-268, 2010.
6. M. Cha, H. Haddadi, F. Benevenuto, and K. P. Gummadi. Measuring user influence in Twitter: The million follower fallacy. In Proc. Intl AAAI Conf. Weblogs and Social Media, ICWSM '10, 2010.
7. K. M. Chandy and J. Misra. The drinking philosophers problem. ACM Trans. Program. Lang. Syst., 6(4):632-646, Oct. 1984.
8. B. Chazelle. The soft heap: an approximate priority queue with optimal error rate. J. ACM, 47(6):1012-1027, Nov. 2000.
9. A. T. Clements, M. F. Kaashoek, and N. Zeldovich. Scalable address spaces using RCU balanced trees. In Proc. Intl Conf. Architectural Support for Programming Languages and Operating Systems, ASPLOS '12, pages 199-210, 2012.
10. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, editors. Introduction to Algorithms. MIT Press, 2001.
11. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: distributed graphparallel computation on natural graphs. In Proc. USENIX Conf. Operating Systems Design and Implementation, OSDI '12, pages 17-30, 2012.
12. S. Hong, H. Chafi, E. Sedlar, and K. Olukotun. Green-Marl: a DSL for easy and efficient graph analysis. In Proc. Intl Conf. Architectural Support for Programming Languages and Operating Systems, ASPLOS '12, pages 349-362, 2012.
13. G. C. Hunt, M. M. Michael, S. Parthasarathy, and M. L. Scott. An efficient algorithm for concurrent priority queue heaps. Inf. Process. Lett., 60:151-157, November 1996.
14. J. JaJa. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
15. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '07, pages 211-222, 2007.
16. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In Proc. Intl Conf. World Wide Web,WWW'10, pages 591-600, 2010.
17. A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: large-scale graph computation on just a PC. In Proc. USENIX Conf. Operating Systems Design and Implementation, OSDI '12, pages 31-46, 2012.
18. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. GraphLab: A new parallel framework for machine learning. In Proc. Conf. Uncertainty in Artificial Intelligence, UAI '10, July 2010.
19. 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 Proc. ACM SIGMOD Intl Conf. on Management of Data, SIGMOD '10, pages 135-146, 2010.
20. J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21-65, Feb. 1991.
21. U. Meyer and P. Sanders. Delta-stepping: A parallel single source shortest path algorithm. In Proc. European Symposium on Algorithms, ESA '98, pages 393-404, 1998.
22. M. M. Michael. Scalable lock-free dynamic memory allocation. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, PLDI '04, pages 35-46, 2004.
23. D. Nguyen and K. Pingali. Synthesizing concurrent schedulers for irregular algorithms. In Proc. Intl Conf. Architectural Support for Programming Languages and Operating Systems, ASPLOS '11, pages 333-344, 2011.
24. M. Papaefthymiou and J. Rodrigue. Implementing parallel shortest-paths algorithms. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 59-68, 1994.
25. R. Pearce, M. Gokhale, and N. M. Amato. Multithreaded asynchronous graph traversal for inmemory and semi-external memory. In Proc. ACM/IEEE Intl Conf. High Performance Computing, Networking, Storage and Analysis, SC '10, pages 1-11, 2010.
26. K. Pingali, D. Nguyen, M. Kulkarni, M. Burtscher, M. A. Hassaan, R. Kaleem, T.-H. Lee, A. Lenharth, R. Manevich, M. Méndez-Lojo, D. Prountzos, and X. Sui. The tao of parallelism in algorithms. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, PLDI '11, pages 12-25, 2011.
27. A. Rogers and K. Pingali. Process decomposition through locality of reference. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, PLDI '89, pages 69-80, 1989.
28. S. Schneider, C. D. Antonopoulos, and D. S. Nikolopoulos. Scalable locality-conscious multithreaded memory allocation. In Proc. Intl Symp. Memory Management, ISMM '06, pages 84-94, 2006.
29. N. Shavit and I. Lotan. Skiplist-based concurrent priority queues. In Proc. Intl Parallel and Distributed Processing Symp./Intl Parallel Processing Symp., IPDPS '00, pages 263-268, 2000.
30. N. Shavit and A. Zemach. Scalable concurrent priority queue algorithms. In Proc. ACM Symp. Principles of Distributed Computing, PODC '99, pages 113-122, 1999.
31. J. Shun and G. E. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In Proc. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, PPoPP '13, pages 135-146, 2013.
32. H. Sundell and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. J. Parallel Distrib. Comput., 65:609-627, May 2005.
33. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
34. R. M. Yoo, A. Romano, and C. Kozyrakis. Phoenix rebirth: Scalable MapReduce on a large-scale shared-memory system. In Proc. IEEE Intl Symp. Workload Characterization, IISWC '09, pages 198-207, 2009.