On word-level parallelism in fault-tolerant computing

DOI10.1007/3-540-60922-9_17MaRDI QIDQ4593929zbMATH OpenOpenAlexFDO

Authors Piotr Indyk

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60922-9_17

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Efficient parallel computing with memory faults
• scientific article; zbMATH DE number 1998328
• Achieving optimal CRCW PRAM fault-tolerance
• scientific article; zbMATH DE number 794259
• scientific article; zbMATH DE number 426330

Cited in

(8)

• Sorting and searching in faulty memories
• The price of resiliency: a case study on sorting with memory faults
• Optimal resilient sorting and searching in the presence of memory faults
• scientific article; zbMATH DE number 426330 (Why is no real title available?)
• scientific article; zbMATH DE number 1033646 (Why is no real title available?)
• Designing reliable algorithms in unreliable memories
• scientific article; zbMATH DE number 4113967 (Why is no real title available?)
• Efficient parallel computing with memory faults

This page was built for publication: On word-level parallelism in fault-tolerant computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593929)