Implementation of MapReduce over structured peer-to-peer overlay of underutilized resources

Shashwati Banerjea, M. Pandey, Ashish Kumar, R. Dugar, M. M. Gore
{"title":"Implementation of MapReduce over structured peer-to-peer overlay of underutilized resources","authors":"Shashwati Banerjea, M. Pandey, Ashish Kumar, R. Dugar, M. M. Gore","doi":"10.1109/ANTS.2016.7947816","DOIUrl":null,"url":null,"abstract":"The growth of data at an unprecedented rate poses challenge on its storage and analysis. To cope up with this, new machines are procured on a regular basis. On the other hand, a lot of computing resources in Institute labs, government offices etc. remain underutilized, since they are used for Internet and basic utilities. The aggregation of these underutilized resources can be more than handful to satisfy the computing needs of any large scale computation. This paper presents an approach of applying MapReduce framework on non-dedicated nodes. The target of this work is to efficiently use underutilized resources such as storage, processing power etc. on nodes to perform MapReduce applications. We have implemented a prototype of our model by forming a peer-to-peer (P2P) relationship among them and compared the performance with Hadoop, which is a popular large scale data processing framework under similar churn conditions.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2016.7947816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The growth of data at an unprecedented rate poses challenge on its storage and analysis. To cope up with this, new machines are procured on a regular basis. On the other hand, a lot of computing resources in Institute labs, government offices etc. remain underutilized, since they are used for Internet and basic utilities. The aggregation of these underutilized resources can be more than handful to satisfy the computing needs of any large scale computation. This paper presents an approach of applying MapReduce framework on non-dedicated nodes. The target of this work is to efficiently use underutilized resources such as storage, processing power etc. on nodes to perform MapReduce applications. We have implemented a prototype of our model by forming a peer-to-peer (P2P) relationship among them and compared the performance with Hadoop, which is a popular large scale data processing framework under similar churn conditions.
MapReduce在未充分利用资源的结构化点对点覆盖上的实现
数据以前所未有的速度增长,对数据的存储和分析提出了挑战。为了解决这个问题,我们定期采购新机器。另一方面,研究所实验室、政府办公室等的大量计算资源仍未得到充分利用,因为它们用于互联网和基础设施。这些未充分利用的资源的聚合可以满足任何大规模计算的计算需求。本文提出了一种在非专用节点上应用MapReduce框架的方法。这项工作的目标是有效地利用节点上未充分利用的资源,如存储、处理能力等来执行MapReduce应用程序。我们通过在它们之间形成点对点(P2P)关系实现了我们模型的原型,并将其性能与Hadoop进行了比较,Hadoop是一种流行的大规模数据处理框架,在类似的流失条件下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信