IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v4y2013i1p50-66.html
   My bibliography  Save this article

The Strict Strong Coloring Based Graph Distribution Algorithm

Author

Listed:
  • 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)

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.

Suggested Citation

  • Nousseiba Guidoum & Meriem Bensouyad & Djamel-Eddine Saïdouni, 2013. "The Strict Strong Coloring Based Graph Distribution Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 4(1), pages 50-66, January.
    • Handle: RePEc:igg:jamc00:v:4:y:2013:i:1:p:50-66
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2013010104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:4:y:2013:i:1:p:50-66. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.