Fault-Tolerance Scheduling by Using Rough Set Based Multi-checkpointing on Economic Grids

Bouyer, Asgarali; Abdullah, Abdul Hanan; Ebrahimpour, Hasan; Nasrollahi, Firouz

doi:10.1109/cse.2009.400

Cited by 5 publications

(8 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6] an economic grid multi check-pointing approach was proposed. It used Rough Set Theory to generate rules that allow the estimation of the failure probability of the node based on multiple inputs attributes, like the size of the task, the assigned node and the expected execution time.…”

Section: Fault Tolerance Techniquesmentioning

confidence: 99%

“…The approach in [6] used the technique of multi-checkpoint which periodically copies the checkpoint state to all the supporting nodes so that the task can be started immediately after failure at one of the supporting nodes. This technique generates extra overhead but provides better performance and resource usage than the Replication technique.…”

Section: Fault Tolerance Techniquesmentioning

confidence: 99%

“…The Replication technique execution time overhead is calculated by the same method introduced in [6].…”

Section: Fault Tolerance Techniquesmentioning

confidence: 99%

See 2 more Smart Citations

Economic grid fault tolerance scheduling using modified Genetic Algorithm

Alfoly

Abdelhalim

Senbel

2011

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)

View full text Add to dashboard Cite

Computational grids allow the sharing of geographically distributed resources in an efficient way, extending the boundaries of what we perceive as distributed computing. It is a fact that the computational grid nodes are not 100% secure from failure. Here comes a problem on how to handle failing nodes and effectively schedule and distribute the required work on the participating nodes and, in the same time, provide assurance that the task will be completed successfully. Additionally, when applying a recovery technique to an Economic Grid, the problem of maintaining the cost arises. In this paper, we propose an enhancement to a fault tolerance Genetic Algorithm (GA) using a checkpoint recovery technique. The enhancement focuses on finding a schedule which tries to minimize the running costs resulting from the overhead of implementing fault tolerance technique and in the same time tries to satisfy the quality constraints of the user. The results show that without adding these factors, the schedule running costs may be uncontrollable from the point of view of the grid owner.

show abstract

Section: Fault Tolerance Techniquesmentioning

confidence: 99%

Section: Fault Tolerance Techniquesmentioning

confidence: 99%

See 1 more Smart Citation

Economic grid fault tolerance scheduling using modified Genetic Algorithm

Alfoly

Abdelhalim

Senbel

2011

2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)

View full text Add to dashboard Cite

show abstract

“…Some of the techniques being applied efficiently in KDD-DM processes are related to Rough Set Theory [10,11], which is advantageous due to its flexibility and adaptability to different scenarios. This adaptability is demonstrated by the variety of related works found in the literature, including the process of evaluation of Complex Information Systems [12], learning in neural networks [13], analysis of Reconfigurable Manufacturing Systems (RMS) [14], solutions to problems in the field of investment [15], application to the Grid Scheduling Process [16], adjudication of bank credits [17], image processing [18], and the evaluation of business innovation capabilities [19]. Thus, the ability of these techniques to model a wide range of realworld situations, their efficiency in the resolution of various types of problems, and their wide range of applicability have been made manifest.…”

Section: Accepted M Manuscriptmentioning

confidence: 99%

“…Equivalence classes in the universe U, from r 2 , and the definition of the boundary in terms of whether the classes satisfy the concept or not.The following inner boundaries are obtained:B 1 = {2,3,5,8,11,16,17,19, 20} B 2 = {3, 20}…”

mentioning

confidence: 99%

Algorithm for the detection of outliers based on the theory of rough sets

Pérez

Berná-Martínez

Oliva

et al. 2015

Decision Support Systems

View full text Add to dashboard Cite

Outliers are objects that show abnormal behavior with respect to their context or that have unexpected values in some of their parameters. In decision-making processes, information quality is of the utmost importance. In specific applications, an outlying data element may represent an important deviation in a production process or a damaged sensor. Therefore, the ability to detect these elements could make the difference between making a correct or an incorrect decision. This task is complicated by the large sizes of typical databases. Due to their importance in search processes in large volumes of data, researchers pay special attention to the development of efficient outlier detection techniques. This article presents a computationally efficient algorithm for the detection of outliers in large volumes of information. This proposal is based on an extension of the mathematical framework upon which the basic theory of detection of outliers, founded on Rough Set Theory, has been constructed. From this starting point, current problems are analyzed; a detection method is proposed, along with a computational algorithm that allows the performance of outlier detection tasks with an almost-linear complexity. To illustrate its viability, the results of the application of the outlier-detection algorithm to the concrete example of a large database are presented. 1.-Introduction Decision support systems are computer-based programs that assist decision makers in effective and efficient decision-making. The proper functioning of these systems requires large amounts of precise, high-quality data. However, if the data contain abnormal, unrealistic or simply erroneous elements, it may misguide the decision-making process, thereby leading to incorrect Highlights • We propose a formal expansion to the theory of rough sets. • We propose an efficient algorithm for the detection of outliers. • We have implemented the algorithm and verified the theoretical results.

show abstract

Robust fault tolerant job scheduling approach in Grid environment

Balpande

Shrawankar

2014

2014 International Conference on Circuits, Systems, Communication and Information Technology Applications (CSCITA)

View full text Add to dashboard Cite

Fault-Tolerance Scheduling by Using Rough Set Based Multi-checkpointing on Economic Grids

Cited by 5 publications

References 17 publications

Economic grid fault tolerance scheduling using modified Genetic Algorithm

Economic grid fault tolerance scheduling using modified Genetic Algorithm

Algorithm for the detection of outliers based on the theory of rough sets

Robust fault tolerant job scheduling approach in Grid environment

Contact Info

Product

Resources

About