Dependable workflow scheduling in global Grids

Abstract

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system.

An agent‐oriented, trust‐aware approach to improve the QoS in dynamic grid federations

“…Furthermore, in order to deal with unreliability of computing resources at large scale, decentralized grid overlays are proposed together with a reputation-based grid workflow scheduling algorithm in [69]. The proposed algorithm allows the grid federation to dynamically adapt itself to changes occurring in resource conditions and in dealing with unsuccessful job execution events or resource failures.…”

“…Providers set the price according to demand and supply, and consumers maximize the surplus upon budget and deadline, while the weighted voting scheme secures the grid by declining join requests coming from malicious nodes. Similarly to [69], only the overall success or fail in providing a service is considered. Authors present also a set of experimental results, which confirm improvements in terms of resource allocation efficiency, system completion time, and aggregated resource utilization.…”

“…Differently by our proposal, in order to contrast malicious activities, we may refer to the proposal in [69], which implements some suitable strategies in the trust system. Moreover, in computing reputation measures, only our proposal provides a different weight to the opinions of the less affordable nodes.…”

A clustering based coscheduling strategy for efficient scientific workflow execution in cloud computing

“…Because workflow is an important abstraction for performing scientific experiments in computational environments, the problem of scheduling scientific workflows has been intensively studied in both traditional grid computing and current cloud computing environments. For example, Rahman et al [18] presented a reputation-based grid workflow scheduling algorithm which can dynamically adapt to changing resource conditions and achieve good performance. In [19], a QoS-based scheduling algorithm using the partial critical paths is proposed with the goal of minimizing the cost of workflow execution while fulfilling Service Level Agreements (SLAs) in utility grids.…”

Reliable workflow execution in distributed systems for cost efficiency

“…The degree of reliability in [22] was measured based on their reliability cost function. In [19], a reputation-based grid workflow scheduling algorithm was presented to deal with unreliability of grid resources. What distinguishes our work from them is that it explicitly correlating costs with reliability in its decision making process.…”