Task Assignment Algorithm Based on Trust in Volunteer Computing Platforms

In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this paper, we propose two novel task assignment alg...

Full description

Saved in:
Bibliographic Details
Published inInformation (Basel) Vol. 10; no. 7; p. 244
Main Authors Xu, Ling, Qiao, Jianzhong, Lin, Shukuan, Qi, Ruihua
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.07.2019
Subjects
Algorithms
Assignment problem
Availability
Benchmarks
Cloud computing
Completion time
Distributed processing
Fault tolerance
Precedence constraints
Reliability
Reliability analysis
reliability model
Segmentation
task assignment
Task scheduling
Trustworthiness
volunteer computing
Online AccessGet full text

Cover

More Information
Summary:In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this paper, we propose two novel task assignment algorithms to minimize completion time (makespan) by a flexible task assignment. Firstly, this paper proposes a reliability model, which uses a simple fuzzy model to predict the time interval provided by a VN. This reliability model can reduce inconsistencies between the expected availability time and actual availability time. Secondly, based on the reliability model, this paper proposes an algorithm called EFTT (Earliest Finish Task based on Trust, EFTT), which can minimize makespan. However, EFTT may induce resource waste in task assignment. To make full use of computing resources and reduce task segmentation rate, an algorithm IEFTT (improved earliest finish task based on trust, IEFTT) is further proposed. Finally, experimental results verify the efficiency of the proposed algorithms.
ISSN:2078-2489
2078-2489
DOI:10.3390/info10070244