Detecting Distributed Predicates Using Genetic Algorithms

View Sample PDF

Author(s): Eslam Al Maghayreh (Computer Sciences Department, Yarmouk University, Irbid, Jordan), Iyad Abu Doush (Computer Sciences Department, Yarmouk University, Irbid, Jordan)and Faisal Alkhateeb (Computer Sciences Department, Yarmouk University, Irbid, Jordan)
Copyright: 2013
Volume: 9
Issue: 1
Pages: 15
Source title: International Journal of Intelligent Information Technologies (IJIIT)
Editor(s)-in-Chief: Vijayan Sugumaran (Oakland University, Rochester, USA)
DOI: 10.4018/jiit.2013010104

Keywords: Artificial Intelligence / Computer Science & IT / Information Science Reference

Purchase

View Detecting Distributed Predicates Using Genetic Algorithms on the publisher's website for pricing and purchasing information.

Abstract

Detection of distributed predicates is one of the techniques that have been used in the literature to improve the dependability of distributed programs. This technique (sometimes referred to as runtime verification) is used to verify that a given run of a distributed program satisfies certain properties (specified as predicates). In general, the detection of a distributed predicate can incur significant overhead due to the existence of multiple processes running concurrently. Several techniques have been introduced in the literature to efficiently detect distributed predicates. However, most of these techniques work efficiently for certain classes of predicates, like conjunctive predicates. In this paper, the authors have presented a technique based on genetic algorithms to efficiently detect distributed predicates under the possibly modality. The authors have used JGAP (Java Genetic Algorithms Package) to implement the algorithm and conducted several experiments to demonstrate its effectiveness.

The IRMA Community

Research IRM

Detecting Distributed Predicates Using Genetic Algorithms

Purchase

Abstract

Related Content

IRMA Sponsors