.png){kind=icon}
返回
Scheduling divisible MapReduce computations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2010.12.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Parallel processing
MapReduce
Scheduling
Divisible loads
Performance evaluation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
分享收藏
Homogeneous catalytic carbonylation of nitroaromatics Part III. Discovery and in situ high pressure FTIR spectral studies of a novel binuclear ruthenium catalyst硝基芳族化合物的均相催化羰基化部分III.新型双核钌催化剂的发现和原位高压FTIR光谱研究
PREAI
分享收藏分享收藏
查看更多内容