Geodesic
Efficient plan for divisible tasks in MapReduce framework
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 2 (2011), pp. 55-66

Voir la notice de l'article provenant de la source Math-Net.Ru

Framework MapReduce allows executing efficiently easily divisible tasks. Although for the group of tasks the task of optimal scheduling is NP-hard itself. Article describes mathematical model of MapReduce framework in two different distributed environments: with and without communication latency. For the environment without communication latency the optimal plan of MapReduce tasks scheduling is offered. For the environment in the presence of communication latency the author estimates the range of values of environment parameters when the offered plan is still efficient.
Keywords: scheduling in distributed environment, scheduling in the presence of communication, optimal scheduling, MapReduce framework. 
@article{VSPUI_2011_2_a5,
     author = {M. A. Panshenskov},
     title = {Efficient plan for divisible tasks in {MapReduce} framework},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {55--66},
     publisher = {mathdoc},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2011_2_a5/}
}
TY  - JOUR
AU  - M. A. Panshenskov
TI  - Efficient plan for divisible tasks in MapReduce framework
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2011
SP  - 55
EP  - 66
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2011_2_a5/
LA  - ru
ID  - VSPUI_2011_2_a5
ER  - 
%0 Journal Article
%A M. A. Panshenskov
%T Efficient plan for divisible tasks in MapReduce framework
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2011
%P 55-66
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSPUI_2011_2_a5/
%G ru
%F VSPUI_2011_2_a5
M. A. Panshenskov. Efficient plan for divisible tasks in MapReduce framework. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 2 (2011), pp. 55-66. http://geodesic.mathdoc.fr/item/VSPUI_2011_2_a5/