An incremental algorithm for high-performance runtime model consistency

6Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one of many possible target models. When either model is changed at runtime, the transformation is incrementally updated. We describe the theory underlying our approach, and show restrictions sufficient for a simple and efficient implementation. We demonstrate this implementation in Fiia.Net, our model-based toolkit for developing adaptive groupware. Developers using Fiia.Net control components and connections through a high-level conceptual runtime model. Meanwhile, the toolkit transparently maintains the underlying distributed system, and propagates failures back into the conceptual model. This approach provides high stability, and performance that is sufficiently fast for interactive applications. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wolfe, C., Graham, T. C. N., & Phillips, W. G. (2009). An incremental algorithm for high-performance runtime model consistency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5795 LNCS, pp. 357–371). https://doi.org/10.1007/978-3-642-04425-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free