PLinda Persistent Linda (PLinda) provides a combination of checkpointing and transaction support on both shared data and program state (an encoding of continuations). The traditional transaction model is simplified and then extended to support robust parallel computation. Treatable failures include processor and main memory hard and slowdown failures, and network omission and corruption failures. The programmer can customize fault tolerance when constructing an application, trading failure-free performance against recovery time. When creating a PLinda program, the programmer can decide on the frequency of transactions and the encoding of continuations to be saved upon transaction commit. At runtime, the programmer can decide to suppress certain continuations for better failure-free performance. PLinda has been applied to particle simulation problems, bond option analysis, and biological pattern recognition.

Current Version:   2.6 License Type:   ??

Home Site: http://merv.cs.nyu.edu:8001/~binli/plinda/ Source Code Availability: Yes Available Binary Packages: Debian Package: No RedHat RPM Package: No Other Packages: No Targeted Platforms: Networks of heterogeneous workstations, such as SunOS, Solaris, SGI-IRIX, Dec/Alpha, Linux Software/Hardware Requirements: g++ 2.6.3 or 2.7.x

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Parallel Computing   |   Tools & Utilities