Dual Communication Network in Program Control Based on Global Application State Monitoring

We discuss the efficiency of a novel parallel/distributed application control method, based on global state monitoring. Processes report their local states to monitors. The monitors construct global states, analyze them and send control signals to processes when necessary. The addition of a special fast control network, responsible for transferring control information, is proposed in this paper. The efficiency is tested in simulation of sample branch and bound parallel computations. We show, that multicast capability of a network plays an important role in the resulting system efficiency. Other network parameters, such as latency or bandwidth, are significant only under proper conditions. We identify these conditions, demonstrating that 5-9 times speedup can be obtained by addition of a fast control network.

[1]  Janusz Borkowski.  Interrupt and Cancellation as Synchronization Methods , 2001, PPAM.

[2]  Scott D. Stoller,et al.  Detecting global predicates in distributed systems with clocks , 1997, Distributed Computing.

[3]  Marek Tudruj,et al.  Parallel Irregular Computations Control Based on Global Predicate Monitoring , 2006, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06).

[4]  J. Borkowski.  Parallel program control based on hierarchically detected consistent global states , 2004, Parallel Computing in Electrical Engineering, 2004. International Conference on.

[5]  Péter Kacsuk,et al.  The GRED graphical editor for the GRADE parallel program development environment , 1998, Future Gener. Comput. Syst..

[6]  Ozalp Babaoglu,et al.  Consistent global states of distributed systems: fundamental concepts and mechanisms , 1993 .

[7]  Janusz Borkowski.  Measuring and improving quality of parallel application monitoring based on global states , 2005, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05).

[8]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[9]  Reza Zamani,et al.  Myrinet networks: a performance study , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[10]  Péter Kacsuk,et al.  GRADE: A graphical programming environment for PVM applications , 1997, PDP.

[11]  Steven L. Scott,et al.  Synchronization and communication in the T3E multiprocessor , 1996, ASPLOS VII.

[12]  H. Trienekens.  Parallel branch and bound and anomalies , 1989 .

[13]  Deborah Estrin,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Fine-grained Network Time Synchronization Using Reference Broadcasts , 2022 .

[14]  Marek Tudruj,et al.  Graphical design of Parallel Programs with Control Based on Global Applications States using an Extended P-GRADE System , 2004, DAPSYS.

[15]  Christodoulos A. Floudas,et al.  Distributed Branch and Bound Algorithms for Global Optimization , 1999 .

[16]  Anthony Skjellum,et al.  A synchronized real-time linux based myrinet cluster for deterministic high performance computing and MPI/RT , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[17]  Janusz Borkowski,et al.  Global Predicates for Online Control of Distributed Applications , 2003, PPAM.

[18]  Gabriella Kókai,et al.  GIDTS: a graphical programming environment for Prolog , 1999, PASTE '99.

[19]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[20]  David L. Mills,et al.  Network Time Protocol (Version 3) Specification, Implementation and Analysis , 1992, RFC.