PageRank在Hadoop和Giraph上的效率实验

Arne Koschel, Felix Heine, Irina Astrova, Fred Korte, Thomas Rossow, Sebastian Stipkovic
{"title":"PageRank在Hadoop和Giraph上的效率实验","authors":"Arne Koschel, Felix Heine, Irina Astrova, Fred Korte, Thomas Rossow, Sebastian Stipkovic","doi":"10.1109/PDP.2016.49","DOIUrl":null,"url":null,"abstract":"This paper compares the efficiency of two implementations of the PageRank algorithm, one using Hadoop's MapReduce and the other Giraph's Pregel. The implementations are evaluated against CPU usage, CPU I/O wait time, memory usage, and execution time. The result of the evaluation is that Giraph outperforms Hadoop.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Efficiency Experiments on Hadoop and Giraph with PageRank\",\"authors\":\"Arne Koschel, Felix Heine, Irina Astrova, Fred Korte, Thomas Rossow, Sebastian Stipkovic\",\"doi\":\"10.1109/PDP.2016.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper compares the efficiency of two implementations of the PageRank algorithm, one using Hadoop's MapReduce and the other Giraph's Pregel. The implementations are evaluated against CPU usage, CPU I/O wait time, memory usage, and execution time. The result of the evaluation is that Giraph outperforms Hadoop.\",\"PeriodicalId\":192273,\"journal\":{\"name\":\"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDP.2016.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2016.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文比较了两种实现PageRank算法的效率,一种是使用Hadoop的MapReduce,另一种是使用Giraph的Pregel。根据CPU使用情况、CPU I/O等待时间、内存使用情况和执行时间对实现进行评估。评估的结果是,Giraph优于Hadoop。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficiency Experiments on Hadoop and Giraph with PageRank
This paper compares the efficiency of two implementations of the PageRank algorithm, one using Hadoop's MapReduce and the other Giraph's Pregel. The implementations are evaluated against CPU usage, CPU I/O wait time, memory usage, and execution time. The result of the evaluation is that Giraph outperforms Hadoop.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信