Strongly consistent global states detection using relative clock errors

Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tool

Self Cite

Consistent Global State (CGS) monitoring is performed usually with the help of a central monitor. The monitor must receive process local state reports and handle them. In an on-line monitoring environment it can become easily overloaded. We consider CGS detection in a hierarchical way. Application processes are split into groups. Lower-level monitors communicate with an assigned process group and report partial results to the top-level monitor. The top-level monitor combines received data to form CGS. A few variants of hierarchical algorithms for Strongly CGS detection are devised, each variant uses different local clock synchronization pattern. The analysis shows that hierarchical CGS algorithms efficiently distribute network and computational load caused by CGS monitoring without introducing significant additional overhead. The analysis is confirmed by preliminary test results.

Section: B Using Relative Inter-group Clock Synchronization Qualitymentioning

confidence: 99%

Hierarchical Detection of Strongly Consistent Global States

Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tool

Self Cite

“…Using this relation it defines Strongly Consistent Global States (SCGS) of application processes [11][12][13]. It is not always that we want to compute strongly consistent global states of all processes in an application program.…”

Section: F Ig 1 Control Flow Diagram Of a S Ynchronizermentioning

confidence: 99%

Load Balancing with Migration Based on Synchronizers in PS-GRADE Graphical Tool

Tudruj

The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)

Koponski

Parallel application control based on application global states is a new concept realized in PS-GRADE.PS-GRADE is a graphical environment for parallel programming, which unifies message passing programming style with control based on global application states. Special processes called synchronizers are responsible for gathering process states, constructing application global states and issuing control signals when necessary to application processes. In this paper we show, how this mechanism can be used as a framework for implementing load balancing with process migration using several methods. With some of these methods, synchronizers collect strongly consistent states of processor loads in the system and workout load balancing decisions including process migration. Asynchronous control signals from synchronizers break current computations and cause a process to migrate onto a less loaded host. Another signal activates a target process and activates restoring of the captured state in it. With other methods we use a special PVM library -Dynamite PVM instead of a standard version. It extends PVM by checkpointing and process migration with full restoration of the process state.

Parallel Program Graphical Design with Program Execution Control Based on Global Application States

Tudruj

Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tool

Kopanski

A methodology for parallel programming in new graphical program design system (GRADE-S) based on global application state monitoring is presented. A proposal is given on how to prepare a parallel application for execution in new GRADE. A notation for skeleton versions of GRADE programs is explained. Then, an example of the Travelling Salesman Problem (TSP) parallel program is given. GUI in the new GRADE corresponding to the TSP program in the new GRADE is shown with the shots of corresponding windows.