2019 4th MEC International Conference on Big Data and Smart City (ICBDSC) 2019
DOI: 10.1109/icbdsc.2019.8645613
|View full text |Cite
|
Sign up to set email alerts
|

A New Approach for Scheduling Tasks and/or Jobs in Big Data Cluster

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…(5) Our strategy only investigates on the scheduling of computing tasks. However, a GPU‐enabled cluster can be the underlying infrastructure of many kinds of distributed systems including HBase, Spark, and so on 33 . Our future work will take into consideration resource loads of I/O and memory.…”
Section: Discussionmentioning
confidence: 99%
“…(5) Our strategy only investigates on the scheduling of computing tasks. However, a GPU‐enabled cluster can be the underlying infrastructure of many kinds of distributed systems including HBase, Spark, and so on 33 . Our future work will take into consideration resource loads of I/O and memory.…”
Section: Discussionmentioning
confidence: 99%
“…Author in [7] suggested a new technique to schedule the Jobs or tasks in Big Data cluster. The uniqueness of this proposed method is that it basically focuses on the resources utilization and the type of Scheduled job altogether.…”
Section: Literature Review On Task Scheduling In Fog-cloud Environmentmentioning
confidence: 99%
“…However, researchers must proceed cautiously while adopting the DTSS scheduler because it is ineffective when jobs have convenient access to datalocal nodes. This paper [56] suggested a new method for scheduling tasks and/or jobs in a Big Data Cluster that focuses on enhancing the NameNode's task distribution to the data nodes. This task scheduler outperforms the existing task schedulers: FIFO Scheduler and Capacity Scheduler, as evidenced by the significant results gained.…”
Section: Other Improved Algorithmsmentioning
confidence: 99%
“…They define the work packing problem, which incorporates maximizing the job sets' completion efficiency, and deploy the k-means clustering technique to achieve JCT alignment. When the k-means clustering approach yields excessive groups, the number of jobs in each job unit decreases, which is a disadvantage for the job packing method to pick and pack appropriate jobs from a job group [56]. By integrating Round robin and the priority scheduling technique, a hybrid scheduler is presented in [58].…”
Section: Other Improved Algorithmsmentioning
confidence: 99%