Two Generals' Problem: Difference between revisions

Revision as of 04:32, 24 October 2022

Revision as of 16:15, 19 December 2022

Line 66:

}}</ref> where it is described starting on page 73 in the context of communication between two groups of gangsters.

This problem was given the name the ''Two Generals Paradox'' by [[Jim Gray (computer scientist)|Jim Gray]]<ref>{{cite web|url=http://research.microsoft.com/~Gray/JimGrayHomePageSummary.htm |title=Jim Gray Summary Home Page |publisher=Research.microsoft.com |date=2004-05-03 |accessdate=2010-03-19}}</ref> in 1978 in "Notes on Data Base Operating Systems"<ref>{{cite book|author=R. Bayer, R. M. Graham, and G. Seegmüller|year=1978|title=Operating Systems|pages=393–481|publisher=Springer-Verlag|isbn=0-387-09812-7}}
Online version: {{cite book|url=http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=723863 |title=Notes on Data Base Operating Systems |date=January 1978 |pages=393–481 |publisher=Portal.acm.org |isbn=9783540087557 |accessdate=2010-03-19}}</ref> starting on page 465. This reference is widely given as a source for the definition of the problem and the impossibility proof, though both were published previously as mentioned above.

==References==