Formal Derivation of Distributed MapReduce

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

Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

Abstract

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.
Original languageUndefined/Unknown
Title of host publicationProceedings of ABZ 2014
EditorsAit Ameur Y, K Schewe
PublisherSpringer
Pages238–254
ISBN (Electronic)978-3-662-43652-3
ISBN (Print)978-3-662-43651-6
DOIs
Publication statusPublished - 2014
MoE publication typeA4 Article in a conference publication
Eventconference; 2014-06-02; 2014-06-06 - Clearwater, Florida, USA
Duration: 2 Jun 20146 Jun 2014

Conference

Conferenceconference; 2014-06-02; 2014-06-06
Period02/06/1406/06/14

Keywords

  • Event-B
  • MapReduce
  • formal modelling
  • refinement

Cite this