메뉴 건너뛰기




Volumn , Issue , 2013, Pages 197-210

Presto: Distributed machine learning and graph processing with sparse matrices

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION INTERFACE; COMPLEX ALGORITHMS; DISTRIBUTED MACHINE LEARNING; DISTRIBUTED SYSTEMS; GRAPH ALGORITHMS; GRAPH PROCESSING; MATRIX COMPUTATION; SINGLE-THREADED;

EID: 84877713877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2465351.2465371     Document Type: Conference Paper
Times cited : (69)

References (37)
  • 1
    • 84877718603 scopus 로고    scopus 로고
    • Apache mahout. http://mahout.apache.org.
  • 2
    • 84877700205 scopus 로고    scopus 로고
    • Netflix prize. http://www.netflixprize.com/.
  • 3
    • 84877689734 scopus 로고    scopus 로고
    • The R project for statistical computing. http://www.rproject.org.
  • 6
    • 0002634823 scopus 로고
    • Scheduling multithreaded computations by work stealing
    • Washington, DC, USA
    • R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. In SFCS '94, pages 356-368, Washington, DC, USA, 1994.
    • (1994) SFCS '94 , pp. 356-368
    • Blumofe, R.D.1    Leiserson, C.E.2
  • 7
    • 0035648637 scopus 로고    scopus 로고
    • A faster algorithm for betweenness centrality
    • U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25:163-177, 2001. (Pubitemid 33398479)
    • (2001) Journal of Mathematical Sociology , vol.25 , Issue.2 , pp. 163-177
    • Brandes, U.1
  • 8
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine
    • S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In WWW7, pages 107-117, 1998.
    • (1998) WWW7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 9
    • 79956351190 scopus 로고    scopus 로고
    • HaLoop: Efficient iterative data processing on large clusters
    • September
    • Y. Bu, B. Howe, M. Balazinska, and M. D. Ernst. HaLoop: Efficient iterative data processing on large clusters. Proc. VLDB Endow., 3:285-296, September 2010.
    • (2010) Proc. VLDB Endow. , vol.3 , pp. 285-296
    • Bu, Y.1    Howe, B.2    Balazinska, M.3    Ernst, M.D.4
  • 12
    • 37549003336 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. Commun. ACM, 51(1), 2008.
    • (2008) Commun. ACM , vol.51 , Issue.1
    • Dean, J.1    Ghemawat, S.2
  • 15
    • 33745196196 scopus 로고    scopus 로고
    • Slepc: A scalable and flexible toolkit for the solution of eigenvalue problems
    • Sept.
    • V. Hernandez, J. E. Roman, and V. Vidal. Slepc: A scalable and flexible toolkit for the solution of eigenvalue problems. ACM Trans. Math. Softw., 31(3):351-362, Sept. 2005.
    • (2005) ACM Trans. Math. Softw. , vol.31 , Issue.3 , pp. 351-362
    • Hernandez, V.1    Roman, J.E.2    Vidal, V.3
  • 17
    • 34548041192 scopus 로고    scopus 로고
    • Dryad: Distributed data-parallel programs from sequential building blocks
    • DOI 10.1145/1272996.1273005, Operating Systems Review - Proceedings of the 2007 EuroSys Conference
    • M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed data-parallel programs from sequential building blocks. In EuroSys '07, pages 59-72, 2007. (Pubitemid 47281575)
    • (2007) Operating Systems Review (ACM) , pp. 59-72
    • Isard, M.1    Budiu, M.2    Yu, Y.3    Birrell, A.4    Fetterly, D.5
  • 18
    • 79957962519 scopus 로고    scopus 로고
    • Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
    • U. Kang, B. Meeder, and C. Faloutsos. Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation. In PAKDD (2), pages 13-25, 2011.
    • (2011) PAKDD (2) , pp. 13-25
    • Kang, U.1    Meeder, B.2    Faloutsos, C.3
  • 19
    • 84867616098 scopus 로고    scopus 로고
    • Graph Algorithms in the Language of Linear Algebra
    • SIAM
    • J. Kepner and J. Gilbert. Graph Algorithms in the Language of Linear Algebra. Fundamentals of Algorithms. SIAM, 2011.
    • (2011) Fundamentals of Algorithms
    • Kepner, J.1    Gilbert, J.2
  • 21
    • 0038436804 scopus 로고    scopus 로고
    • ARPACK users' guide - Solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods
    • SIAM
    • R. B. Lehoucq, D. C. Sorensen, and C. Yang. ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. Software, environments, tools. SIAM, 1998.
    • (1998) Software, Environments, Tools
    • Lehoucq, R.B.1    Sorensen, D.C.2    Yang, C.3
  • 26
    • 84877713520 scopus 로고    scopus 로고
    • CIEL: A universal execution engine for distributed data-flow computing
    • D. G. Murray and S. Hand. CIEL: A universal execution engine for distributed data-flow computing. In NSDI '11, Boston, MA, USA, 2011.
    • NSDI '11, Boston, MA, USA, 2011
    • Murray, D.G.1    Hand, S.2
  • 27
    • 55349148888 scopus 로고    scopus 로고
    • Pig latin: A not-so-foreign language for data processing
    • C. Olston, B. Reed, U. Srivastava, R. Kumar, and A. Tomkins. Pig latin: A not-so-foreign language for data processing. In SIGMOD'08, pages 1099-1110, 2008.
    • (2008) SIGMOD'08 , pp. 1099-1110
    • Olston, C.1    Reed, B.2    Srivastava, U.3    Kumar, R.4    Tomkins, A.5
  • 28
    • 84877700330 scopus 로고    scopus 로고
    • Piccolo: Building fast, distributed programs with partitioned tables
    • USENIX Association
    • R. Power and J. Li. Piccolo: Building fast, distributed programs with partitioned tables. In OSDI '10, Vancouver, BC, Canada, 2010. USENIX Association.
    • OSDI '10, Vancouver, BC, Canada, 2010
    • Power, R.1    Li, J.2
  • 30
    • 79952420862 scopus 로고    scopus 로고
    • Hama: An efficient matrix computation with the mapreduce framework
    • S. Seo, E. J. Yoon, J. Kim, S. Jin, J.-S. Kim, and S. Maeng. Hama: An efficient matrix computation with the mapreduce framework. In In CLOUDCOM'10, pages 721-726.
    • CLOUDCOM'10 , pp. 721-726
    • Seo, S.1    Yoon, E.J.2    Kim, J.3    Jin, S.4    Kim, J.-S.5    Maeng, S.6
  • 31
    • 33751040129 scopus 로고    scopus 로고
    • Parallel programming and code selection in fortress
    • G. L. Steele, Jr. Parallel programming and code selection in fortress. In PPoPP '06, pages 1-1, 2006.
    • (2006) PPoPP '06 , pp. 1
    • Steele Jr., G.L.1
  • 33
    • 67049138457 scopus 로고    scopus 로고
    • Fast counting of triangles in large real networks without counting: Algorithms and laws
    • IEEE
    • C. E. Tsourakakis. Fast counting of triangles in large real networks without counting: Algorithms and laws. In ICDM'08, pages 608-617. IEEE, 2008.
    • (2008) ICDM'08 , pp. 608-617
    • Tsourakakis, C.E.1
  • 34
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • August
    • L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33:103-111, August 1990.
    • (1990) Commun. ACM , vol.33 , pp. 103-111
    • Valiant, L.G.1
  • 35
    • 85076882757 scopus 로고    scopus 로고
    • DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language
    • 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, pages 1-14, 2008.
    • (2008) OSDI '08 , pp. 1-14
    • Yu, Y.1    Isard, M.2    Fetterly, D.3    Budiu, M.4    Erlingsson, U.5    Gunda, P.K.6    Currey, J.7
  • 37
    • 48249089255 scopus 로고    scopus 로고
    • Large-Scale Parallel Collaborative Filtering for the Netflix Prize
    • Shanghai, China
    • Y. Zhou, D.Wilkinson, R. Schreiber, and R. Pan. Large-Scale Parallel Collaborative Filtering for the Netflix Prize. In AAIM'08, pages 337-348, Shanghai, China, 2008.
    • (2008) AAIM'08 , pp. 337-348
    • Zhou, Y.1    Wilkinson, D.2    Schreiber, R.3    Pan, R.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.