Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal

DOI10.1007/BF02090403zbMath0732.68018OpenAlexW2078952543MaRDI QIDQ3358214

Yuh-Dauh Lyuu

Publication date: 1991

Published in: Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

hypercuberoutingfault-tolerant parallel communicationInformation Dispersal Algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to share a secret
• Complexity of network synchronization
• Efficient dispersal of information for security, load balancing, and fault tolerance
• A Scheme for Fast Parallel Communication
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal