Hadoop MapReduce Job Scheduling Algorithms Survey and Use Cases
Autor: | Duaa A. AlSahebAlT amimi, Alaa A. Abdallat, Jaber Alwidian, Arwa I. Alahmad |
---|---|
Rok vydání: | 2019 |
Předmět: |
Job scheduler
Multidisciplinary Process (engineering) Computer science media_common.quotation_subject 010102 general mathematics Construct (python library) computer.software_genre Asset (computer security) 01 natural sciences 010101 applied mathematics Work (electrical) Quality (business) Use case Real-time data 0101 mathematics Algorithm computer media_common |
Zdroj: | Modern Applied Science. 13:38 |
ISSN: | 1913-1852 1913-1844 |
DOI: | 10.5539/mas.v13n7p38 |
Popis: | Data is the fastest growing asset in the 21st century, extracting insights is becoming of the essence as the traditional ecosystems are incapable to process the resulting amounts, complying with different structural levels, and is rapidly produced. Along this paradigm, the need for processing mostly real time data among other factors highlights the need for optimized Job Scheduling Algorithms, which is the interest of this paper. It is one of the most important aspects to guarantee an efficient processing ecosystem with minimal execution time, while exploiting the available resources taking into consideration granting all the users a fair share of the dedicated resources. Through this work, we lay some needed background on the Hadoop MapReduce framework. We run a comparative analysis on different algorithms that are classified on different criteria. The light is shed on different classifications: Cluster Environment, Job Allocation Strategy, Optimization Strategy, and Metrics of Quality. We, also, construct use cases to showcase the characteristics of selected Job Scheduling Algorithms, then we present a comparative display featuring the details for the use cases. |
Databáze: | OpenAIRE |
Externí odkaz: |