نمایش مختصر رکورد

dc.contributor.authorSharafi, Avishanen_US
dc.contributor.authorRezaee, Alien_US
dc.date.accessioned1399-07-08T17:27:01Zfa_IR
dc.date.accessioned2020-09-29T17:27:01Z
dc.date.available1399-07-08T17:27:01Zfa_IR
dc.date.available2020-09-29T17:27:01Z
dc.date.issued2016-11-01en_US
dc.date.issued1395-08-11fa_IR
dc.date.submitted2016-07-16en_US
dc.date.submitted1395-04-26fa_IR
dc.identifier.citationSharafi, Avishan, Rezaee, Ali. (2016). Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments. Journal of Advances in Computer Engineering and Technology, 2(4), 17-30.en_US
dc.identifier.issn2423-4192
dc.identifier.issn2423-4206
dc.identifier.urihttp://jacet.srbiau.ac.ir/article_9692.html
dc.identifier.urihttps://iranjournals.nlai.ir/handle/123456789/21282
dc.description.abstractHadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system's rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop doesn't consider load state of each node in distribution input data blocks, which may cause inappropriate overhead and reduce Hadoop performance, but in practice, such data placement policy can noticeably reduce MapReduce performance and may increase extra energy dissipation in heterogeneous environments. This paper proposes a resource aware adaptive dynamic data placement algorithm (ADDP) .With ADDP algorithm, we can resolve the unbalanced node workload problem based on node load status. The proposed method can dynamically adapt and balance data stored on each node based on node load status in a heterogeneous Hadoop cluster. Experimental results show that data transfer overhead decreases in comparison with DDP and traditional Hadoop algorithms. Moreover, the proposed method can decrease the execution time and improve the system's throughput by increasing resource utilizationen_US
dc.format.extent517
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoen_US
dc.publisherScience and Research Branch,Islamic Azad Universityen_US
dc.relation.ispartofJournal of Advances in Computer Engineering and Technologyen_US
dc.subjectHadoopen_US
dc.subjectMapReduceen_US
dc.subjectResource-awareen_US
dc.subjectData placementen_US
dc.subjectHeterogeneousen_US
dc.subjectComputer Networks and Distributed Systemsen_US
dc.titleAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environmentsen_US
dc.typeTexten_US
dc.typeReview Paperen_US
dc.contributor.departmentDepartment of Computer Engineering, Islamic Azad University South Tehran Branchen_US
dc.contributor.departmentDepartment of Computer Engineering, Islamic Azad University, Science and Research Branch,Tehran, Iran.en_US
dc.citation.volume2
dc.citation.issue4
dc.citation.spage17
dc.citation.epage30


فایل‌های این مورد

Thumbnail

این مورد در مجموعه‌های زیر وجود دارد:

نمایش مختصر رکورد