Performance of fault-tolerant data and compute intensive programs over a network of workstations

DOI10.1016/S0304-3975(97)00206-5MaRDI QIDQ1128734zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00206-5

zbMATH Keywords

distributedfault-tolerantatomic actionbag of tasksdata-intensiveremote procedure call

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1760113
• On an Optimally Fault-Tolerant Multiprocessor Network Architecture
• Reliability analysis and fault tolerance for hypercube multi-computer networks
• scientific article; zbMATH DE number 4058841
• Organization of fault- and failure-tolerant computations in completely connected multicomputer systems

Cites work

• scientific article; zbMATH DE number 6118212 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 482761 (Why is no real title available?)
• scientific article; zbMATH DE number 814820 (Why is no real title available?)
• scientific article; zbMATH DE number 839542 (Why is no real title available?)
• The PVM concurrent computing system: Evolution, experiences, and trends

Cited in

(4)

• scientific article; zbMATH DE number 1948457 (Why is no real title available?)
• scientific article; zbMATH DE number 1760113 (Why is no real title available?)
• Implementation of fault-tolerant GridRPC applications
• scientific article; zbMATH DE number 1863327 (Why is no real title available?)

This page was built for publication: Performance of fault-tolerant data and compute intensive programs over a network of workstations

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