Efficient parallel computing with memory faults

DOI10.1007/BFb0036183OpenAlexW1844950395MaRDI QIDQ5055934

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reliable computations on faulty EREW PRAM
• A guided tour of Chernoff bounds
• Explicit construction of linear sized tolerant networks
• Ramanujan graphs
• Explicit constructions of linear-sized superconcentrators
• Efficient parallel algorithms can be made robust
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Recursive Star-Tree Parallel Data Structure
• Fault-tolerant shared memory simulations
• On word-level parallelism in fault-tolerant computing
• Parallel Algorithms with Processor Failures and Delays
• The log-star revolution
• Computing with faulty shared memory
• Fast deterministic simulation of computations on faulty parallel machines

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