Formal Derivation of Distributed MapReduce

D4 Publicerad utvecklings- eller forskningsrapport eller studie


Interna författare/redaktörer


Publikationens författare: Inna Pereverzeva, Michael Butler, Asieh Salehi Fathabadi, Linas Laibinis, Elena Troubitsyna
Förläggare: Turku Centre for Computer Science (TUCS)
Publiceringsår: 2014
Artikelns första sida, sidnummer: 1
Artikelns sista sida, sidnummer: 87
ISBN: 978-952-12-3006-6


Abstrakt

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.


Nyckelord

Event-B, formal modelling, MapReduce, refinement

Senast uppdaterad 2019-05-12 vid 03:11