Scheduling divisible MapReduce computations

被引：50

作者：

Berlinska, J. ^{[2
]}

Drozdowski, M. ^{[1
]}

机构：

[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland

[2] Adam Mickiewicz Univ, Fac Math & Comp Sci, PL-61614 Poznan, Poland

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2011年 / 71卷 / 03期

关键词：

Parallel processing; MapReduce; Scheduling; Divisible loads; Performance evaluation; DISTRIBUTED COMPUTATION; TREE NETWORKS; LOADS;

D O I：

10.1016/j.jpdc.2010.12.004

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we analyze MapReduce distributed computations as a divisible load scheduling problem. The two operations of mapping and reducing can be understood as two divisible applications with precedence constraints. A divisible load model of the computation, and two load partitioning algorithms are proposed. Performance limits of MapReduce computations are investigated. To our best knowledge this is the first time that processing applications with precedence constraints have been considered on the grounds of divisible load theory. (C) 2010 Elsevier Inc. All rights reserved.

引用

页码：450 / 459

页数：10

共 50 条

[41] Scheduling strategies of divisible loads in DIN networks
Dong, LG
Ngoh, LH
Tan, JG
EURO-PAR 2003 PARALLEL PROCESSING, PROCEEDINGS, 2003, 2790 : 236 - 240
[42] Divisible load scheduling and Markov chain models
Moges, M. A.
Robertazzi, T. G.
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2006, 52 (10-11) : 1529 - 1542
[43] Scheduling divisible loads on partially reconfigurable hardware
Vikram, K. N.
Vasudevan, V.
FCCM 2006: 14TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2006, : 289 - +
[44] Dynamically scheduling divisible load for grid computing
Boutammine, Salah-Salim
Millot, Daniel
Parrot, Christian
HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, 2006, 4208 : 763 - 772
[45] Divisible Load Scheduling with Improved Asymptotic Optimality
Suda, Reiji
2008 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, 2008, : 262 - 267
[46] Scheduling divisible loads with time and cost constraints
Drozdowski, M.
Shakhlevich, N. V.
JOURNAL OF SCHEDULING, 2021, 24 (05) : 507 - 521
[47] Experiments with scheduling divisible tasks in clusters of workstations
Drozdowski, M
Wolniewicz, P
EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 311 - 319
[48] Scheduling Hybrid Divisible and Indivisible Loads on Clusters
Hu, Menglan
Veeravalli, Bharadwaj
2011 17TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS (ICON), 2011, : 141 - 146
[49] ALGORITHMS FOR SCHEDULING IMPRECISE COMPUTATIONS
LIU, JWS
LIN, KJ
SHIH, WK
YU, ACS
CHUNG, JY
WEI, Z
COMPUTER, 1991, 24 (05) : 58 - 68
[50] Dynamic scheduling of parallel computations
Liu, Z
THEORETICAL COMPUTER SCIENCE, 2000, 246 (1-2) : 239 - 252

← 1 2 3 4 5 →