Marker-directed Optimization of UnCAL Graph Transformations Soichiro
Marker-directed Optimization of UnCAL Graph Transformations Soichiro
复制标题
UnCAL 图转换的标记导向优化 Soichiro
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Isao Sasano
中科院分区：
文献类型：
--
作者：
S. Hidaka;Zhenjiang Hu;K. Inaba;H. Kato;Kazutaka;Matsuda;Keisuke Nakano;Isao Sasano
Buneman等。提出了一个基于结构递归的综合图转换的称为uncal（非结构化演算）的图形代数，我们最近应用于模型转换。代数的组成性质大大增强了转化的模块化。但是，组成的转换之间产生的中间结果导致开销。 Buneman等。提出的融合规则可以消除中间结果，但是到目前为止，辅助重写规则可以实现融合规则的实际应用。 Uncal Graph模型包括标记的概念，这些概念对应于结构递归中的递归功能调用。我们发现，基于静态分析，尤其是专注于标记的重写水平上有许多优化机会。该分析可以安全地消除冗余功能调用。绩效评估显示了其在模型转换中非平凡示例的实际有效性。
Buneman et al. proposed a graph algebra called UnCAL (Unstructured CALculus) for compositonal graph transformations based on structural recursion, and we have recently applied to model transformations. The compositional nature of the algebra greatly enhances the modularity of transformations. However, intermediate results generated between composed transformations cause overhead. Buneman et al. proposed fusion rules that eliminate the intermediate results, but auxiliary rewriting rules that enable the actual application of the fusion rules are not apparent so far. UnCAL graph model includes the concept of markers, which correspond to recursive function call in the structural recursion. We have found that there are many optimization opportunities at rewriting level based on static analysis, especially focusing on markers. The analysis can safely eliminate redundant function calls. Performance evaluation shows its practical effectiveness for non-trivial examples in model transformations.
DOI：
--
发表时间：
2004
期刊：
International Workshop on New Approaches to Software Construction(WNASC2004)
影响因子：
--
作者：
Z.Hu;K.Emoto;S-C Mu;M.Takeichi
通讯作者：
M.Takeichi