Dependable High Performance Computing on a Parallel Sysplex Cluster

In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructure designed for high performance computing with efficient checkpointing mechanisms. As target platform an IBM Parallel Sysplex Cluster is used. We consider the satisfiability checking problem for boolean formulae as an example application from the realm of Symbolic Computation. Time measurements for an implementation of this application on top of the described system environment are given.

• Type: Conference
• Year: 2000
• Where: PDPTA
• Authors: Wolfgang Blochinger, Reinhard Bündgen, Andreas Heinemann
• Keywords: Parallel Sysplex Cluster, PDPTA 2000, PDPTA 2007, Satisfiability Checking Problem, Symbolic Computation