Transparent fault tolerance for scalable functional computation
From MaRDI portal
Publication:5371963
Recommendations
- scientific article; zbMATH DE number 1033646
- scientific article; zbMATH DE number 1863327
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Optimal fault-tolerant computing on multiprocessor systems
- Fault-tolerant functional reactive programming (extended version)
- Fault-tolerant distributed computing
Cites work
- scientific article; zbMATH DE number 3129315 (Why is no real title available?)
- scientific article; zbMATH DE number 967422 (Why is no real title available?)
- Fault tolerance via idempotence
- Freeze after writing, quasi-deterministic parallel programming with LVars
- MULTILISP: a language for concurrent symbolic computation
- Parallel functional programming in Eden
- Runtime support for multicore Haskell
- Sign changes in sums of the Liouville function
- Single Assignment C: efficient support for high-level array operations in a functional setting
- Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
- The n-Queens Problem
- Time, clocks, and the ordering of events in a distributed system
- Transparent fault tolerance for scalable functional computation
Cited in
(5)- Transparent fault tolerance for scalable functional computation
- scientific article; zbMATH DE number 1691456 (Why is no real title available?)
- Fault tolerance via idempotence
- scientific article; zbMATH DE number 1863327 (Why is no real title available?)
- Fault-tolerant functional reactive programming (extended version)
Describes a project that uses
Uses Software
This page was built for publication: Transparent fault tolerance for scalable functional computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371963)
