• DocumentCode
    2906314
  • Title

    An In-Memory Framework for Extended MapReduce

  • Author

    Rehmann, Kim-Thomas ; Schoettner, M.

  • Author_Institution
    Inst. fur Inf., Heinrich-Heine-Univ. Dusseldorf, Dusseldorf, Germany
  • fYear
    2011
  • fDate
    7-9 Dec. 2011
  • Firstpage
    17
  • Lastpage
    24
  • Abstract
    The MapReduce programming model simplifies the design and implementation of certain parallel algorithms. Recently, several work-groups have extended MapReduce´s application domain to iterative and on-line data processing. Despite having different data access characteristics, these extensions rely on the same storage facility as the original model, but propagate data updates using additional techniques. In order to benefit from large main memories, fast data access and stronger data consistency, we propose to employ in-memory storage for extended MapReduce. In this paper, we describe the design and implementation of EMR, an in-memory framework for extended MapReduce. To illustrate the usage and performance of our framework, we present measurements of typical MapReduce applications.
  • Keywords
    data integrity; iterative methods; parallel algorithms; parallel programming; storage management; MapReduce programming model; data consistency; extended MapReduce; in-memory framework; in-memory storage; iterative processing; on-line data processing; parallel algorithm; Computational modeling; Data models; Fault tolerance; Fault tolerant systems; Google; Programming; Synchronization; MapReduce; data storage; design; distributed applications; experimentation; parallel programming; scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Systems (ICPADS), 2011 IEEE 17th International Conference on
  • Conference_Location
    Tainan
  • ISSN
    1521-9097
  • Print_ISBN
    978-1-4577-1875-5
  • Type

    conf

  • DOI
    10.1109/ICPADS.2011.25
  • Filename
    6121255