PERFORMANCE OPTIMIZATION OF EXHAUSTIVE RULES IN GRAPH REWRITING SYSTEMS

Tamás Mészáros, Márk Asztalos, Gergely Mezei, Hassan Charaf

Abstract

Graph rewriting-based model transformation is a well known technique with strong mathematical background to process domain specific models represented as graphs. The performance optimization techniques realized in today’s graph transformation engines usually place focus on the optimization of a single execution of the individual rules, and do not consider the optimization possibilities in the repeated execution. In this paper we present a performance optimization technique called deep exhaustive matching for exhaustively executed rules. Deep exhaustive matching continues the matching of the same rule from the next possible position after a successful rewriting phase, thus we can achieve noticeable performance gain.

References

  1. Ehrig, H., Ehrig, K., Prange, U., and Taentzer, G. (2006). Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science). An EATCS Series. Springer-Verlag New York, Inc., Secaucus, NJ, USA.
  2. Geiß, R., Batz, G. V., Grund, D., Hack, S., and Szalkowski, A. (2006). Grgen: A fast spo-based graph rewriting tool. In ICGT, pages 383-397.
  3. OMG (2006). Object Constraint Language, version 2.0. http://www.omg.org/technology/documents/formal/ ocl.htm.
  4. Varró, G. and Varró, D. (2004). Graph transformation with incremental updates. In Proc. GT-VMT 2004, International Workshop on Graph Transformation and Visual Modelling Techniques, volume 109 of ENTCS, pages 71-83. Elsevier.
  5. Varró, G., Varró, D., and Friedl, K. (2006). Adaptive graph pattern matching for model transformations using model-sensitive search plans. In Karsai, G. and Taentzer, G., editors, GraMot 2005, International Workshop on Graph and Model Transformations, volume 152 of ENTCS, pages 191-205. Elsevier.
  6. Zündorf, A. (1996). Graph pattern matching in progres. In Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science, pages 454-468, London, UK. SpringerVerlag.
Download


Paper Citation


in Harvard Style

Mészáros T., Asztalos M., Mezei G. and Charaf H. (2010). PERFORMANCE OPTIMIZATION OF EXHAUSTIVE RULES IN GRAPH REWRITING SYSTEMS . In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-989-8425-23-2, pages 292-295. DOI: 10.5220/0003008402920295


in Bibtex Style

@conference{icsoft10,
author={Tamás Mészáros and Márk Asztalos and Gergely Mezei and Hassan Charaf},
title={PERFORMANCE OPTIMIZATION OF EXHAUSTIVE RULES IN GRAPH REWRITING SYSTEMS},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2010},
pages={292-295},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003008402920295},
isbn={978-989-8425-23-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - PERFORMANCE OPTIMIZATION OF EXHAUSTIVE RULES IN GRAPH REWRITING SYSTEMS
SN - 978-989-8425-23-2
AU - Mészáros T.
AU - Asztalos M.
AU - Mezei G.
AU - Charaf H.
PY - 2010
SP - 292
EP - 295
DO - 10.5220/0003008402920295