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}
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.