Summary: Time Bounds for Decision Problems in the Presence
of Timing Uncertainty and Failures 1
Hagit Attiya and Taly Djerassi­Shintel
Computer Science Department, The Technion, Haifa 32000, Israel
This paper studies the time complexity of solving decision problems in
a distributed message­passing system, when there is inexact information
about time and process failures. A semi­synchronous model is assumed,
in which the amount of (real) time between two consecutive steps of a
nonfaulty process is at least c1 and at most c2 ; a message sent by a nonfaulty
process is delivered within time at most d. Faulty processes do not always
obey the timing requirements on their steps and on messages they send
(late timing failures).
We present a new stretching technique for deriving lower bounds in the
presence of late timing failures. The combination of the stretching tech­
nique with known results yields the following lower bounds for this model:
1. The worst­case running time of any comparison­based renaming al­
gorithm for p Ÿ n participants
is\Omega\Gamma/29 p c 2
c 1
d), when there are p \Gamma 1 late

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences