A New Scheduling Algorithm to Reduce Computation Time in Hadoop Environment

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.

Pakize S. R.; Arefi nejad S. M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2020 | Volume:8 | Issue:2 (30) Page(s): 51-59

Download Full-Text

Persian Verion

View:

426

Download:

Cites:

Information Journal Paper

Title

A New Scheduling Algorithm to Reduce Computation Time in Hadoop Environment

Author(s)

Pakize S. R. | Arefi nejad S. M. | Issue Writer Certificate

Keywords

MapReduce SchedulingQ1

Hybrid AlgorithmQ1

Data LocalityQ1

Dynamic PriorityQ1

Hadoop SchedulingQ1

Abstract

Nowadays, the Hadoop open-source project with the MapReduce framework has become very popular as it processes vast amounts of data in parallel on large clusters of commodity hardware in a reliable and fault-tolerant manner. MapReduce was introduced to solve large-data computational problems, and is dependent on the divide and conquer principle. Time and scheduling are always the most important aspects, hence in the past decades in the MapReduce environment, many scheduling algorithms have been proposed. The main ideas of these algorithms are increasing Data Locality rate, and decreasing response time and completion time. In this research we have proposed a new hybrid scheduling algorithm (HSMRPL) which uses dynamic job priority and identity localization techniques, and focuses on increasing Data Locality rate and decreasing completion time. We have evaluated and compared our algorithm with hadoop default schedulers by running concurrent workloads consisting of the WordCount and Terasort benchmarks. The results show that our proposed algorithm has increased the localization rate by 10. 4% and 18. 5% and the speed by 3. 14% and 3. 3% compared to the FIFO algorithm and the Fair algorithm respectively.

Cites

No record.

References

No record.

Cite

APA: Copy

Pakize, S. R., & Arefi nejad, S. M.. (2020). A New Scheduling Algorithm to Reduce Computation Time in Hadoop Environment. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 8(2 (30) ), 51-59. SID. https://sid.ir/paper/385528/en

Vancouver: Copy

Pakize S. R., Arefi nejad S. M.. A New Scheduling Algorithm to Reduce Computation Time in Hadoop Environment. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2020;8(2 (30) ):51-59. Available from: https://sid.ir/paper/385528/en

IEEE: Copy

S. R. Pakize, and S. M. Arefi nejad, “A New Scheduling Algorithm to Reduce Computation Time in Hadoop Environment,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 8, no. 2 (30) , pp. 51–59, 2020, [Online]. Available: https://sid.ir/paper/385528/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops