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

DOI10.1016/S0304-3975(97)00206-5zbMATH Open0902.68010OpenAlexW2087760679MaRDI QIDQ1128734FDOQ1128734

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

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

zbMATH Keywords

distributedfault-tolerantatomic actionbag of tasksdata-intensiveremote procedure call

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The PVM concurrent computing system: Evolution, experiences, and trends
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementation of fault-tolerant GridRPC applications
• Title not available (Why is that?)

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)