Formal Derivation of Distributed MapReduce

I Pereverzeva, M Butler, AS Fathabadi, Inna Vistbakka, Linas Laibinis

    Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

    Abstrakti

    MapReduce is a powerful distributed data processing model that is currently adopted in a wide range of domains to efficiently handle large volumes of data, i.e., cope with the big data surge. In this paper, we propose an approach to formal derivation of the MapReduce framework. Our approach relies on stepwise refinement in Event-B and, in particular, the event refinement structure approach – a diagrammatic notation facilitating formal development. Our approach allows us to derive the system architecture in a systematic and well-structured way. The main principle of MapReduce is to parallelise processing of data by first mapping them to multiple processing nodes and then merging the results. To facilitate this, we formally define interdependencies between the map and reduce stages of MapReduce. This formalisation allows us to propose an alternative architectural solution that weakens blocking between the stages and, as a result, achieves a higher degree of parallelisation of MapReduce computations.
    AlkuperäiskieliEi tiedossa
    OtsikkoProceedings of ABZ 2014
    ToimittajatAit Ameur Y, K Schewe
    KustantajaSpringer
    Sivut238–254
    ISBN (elektroninen)978-3-662-43652-3
    ISBN (painettu)978-3-662-43651-6
    DOI - pysyväislinkit
    TilaJulkaistu - 2014
    OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
    Tapahtumaconference; 2014-06-02; 2014-06-06 - Clearwater, Florida, USA
    Kesto: 2 kesäk. 20146 kesäk. 2014

    Konferenssi

    Konferenssiconference; 2014-06-02; 2014-06-06
    Ajanjakso02/06/1406/06/14

    Keywords

    • Event-B
    • MapReduce
    • formal modelling
    • refinement

    Viittausmuodot