Welcome to the InfoSci Platform
Reference Hub7
The Strict Strong Coloring Based Graph Distribution Algorithm

The Strict Strong Coloring Based Graph Distribution Algorithm

Nousseiba Guidoum, Meriem Bensouyad, Djamel-Eddine Saïdouni
Copyright: © 2013 |Volume: 4 |Issue: 1 |Pages: 17
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466631182|DOI: 10.4018/jamc.2013010104
Cite Article Cite Article

MLA

Guidoum, Nousseiba, et al. "The Strict Strong Coloring Based Graph Distribution Algorithm." IJAMC vol.4, no.1 2013: pp.50-66. http://doi.org/10.4018/jamc.2013010104

APA

Guidoum, N., Bensouyad, M., & Saïdouni, D. (2013). The Strict Strong Coloring Based Graph Distribution Algorithm. International Journal of Applied Metaheuristic Computing (IJAMC), 4(1), 50-66. http://doi.org/10.4018/jamc.2013010104

Chicago

Guidoum, Nousseiba, Meriem Bensouyad, and Djamel-Eddine Saïdouni. "The Strict Strong Coloring Based Graph Distribution Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC) 4, no.1: 50-66. http://doi.org/10.4018/jamc.2013010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

State space explosion is a fundamental obstacle in formal verification of concurrent systems. As a solution for this problem, this paper deals with distributed state space. The authors’ solution is to introduce the coloring concept and dominance relation in graphs for finding the good distribution of given graphs. This basic solution is improved in two steps: the initialization and optimization step. The authors also report on a thorough experimental study to evaluate the performance of this new algorithm which depends strongly on the size, nature of the graphs, and the chosen number of workers. In addition, the quality of this algorithm is illustrated by comparison with the hash function (MD5) based algorithm. To the best of the authors’ knowledge, it is the first time when coloring concept is used to solve this problem.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.