LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 238-240 of 486
-
Probabilistic Analysis of a Network Resource Allocation Algorithm
(1985-06)A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, one allocated, are never ... -
Electing a Leader in a Synchronous Ring
(1985-07)We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results. One the one hand, we show that if processor ID's are chosen from some countable set, then ... -
Reaching Approximate Agreement in the Presence of Faults
(1985-05)This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Booleann values or values from some bounded range, and in which approximate, rather than ...


