Global predicate monitoring applied for control of parallel irregular computations

Many computational problems have irregular data/control characteristics, which make programs difficult to be efficiently implemented in parallel systems. Due to irregular character of code or data, even division of work between processors at application startup is frequently impossible. Runtime optimization is possible, but it requires a constant exchange of control information and/or data during runtime is required. A novel parallel application control method is proposed in the paper. It is based on application global state monitoring for runtime irregular application control. The method provides a ready-to-use control infrastructure, which can be conveniently applied by a programmer. Both suitability and efficiency of the proposed control method are discussed in the paper based on two selected numerical applications: adaptive integration and branch and bound search. The presented experimental results were obtained with PS-GRADE graphical parallel design system, which embeds the proposed control method. The results confirm the efficiency of control based on global predicates in irregular computations

[1]  Jimmy Su,et al.  Automatic support for irregular computations in a high-level language , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

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

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

[4]  Alan L. Cox,et al.  Software versus hardware shared-memory implementation: a case study , 1994, ISCA '94.

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

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

[7]  Leonid Oliker,et al.  Parallel Computing Strategies for Irregular Algorithms , 2002 .

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

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

[10]  Nicholas Carriero,et al.  Linda in context , 1989, CACM.

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

[12]  Per Brinch Hansen.  The search for simplicity - essays in parallel programming , 1996 .

[13]  Leonid Oliker,et al.  Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems , 2000, IPDPS Workshops.

[14]  P. Brinch-Hansen,et al.  The programming language Concurrent Pascal , 1975 .

[15]  Rudolf Schürer.  Optimal Communication Interval for Parallel Adaptive Integration , 2002, Scalable Comput. Pract. Exp..

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

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

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

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

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