Glossary entry (derived from question below)
English term or phrase:
Byzantine failure
Turkish translation:
Bizans hatası
English term
Byzantine failure
Şimdiden çok teşekkürler.
4 +1 | Bizans hatası | TheTranslator86 |
5 | Bizans başarısızlığı | Salih YILDIRIM |
4 | Bizans hata toleransı | Emin Arı |
4 | Bizans hatası | M. Alper Kirtil |
Proposed translations
Bizans hatası
Dediğiniz gibi Byzantine fault tolerance ayrı bir şey.
Bizans hata toleransı
Byzantine fault tolerance is a sub-field of error tolerance research inspired by the Byzantine Generals' Problem, which is a generalized version of the Two Generals' Problem.
Two Generals' Problem
In computing, the Two Generals' Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. It is related to the more general Byzantine Generals' Problem (though published long before that later generalization) and appears often in introductory classes about computer networking (particularly with regards to the Transmission Control Protocol), though it can also apply to other types of communication. It is also an important concept in epistemic logic, and the importance of common knowledge. Some authors refer to this as the Two Army Problem or the Coordinated Attack Problem.
"When a Byzantine failure has occurred, the system may respond in any unpredictable way, unless it is designed to have Byzantine fault tolerance." Wikipedia'daki Byzantine fault tolerance başlığından alıntı. Yani bir failure var, bir de onun toleransı var ve ayrı kavramlar diye anlıyorum. |
Bizans başarısızlığı
Bizans hatası
Most of the work in the area has focused on detecting and correcting fail-stop errors. We propose a system that will also detect more general error models, such as Byzantine errors, thus allowing existing failure recovery methods to handle them correctly.
in a network consisting of n processors with up to t Byzantine failures, such that t < n/3. For large enough L, communication complexity of the proposed algorithm becomes O(nL) bits, linear in the number of processors.
Discussion