VIATRA2/Benchmarks

Mutual exclusion (A Varró benchmark)

Benchmark description

The Varró benchmark suite defines a set of transformations on which many transformation systems have been measured. One part of this benchmark suite is based on a distributed mutual exclusion algorithm. This section will introduce the implementation of the library of graph transformation rules that make up the benchmark. Furthermore, the transformation machines are also given that implement the long transformation sequence (LTS) and short transformation sequence (STS) algorithms outlined in the benchmark suite. Finally, some measurements are presented.

The mutual exclusion test case describes a process ring arbitrating control of resources. After growing the process ring to the required size, the STS version creates one resource that is owned by one process; in the next phase, every process issues a request on that resource; the resource will be passed along the ring until a full cycle is performed. LTS starts with a complete ring and a separate resource owned by every process; the whole set of resources is shifted along the process ring once in each cycle, involving waiting and blocked processes, as well as a deadlock-resolving algorithm. The ring size is the characteristic parameter in both cases; for LTS, the number of executed cycles can also be specified.

For a detailed test specification, see the following article:

Varró G., Schürr, A., Varró D.: Benchmarking for graph transformation. In: Proc. IEEE
Symposium on Visual Languages and Human-Centric Computing (VL/HCC 05), Dallas,
Texas, USA, IEEE Press (September 2005) 79–88

Or visit this page: Varró Gergely: Graph transformation benchmarks

Petri-net model simulation benchmark

TODO

Object-relational mapping benchmark

TODO

Sierpiński triangles benchmark (AGTIVE 2007)

TODO