ADAPTIVE DYNAMIC DATA PLACEMENT ALGORITHM FOR HADOOP IN HETEROGENEOUS ENVIRONMENTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SHARAFI AVISHAN; REZAEE ALI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY Year:2016 | Volume:2 | Issue:4 Page(s): 17-30

Download Full-Text

View:

263

Download:

133

Cites:

Information Journal Paper

Title

ADAPTIVE DYNAMIC DATA PLACEMENT ALGORITHM FOR HADOOP IN HETEROGENEOUS ENVIRONMENTS

Author(s)

SHARAFI AVISHAN | REZAEE ALI | Issue Writer Certificate

Keywords

HADOOP

MAPREDUCE

RESOURCEAWARE

DATA PLACEMENT

HETEROGENEOUS

Abstract

Hadoop 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 utilization.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SHARAFI, 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. SID. https://sid.ir/paper/346272/en

Vancouver: Copy

SHARAFI AVISHAN, REZAEE ALI. ADAPTIVE DYNAMIC DATA PLACEMENT ALGORITHM FOR HADOOP IN HETEROGENEOUS ENVIRONMENTS. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY[Internet]. 2016;2(4):17-30. Available from: https://sid.ir/paper/346272/en

IEEE: Copy

AVISHAN SHARAFI, and ALI REZAEE, “ADAPTIVE DYNAMIC DATA PLACEMENT ALGORITHM FOR HADOOP IN HETEROGENEOUS ENVIRONMENTS,” JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, vol. 2, no. 4, pp. 17–30, 2016, [Online]. Available: https://sid.ir/paper/346272/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops