Parallel and Distributed Computing Combinatorial Algorithms

Abstract

The first methods for tolerating more than a small number of worst- case faults in commonly-Lised networks such as the butterfly, the mesh of trees, and other hypercubic networks. Previously, work on the fault-tolerance properties of these networks was limited to showing how to overcome a single fault by adding an extra stage of hardware to the networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1993
Accession Number
ADA277333

Entities

People

  • Tom Leighton

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Distributed Computing
  • Electrical Engineering
  • Fault Tolerance
  • Geometry
  • Graph Theory
  • Integer Programming
  • Lepidoptera
  • Mathematics
  • Operations Research
  • Parallel Computing
  • Theoretical Computer Science
  • Three Dimensional
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Parallel and Distributed Computing.