Skip to main content

2016 | OriginalPaper | Buchkapitel

A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm

verfasst von : Nousseiba Guidoum, Meriem Bensouyad, Djamel-Eddine Saïdouni

Erschienen in: Software Engineering Research, Management and Applications

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We consider the state space explosion problem which is a fundamental obstacle in formal verification of critical systems. In this paper, we propose a fast algorithm for distributing state spaces on a network of workstations. Our solution is an improvement version of SSCGDA algorithm (for Strict Strong Coloring based Graph Distribution Algorithm) which introduced the coloring concept and dominance relation in graphs for finding the good distribution of given graphs [1]. We report on a thorough experimental study to evaluate the performance of this new algorithm. The quality of the proposed algorithm is illustrated by comparison with existing algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Guidoum, N., Bensouyad, M., & Saïdouni, D. E. (2013). The strict strong coloring based graph distribution algorithm. International Journal of Applied Metaheuristic Computing, 4, 50–66.CrossRef Guidoum, N., Bensouyad, M., & Saïdouni, D. E. (2013). The strict strong coloring based graph distribution algorithm. International Journal of Applied Metaheuristic Computing, 4, 50–66.CrossRef
2.
Zurück zum Zitat Valmari, A. (1998). The state explosion problem. In Lectures on Petri Nets I: Basic Models: Of Lecture Notes in Computer Science (vol. 1491, pp. 429–528). London, UK. Valmari, A. (1998). The state explosion problem. In Lectures on Petri Nets I: Basic Models: Of Lecture Notes in Computer Science (vol. 1491, pp. 429–528). London, UK.
3.
Zurück zum Zitat Clarke, E., Grumberg, O., & Peled, D. (1999). Model checking. Cambridge, MA: The MIT Press. Clarke, E., Grumberg, O., & Peled, D. (1999). Model checking. Cambridge, MA: The MIT Press.
4.
Zurück zum Zitat Bérard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., et al. (2001). Systems and software verification: Model-checking techniques and tools. Springer. Bérard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., et al. (2001). Systems and software verification: Model-checking techniques and tools. Springer.
5.
Zurück zum Zitat Bixby, R., Kennedy, K., & Kremer, U. (1993). Automatic data layout using 0–1 integer programming, Houston, TX, United State: Rice University, Center for Research on Parallel Computation, Tech. Rep. CRPC-TR93349-S. Bixby, R., Kennedy, K., & Kremer, U. (1993). Automatic data layout using 01 integer programming, Houston, TX, United State: Rice University, Center for Research on Parallel Computation, Tech. Rep. CRPC-TR93349-S.
6.
Zurück zum Zitat Bouneb, Z., & Saïdouni, D. E. (2009). Parallel state space construction for a model checking based on maximality semantics. In Proceedings of the 2nd Mediterranean Conference on Intelligent Systems and Automation (vol. 1107, pp. 7–12). Bouneb, Z., & Saïdouni, D. E. (2009). Parallel state space construction for a model checking based on maximality semantics. In Proceedings of the 2nd Mediterranean Conference on Intelligent Systems and Automation (vol. 1107, pp. 7–12).
7.
Zurück zum Zitat Orzan, S., van de Pol, S., & Valero Espada, M. (2005). A state space distribution policy based on abstract interpretation. Electronic Notes in Theoretical Computer Science, 128(3), 35–45.CrossRefMATH Orzan, S., van de Pol, S., & Valero Espada, M. (2005). A state space distribution policy based on abstract interpretation. Electronic Notes in Theoretical Computer Science, 128(3), 35–45.CrossRefMATH
8.
Zurück zum Zitat Stanton, I., & Kliot, G. (2011). Streaming graph partitioning for large distributed graphs (Tech. Rep. MSR-TR-2011-121). Microsoft Research Lab. Stanton, I., & Kliot, G. (2011). Streaming graph partitioning for large distributed graphs (Tech. Rep. MSR-TR-2011-121). Microsoft Research Lab.
9.
Zurück zum Zitat Saad, R., Dal Zilio, S., Berthomieu, B,. & Vernadat, F. (2009). Enumerative parallel and distributed state space construction. In Ecoled’Eté Temps Réel (ETR’09), Paris, France. Saad, R., Dal Zilio, S., Berthomieu, B,. & Vernadat, F. (2009). Enumerative parallel and distributed state space construction. In Ecoled’Eté Temps Réel (ETR’09), Paris, France.
10.
Zurück zum Zitat Bensouyad, M., Bouzenada, M., Guidoum, N., & Saïdouni, D. E. (2014). A generalized graph strict strong coloring algorithm: Application on graph distribution. Contemporary Advancements in Information Technology Development in Dynamic Environments, 181. Bensouyad, M., Bouzenada, M., Guidoum, N., & Saïdouni, D. E. (2014). A generalized graph strict strong coloring algorithm: Application on graph distribution. Contemporary Advancements in Information Technology Development in Dynamic Environments, 181.
11.
Zurück zum Zitat Klotz, W. (2002). Graph coloring algorithms. Clausthal, Germany: Clausthal University of Technology, Tech. Rep. No. Klotz, W. (2002). Graph coloring algorithms. Clausthal, Germany: Clausthal University of Technology, Tech. Rep. No.
13.
Zurück zum Zitat ZverovichI, E. (2006). A new kind of graph coloring. Journal of Algorithms, 58(2), 118–133. ZverovichI, E. (2006). A new kind of graph coloring. Journal of Algorithms, 58(2), 118–133.
14.
15.
Zurück zum Zitat Bouzenada, M., Bensouyad, M., Guidoum, N., Reghioua, A., & Saïdouni, D. E. (2012). A generalized graph strict strong coloring algorithm. International Journal of Applied Metaheuristic Computing (IJAMC), 3(1), 24–33. Bouzenada, M., Bensouyad, M., Guidoum, N., Reghioua, A., & Saïdouni, D. E. (2012). A generalized graph strict strong coloring algorithm. International Journal of Applied Metaheuristic Computing (IJAMC), 3(1), 24–33.
19.
Zurück zum Zitat Grubbs, F. E. (1969). Procedures for detecting outlying observations in samples. Technometrics, 11(1), 1–21.CrossRef Grubbs, F. E. (1969). Procedures for detecting outlying observations in samples. Technometrics, 11(1), 1–21.CrossRef
Metadaten
Titel
A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm
verfasst von
Nousseiba Guidoum
Meriem Bensouyad
Djamel-Eddine Saïdouni
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-33903-0_11