返回
GMR: graph-compatible MapReduce programming model
DOI:10.1007/s11042-017-5102-2.png)
摘要
En 中文
The MapReduce programming model is widely used to parallelize data processing over the large scale of commodity computer clusters. However, on account of its monotonous data representation, it fails to express graph-parallel algorithms naturally and execute them efficiently. Alternatively, Pregel and PowerGraph could address these challenges. But they require users to familiarize another set of programming patterns and platforms, and at the same time the legacy MapReduce code also becomes incompatible and useless. In this paper, we proposed the Graph-compatible MapReduce (GMR) as an extension of Google's Standard MapReduce (SMR). In this way, graph-parallel algorithm will be naturally expressed without compromising the efficiency and simplicity, and meanwhile the conventional MapReduce programming pattern be preserved. Also, users could gain the convenience of Think like a vertex. Based on the experimental studying, we analyzed the ratio of the redundant computation, transmission and data caching introduced in naive iterative MapReduce platforms (e.g., HaLoop, Twister). Furthermore, we discussed the difference between GMR and the graph-targeted frameworks. The evaluation experiment results show that GMR outperforms GraphX in a series of real-world graph-parallel algorithms.
Keyword:
Distributed systems
Parallel architectures
Graph theory
Systems programs and utilities
Performance analysis and design aids
Concurrent programming
Modes of computation
Performance of systems
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
Regulation of ProMMP-1 and ProMMP-3 Activation by Tissue Factor Pathway Inhibitor-2/Matrix-Associated Serine Protease Inhibitor组织因子途径抑制剂-2/基质相关丝氨酸蛋白酶抑制剂的ProMMP-1和ProMMP-3激活调控

