Efficiency-First Fault-Tolerant Replica Scheduling Strategy for Reliability Constrained Cloud Application

Yingxue Zhang, Guisheng Fan, Huiqun Yu, Xingpeng Chen

Abstract: Reliability requirement assurance is an important prerequisite for application execution in the cloud. Although copy management can improve the reliability of applications, it also brings a series of resource waste and overhead issues. Therefore, the efficiency-first fault-tolerant algorithm (EFFT) with minimum execution cost in the cloud application is proposed. This algorithm minimizes the execution cost of the application under the constraints of reliability, and solves the problem of excessive overhead caused by too many copies. The EFFT algorithm is divided into two stages: initial allocation and dynamic adjustment. On the initial allocation of EFFT algorithm, a sorting rule is defined to determine the priority of tasks and instances. During the adjustment phase, by defining an actual efficiency ratio indicator to measure the cost-effectiveness of an instance, the EFFT algorithm makes a good trade-off between cost and reliability in order to minimize execution costs. Run our algorithm on randomly generated parallel applications of different scales and compare the experimental results with four advanced algorithms. The experiments show that the performance of the algorithm we proposed is better than the other algorithms in terms of execution cost and fault tolerance.

External IDs:dblp:conf/npc/ZhangFYC21