Efficient parallel computing with memory faults

DOI10.1007/BFB0036183MaRDI QIDQ5055934zbMATH OpenOpenAlexFDO

Authors Leszek Gąsieniec, Piotr Indyk

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0036183

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1998328
• Achieving optimal CRCW PRAM fault-tolerance
• Reliable computations on faulty EREW PRAM
• Fault-tolerant shared memory simulations
• Fast deterministic simulation of computations on faulty parallel machines

Cites work

• A guided tour of Chernoff bounds
• Computing with faulty shared memory (extended abstract)
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Efficient parallel algorithms can be made robust
• Explicit construction of linear sized tolerant networks
• Explicit constructions of linear-sized superconcentrators
• Fast deterministic simulation of computations on faulty parallel machines
• Fault-tolerant shared memory simulations
• scientific article; zbMATH DE number 437558 (Why is no real title available?)
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 2102780 (Why is no real title available?)
• scientific article; zbMATH DE number 794259 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• On word-level parallelism in fault-tolerant computing
• Parallel Algorithms with Processor Failures and Delays
• Ramanujan graphs
• Recursive Star-Tree Parallel Data Structure
• Reliable computations on faulty EREW PRAM
• The log-star revolution

Cited in

(4)

• On word-level parallelism in fault-tolerant computing
• On the cost of recomputing: tight bounds on pebbling with faults
• scientific article; zbMATH DE number 794259 (Why is no real title available?)
• Reliable computations on faulty EREW PRAM

This page was built for publication: Efficient parallel computing with memory faults

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