Fault-tolerant static scheduling for grids

Fechner, Bernhard; Hönig, Udo; Keller, Jörg; Schiffmann, Wolfram

doi:10.1109/ipdps.2008.4536156

Cited by 14 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Workflow scheduling as well as workflow rescheduling are classical NP-complete problems [15], [21]. Therefore, many heuristic algorithms are proposed.…”

Section: Related Workmentioning

confidence: 99%

Preventing Temporal Violations in Scientific Workflows: Where and How

Liu

Yang

Jiang

et al. 2011

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Due to the dynamic nature of the underlying high-performance infrastructures for scientific workflows such as grid and cloud computing, failures of timely completion of important scientific activities, namely, temporal violations, often take place. Unlike conventional exception handling on functional failures, nonfunctional QoS failures such as temporal violations cannot be passively recovered. They need to be proactively prevented through dynamically monitoring and adjusting the temporal consistency states of scientific workflows at runtime. However, current research on workflow temporal verification mainly focuses on runtime monitoring, while the adjusting strategy for temporal consistency states, namely, temporal adjustment, has so far not been thoroughly investigated. For this issue, two fundamental problems of temporal adjustment, namely, where and how, are systematically analyzed and addressed in this paper. Specifically, a novel minimum probability time redundancy-based necessary and sufficient adjustment point selection strategy is proposed to address the problem of where and an innovative genetic-algorithm-based effective and efficient local rescheduling strategy is proposed to tackle the problem of how. The results of large-scale simulation experiments with generic workflows and specific real-world applications demonstrate that our temporal adjustment strategy can remarkably prevent the violations of both local and global temporal constraints in scientific workflows.

show abstract

“…Workflow scheduling as well as workflow rescheduling are classical NP-complete problems [15], [21]. Therefore, many heuristic algorithms are proposed.…”

Section: Related Workmentioning

confidence: 99%

Preventing Temporal Violations in Scientific Workflows: Where and How

Liu

Yang

Jiang

et al. 2011

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…Business process and workflow scheduling are known as classical NP-complete problems [Yu and Buyya 2006;Fechner et al 2008;Liu et al 2011]. When resource availability constraints need to be additionally considered, finding the optimal solution to the problem defined above is even computationally harder.…”

Section: Heuristic-based Scheduling Strategiesmentioning

confidence: 99%

“…The problem of mapping tasks onto given resources is known to be NP-complete Buyya 2005, 2006;Fechner et al 2008;Liu et al 2011]. Due to its complexity, lots of heuristic methods have been proposed to address some classical problems, such as job shop scheduling and queuing mechanisms for operating system.…”

Section: Related Workmentioning

confidence: 99%

Resource Management for Business Process Scheduling in the Presence of Availability Constraints

Liu

Zhao

et al. 2016

ACM Trans. Manage. Inf. Syst.

View full text Add to dashboard Cite

In the context of business process management, the resources required by business processes, such as workshop staff, manufacturing machines, etc., tend to follow certain availability patterns, due to maintenance cycles, work shifts and other factors. Such availability patterns heavily influence the efficiency and effectiveness of enterprise resource management. Most existing process scheduling and resource management approaches tend to tune the process structure to seek better resource utilisation, yet neglect the constraints on resource availability. In this article, we investigate the scheduling of business process instances in accordance with resource availability patterns, to find out how enterprise resources can be rationally and sufficiently used. Three heuristic-based planning strategies are proposed to maximise the process instance throughput together with another strategy based on a genetic algorithm. The performance of these strategies has been evaluated by conducting experiments of different settings and analysing the strategy characteristics.

show abstract

“…In [2] author use the equal-time partition strategy, which partitions the parallel task (w) into subtasks with workload (w k ) for machine (m k ) such that the same mean subtask completion time can be reached at each machine. In [3] a fault tolerant static scheduler for grid applications that uses task duplication is designed. If a processing unit crashes, then the work it would have to carry in the future must be distributed onto other processing units.…”

Section: Related Workmentioning

confidence: 99%

Failure-aware scheduling in grid considering Weibull failure distribution

Singh

Garg

2013

2013 International Conference on Recent Trends in Information Technology (ICRTIT)

View full text Add to dashboard Cite

In Grid computing environment, as the resources are more heterogeneous, geographically distributed, complex and owned by different organizations, they are more prone to failures. Application scheduling in such a environment is very crucial. Generally, during application/job scheduling only performance factor of resources are considered. But if a node with high computational power also have high failure rate, then there is no such benefit of allocating task to that node because every time a failure occurs it needs recovery and in turn costs in term of time. Thus, failure increases make-span for the job and decreases system/node performance. A node with comparatively lower computational capacity and lower failure rate may give better performance and reduced make-span. So it would be a great idea if we take into consideration failure rate and computational capacity of resources during scheduling. In this paper we have proposed an approach for scheduling the tasks. We recalculate the computational capacity of resources by finding the expected wasted time due to presence of failure and then the tasks are scheduled according to this new computational capacity. Here the failure of nodes is treated as to follow Weibull distribution.

show abstract

Fault-tolerant static scheduling for grids

Cited by 14 publications

References 9 publications

Preventing Temporal Violations in Scientific Workflows: Where and How

Preventing Temporal Violations in Scientific Workflows: Where and How

Resource Management for Business Process Scheduling in the Presence of Availability Constraints

Failure-aware scheduling in grid considering Weibull failure distribution

Contact Info

Product

Resources

About