2017
DOI: 10.25046/aj0203133
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Performance of Fair Scheduler in Hadoop

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Zhang et al [13] dynamically reconfigured Hadoop for realtime performance, outperforming the vanilla Hadoop. Lo and Cheng [14] proposed a modified fair scheduler that dynamically adjusts the resource allocation for user jobs and reduces the average turnaround time. Shi et al [15] introduced an adaptive scheduling algorithm, dynamically adjusts job priority and segments small-sized jobs, achieving a 20% reduction in the average turnaround time compared to the baseline fair scheduler.…”
Section: Significance Of Studymentioning
confidence: 99%
“…Zhang et al [13] dynamically reconfigured Hadoop for realtime performance, outperforming the vanilla Hadoop. Lo and Cheng [14] proposed a modified fair scheduler that dynamically adjusts the resource allocation for user jobs and reduces the average turnaround time. Shi et al [15] introduced an adaptive scheduling algorithm, dynamically adjusts job priority and segments small-sized jobs, achieving a 20% reduction in the average turnaround time compared to the baseline fair scheduler.…”
Section: Significance Of Studymentioning
confidence: 99%