EconPapers    
Economics at your fingertips  
 

The Strict Strong Coloring Based Graph Distribution Algorithm

Nousseiba Guidoum, Meriem Bensouyad and Djamel-Eddine Saïdouni
Additional contact information
Nousseiba Guidoum: MISC Laboratory, University Mentouri Constantine, Constantine, Algeria
Meriem Bensouyad: MISC Laboratory, University Mentouri Constantine, Constantine, Algeria
Djamel-Eddine Saïdouni: MISC Laboratory, University Mentouri Constantine, Constantine, Algeria

International Journal of Applied Metaheuristic Computing (IJAMC), 2013, vol. 4, issue 1, 50-66

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jamc.2013010104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:4:y:2013:i:1:p:50-66

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().

 
Page updated 2025-03-19
Handle: RePEc:igg:jamc00:v:4:y:2013:i:1:p:50-66