Reconfiguration for fault tolerance using graph grammars

Abstract

Reconfiguration for fault tolerance is a widely studied field, but this work applies graph grammars to this discipline for the first time. Reconfiguration Graph Grammars (RGG) are defined and applied to the definition of processor array reconfiguration algorithms. The nodes of a graph are associated with the processors of a processor array, and the edges are associated with those interprocessor communication lines that are active. The resulting algorithms for dynamic (run-time) reconfiguration are efficient and can be implemented distributively.

Dynamic Software Reconfiguration in Sensor Networks

“…An approach to carry out reconfiguration for fault tolerance by applying graph grammars is suggested in [23]. The work suggests the use of Reconfiguration Graph The DJINN multimedia-programming framework is designed to support the construction and dynamic reconfiguration of distributed multimedia applications [24].…”