Asynchronous protocols to meet real-time constraints: is it really sensible? How to proceed?

Hurfin, Michel; Raynal, Michel

doi:10.1109/isorc.1998.666800

Cited by 4 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of deferring the consideration of some MðSÞ until after having devised and proved some design Á in some MðÁÞ has been stated first in [16], echoed in [9] and [12], and detailed in [17], under the name of "design immersion" (in a computational model). This is equivalent to the concept of "late binding" (of a design to some computational model), a well-known concept in the field of programming languages.…”

Section: The "Late Binding" Principlementioning

confidence: 99%

See 1 more Smart Citation

Fast asynchronous uniform consensus in real-time distributed systems

Hermant

Lann

2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lack of bounded finite delays is antagonistic with timeliness requirements. We show how to circumvent this apparent contradiction, via the principle of "late binding" of a solution to some (partially) synchronous model. This principle is shown to maximize the coverage of demonstrated safety, liveness, and timeliness properties. These general results are illustrated with the Uniform Consensus (UC) and the Real-Time UC problems, assuming processor crashes and reliable communications, considering asynchronous solutions based upon Unreliable Failure Detectors. We introduce the concept of Fast Failure Detectors and we show that the problem of building Strong or Perfect Fast Failure Detectors in real systems can be stated as a distributed message scheduling problem. A generic solution to this problem is given, illustrated considering deterministic Ethernets. In passing, it is shown that, with our construction of Unreliable Failure Detectors, asynchronous algorithms that solve UC have a worst-case termination lower bound that matches the optimal synchronous lower bound, that is, ðt þ 1Þ D, where t is the maximum number of processors that may crash and D is the maximum interprocess message delay. Finally, we introduce FastUC, a novel solution to UC, that is based upon Fast Failure Detectors. FastUC has a worst-case termination time that is sublinear in t D. For most practical cases and common values of t, FastUC terminates in D, making it a worst-case time optimal solution to Real-Time UC.

show abstract

Section: The "Late Binding" Principlementioning

confidence: 99%

“…12 The chronologically ordered v p;q ð:Þ are those consecutive values that constitute set V p;q . Rather than traveling in 0 time units, a first FD-message may travel in time units.…”

Section: How To Establish Tight Dmentioning

confidence: 99%

Fast asynchronous uniform consensus in real-time distributed systems

Hermant

Lann

2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…The idea of deferring the consideration of some M(S) until after having devised and proved some design in some M( ) less "restrictive" than M(S) has been stated first in [12], echoed in [9] and [11], and detailed in [13], under the name of "design immersion" (in a computational model). This is equivalent to the concept of late binding (of a design to some computational model), a well known concept in the areas of programming languages and compilation.…”

Section: The Late Binding Principlementioning

confidence: 99%

Asynchrony and real-time dependable computing

Lann

Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).

View full text Add to dashboard Cite

show abstract

“…We conclude by highlighting that our configuration service has desirable properties for it to be "immersed" in a soft real-time system in the manner proposed in [9]. An object replica group can suffer a g-failure (group failure) even due to a sudden burst in network traffic that gives rise to virtual partitions.…”

Section: : Related Work and Relevancementioning

confidence: 99%

Enhancing replica management services to tolerate group failures

Ezhilchelvan

Shrivastava

Proceedings 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'99) (Cat. No.99-61702)

View full text Add to dashboard Cite

In a distributed system, replication of components, such as objects, is a well known way of achieving availability. For increased availability, crashed and disconnected components must be replaced by new components on available spare nodes. In this context, we address the problem of reconfiguring a group after the group as an entity has failed. Such a failure is termed a group failure which, for example, can be the crash of every component in the group or the group being partitioned into minority islands. The solution assumes crash-proof storage, and eventual recovery of crashed nodes and healing of partitions. It guarantees that (i) the number of groups reconfigured after a group failure is never more than one, and (ii) the reconfigured group contains a majority of the components which were members just before the group failed, so that the loss of state information due to group failure is minimal. The protocol is efficient in terms of communication rounds and use of stable store, during both normal operations and reconfiguration after a group failure.

show abstract

Asynchronous protocols to meet real-time constraints: is it really sensible? How to proceed?

Cited by 4 publications

References 19 publications

Fast asynchronous uniform consensus in real-time distributed systems

Fast asynchronous uniform consensus in real-time distributed systems

Asynchrony and real-time dependable computing

Enhancing replica management services to tolerate group failures

Contact Info

Product

Resources

About