• DocumentCode
    1684869
  • Title

    All-pairs: An abstraction for data-intensive cloud computing

  • Author

    Moretti, C. ; Bulosan, J. ; Thain, D. ; Flynn, P.J.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Univ. of Notre Dame, Notre Dame, IN
  • fYear
    2008
  • Firstpage
    1
  • Lastpage
    11
  • Abstract
    Although modern parallel and distributed computing systems provide easy access to large amounts of computing power, it is not always easy for non-expert users to harness these large systems effectively. A large workload composed in what seems to be the obvious way by a naive user may accidentally abuse shared resources and achieve very poor performance. To address this problem, we propose that production systems should provide end users with high-level abstractions that allow for the easy expression and efficient execution of data intensive workloads. We present one example of an abstraction - all-pairs - that fits the needs of several data-intensive scientific applications. We demonstrate that an optimized all-pairs abstraction is both easier to use than the underlying system, and achieves performance orders of magnitude better than the obvious but naive approach, and twice as fast as a hand-optimized conventional approach.
  • Keywords
    distributed memory systems; grid computing; data-intensive cloud computing; distributed computing systems; hand-optimized conventional approach; high-level abstractions; parallel computing system; Biometrics; Cloud computing; Clustering algorithms; Computer science; Concurrent computing; Data engineering; Data mining; Distributed computing; Face recognition; Power engineering and energy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on
  • Conference_Location
    Miami, FL
  • ISSN
    1530-2075
  • Print_ISBN
    978-1-4244-1693-6
  • Type

    conf

  • DOI
    10.1109/IPDPS.2008.4536311
  • Filename
    4536311