Modelle der Fehlertoleranz in Nachrichten-gekoppelten Parallelrechnern

@inproceedings{Seidel1988ModelleDF,
  title={Modelle der Fehlertoleranz in Nachrichten-gekoppelten Parallelrechnern},
  author={Winfried Seidel},
  booktitle={GI Jahrestagung},
  year={1988}
}
  • W. Seidel
  • Published in GI Jahrestagung 17 October 1988
  • Philosophy, Computer Science
Parallelrechnerarchitekturen werden in Zukunft eine wesentliche Rolle bei der Realisierung von hoherer Rechenleistung spielen. Mit diesem Artikel wird ein Konzept vorgestellt, das den Aspekt der Fehlertoleranz in dieser neu aufkommenden Rechnerklasse konkretisiert und Losungsansitze zu hier bestehenden Problemen bietet. Den Ausgangspunkt bildet die Verwendung von lose gekoppelten Prozessorelementen, die durch ein Message-Passing-Betriebssystem verwaltet werden. Mit diesen Systemeigenschaften… 
1 Citations

Self-Diagnosis, Reconfiguration and Recovery in the Dynamical Reconfigurable Multiprocessor Systemn DAMP

The fault tolerance concept for the dynamical reconfigurable multiprocessor system DAMP currently under development at the University of Paderborn is introduced and the distributed self-diagnosis, reconfiguration and recovery techniques are described in some detail.

References

SHOWING 1-10 OF 63 REFERENCES

Fehlermodellierung bei Simulation und Verifikation von Fehlertoleranz-Algorithmen für verteilte Systeme

  • K. Echtle
  • Philosophy, Computer Science
    Software-Fehlertoleranz und -Zuverlässigkeit
  • 1984
Diese Arbeit stellt zwei Fehlermodellierungs-Techniken gegenuber: die Aufzăhlung konkreter Fehlermoglichkeiten einerseits und den Verzicht auf die Spezifikation der Funktion ausgefallener Moduln

The Byzantine Generals Problem

It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.

On the minimal synchronism needed for distributed consensus

The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others, and several critical system parameters, including various synchronicity conditions, are identified.

Modular redundancy in a message passing system

  • L. Mancini
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1986
Modular redundancy in the form of replicated computations in a concurrent programming model consisting of communicating sequential processes is investigated, allowing redundant systems to be robust with respect to failures in redundant processors, and also permits the use of software fault tolerance techniques such as N-version programming.

The distributed V kernel and its performance for diskless workstations

It is concluded that it is feasible to build a distributed system with all network communication using the V message facility even when most of the network nodes have no secondary storage.

Consensus in the presence of partial synchrony

Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time.

Fault-tolerant systems

Distributed Computing: Models and Methods

  • L. LamportN. Lynch
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Literaturverzeichnis.

BLEULER, E. Lehrb. d. Psychiatrie. 4 Aufl. Berlin 1923. BODEWIG, E. Mathematische Betrachtungen zur Rassenhygiene, insbesondere zur Sterilisation. BOWMAN, I(. M. and RAYMOND, ALICE F. Physical
...