scholarly journals Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing

2005 ◽  
Author(s):  
A.J. Page ◽  
T.J. Naughton
Keyword(s):  
Genetic Algorithms ◽  
Distributed Computing ◽  
Task Scheduling ◽  
Dynamic Task ◽  
Heterogeneous Distributed Computing ◽  
Dynamic Task Scheduling

scholarly journals Dynamic Task Scheduling Algorithm with Deadline Constraint in Heterogeneous Volunteer Computing Platforms

2019 ◽  
Vol 11 (6) ◽  
pp. 121 ◽  
Author(s):  
Ling Xu ◽  
Jianzhong Qiao ◽  
Shukuan Lin ◽  
Wanting Zhang
Keyword(s):  
Distributed Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Volunteer Computing ◽  
Scheduling Problem ◽  
Dynamic Task ◽  
Use Of Resources ◽  
Task Scheduling Algorithm ◽  
Deadline Constraint ◽  
Dynamic Task Scheduling

Volunteer computing (VC) is a distributed computing paradigm, which provides unlimited computing resources in the form of donated idle resources for many large-scale scientific computing applications. Task scheduling is one of the most challenging problems in VC. Although, dynamic scheduling problem with deadline constraint has been extensively studied in prior studies in the heterogeneous system, such as cloud computing and clusters, these algorithms can’t be fully applied to VC. This is because volunteer nodes can get offline whenever they want without taking any responsibility, which is different from other distributed computing. For this situation, this paper proposes a dynamic task scheduling algorithm for heterogeneous VC with deadline constraint, called deadline preference dispatch scheduling (DPDS). The DPDS algorithm selects tasks with the nearest deadline each time and assigns them to volunteer nodes (VN), which solves the dynamic task scheduling problem with deadline constraint. To make full use of resources and maximize the number of completed tasks before the deadline constraint, on the basis of the DPDS algorithm, improved dispatch constraint scheduling (IDCS) is further proposed. To verify our algorithms, we conducted experiments, and the results show that the proposed algorithms can effectively solve the dynamic task assignment problem with deadline constraint in VC.

Reinforcement Learning in Dynamic Task Scheduling: A Review

2020 ◽  
Vol 1 (6) ◽  
Author(s):  
Chathurangi Shyalika ◽  
Thushari Silva ◽  
Asoka Karunananda
Keyword(s):  
Reinforcement Learning ◽  
Task Scheduling ◽  
Dynamic Task ◽  
Dynamic Task Scheduling
Sign in / Sign up

Export Citation Format

Share Document