Abstract-Reliability is widely identified as an increasingly relevant issue in heterogeneous service-oriented systems because 7 processor failure affects the quality of service to users. Replication-based fault-tolerance is a common approach to satisfy application's 8 reliability requirement. This study solves the problem of minimizing redundancy to satisfy reliability requirement for a directed acyclic 9 graph (DAG)-based parallel application on heterogeneous service-oriented systems. We first propose the enough replication for 10 redundancy minimization (ERRM) algorithm to satisfy application's reliability requirement, and then propose heuristic replication for 11 redundancy minimization (HRRM) to satisfy application's reliability requirement with low time complexity. Experimental results on real 12 and randomly generated parallel applications at different scales, parallelism, and heterogeneity verify that ERRM can generate least 13 redundancy followed by HRRM, and the state-of-the-art MaxRe and RR algorithm. In addition, HRRM implements approximate 14 minimum redundancy with a short computation time. Index Terms-Fault-tolerance, heterogeneous service-oriented systems, quality of service, reliability requirement, replication application cannot be 100 percent reliable in practice. fore, if an application can satisfy its specified reliability 61 requirement (also named reliability goal or reliability assur-62 ance in some studies), then it is considered to be reliable. For example, assume that the application's reliability 64 requirement is 0.9, only if the application's reliability 65 exceeds 0.9, will the application be reliable. Specifically,
In REF , authors use replication-based fault-tolerance approach to solve the problem of minimizing redundancy to satisfy reliability requirement.
Minimizing Redundancy to Satisfy Reliability Requirement for a Parallel Application on Heterogeneous Service-oriented Systems
IEEE Transactions on Services Computing
Computer Science