|Parallel Allocation of the Distributed Software Using Node Label Controlled Graph Grammars|
L. Kotulski, kotulski(at)ii.uj.edu.pl
Jagiellonian University, Institute of Computer Science, Nawojki 11, 30-072 Cracow, Poland
Abstract. A distribution (and a partial replication) of the information, about the way of allocation software components, into a global computer network is necessary with respect of improvement an allocation efficiency and a system reliability. Graphs and their transformations seem to be natural formalism for description the mentioned problem, on condition that an allocation graph isn't maintained in one place (as a monolithic one). In the paper, we show that aedNLC graph grammar has enough descriptive power to coordinate parallel modification of a few local graphs (representing parts of system) in such a way that the global consistency of a distributed system specification be maintained.
preprint07.ps (2 034 K), preprint07.pdf (597 K)