Publications
Detailed Information
Algorithm-Based Fault-tolerant Programming in Scientific Computation on Multiprocessors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Altmann, Jorn | - |
dc.contributor.author | Bohm, A. | - |
dc.date.accessioned | 2009-08-11T02:56:38Z | - |
dc.date.available | 2009-08-11T02:56:38Z | - |
dc.date.issued | 1995-01 | - |
dc.identifier.citation | Algorithm-Based Fault-tolerant Programming in Scientific Computation on Multiprocessors | en |
dc.identifier.uri | https://hdl.handle.net/10371/6890 | - |
dc.description.abstract | Efficient parallel algorithms proposed to solve many fundamental problems in scientific computation are sensitive to processor failures. Because of its low costs, algorithm-based fault tolerance is an interesting concept for introducing fault tolerance into existing multiprocessors. To facilitate fault-tolerant programming in scientific computation, we have modified and developed further an existing parallel run-time environment. In this paper the aspect of tuning known error processing techniques to the algorithm-based approach is primarily examined. Design issues for implementation and execution time overhead of a fault-tolerant application in our run-time environment are studied. In contrast to many other environments for parallel fault-tolerant programming, which use the master/slave programming model, our environment enables one to add fault tolerance to existing parallel applications in scientific computation | en |
dc.language.iso | en | - |
dc.publisher | IEEE PDP1995 | en |
dc.title | Algorithm-Based Fault-tolerant Programming in Scientific Computation on Multiprocessors | en |
dc.type | Conference Paper | en |
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.