Dynamic Task Scheduling Algorithm with Deadline Constraint in Heterogeneous Volunteer Computing Platforms
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...
Main Authors: | Ling Xu, Jianzhong Qiao, Shukuan Lin, Wanting Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-05-01
|
Series: | Future Internet |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-5903/11/6/121 |
Similar Items
-
Research on the Task Assignment Problem with Maximum Benefits in Volunteer Computing Platforms
by: Ling Xu, et al.
Published: (2020-05-01) -
Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints
by: He Cheng, et al.
Published: (2014-02-01) -
An Efficient Energy-Aware Tasks Scheduling with Deadline-Constrained in Cloud Computing
by: Said BEN ALLA, et al.
Published: (2019-06-01) -
Deadline Constrained Scheduling Optimization Algorithm for Workflow in Clouds Using Spot Instance
by: PAN Jikui, DONG Xinyi, LU Zhenghao, WANG Zijian, SUN Fuquan
Published: (2023-04-01) -
Combining Earliest Deadline First Scheduling with Scheduled Traffic Support in Automotive TSN-Based Networks
by: Luca Leonardi, et al.
Published: (2022-12-01)