| P. Ver'issimo and L. Rodrigues. Order and Synchronism Properties of Reliable Broadcast Protocols. Technical Report RT/66-89, INESC, Lisboa, Portugal, December 1989. |
....those patterns in the expressions of T e and T i . From that, we determine the steadiness and tightness of the protocol. The second attribute of real time capability, besides achieving bounded and known execution times, is respecting temporal orderings of events. We discuss the matter in [19], and show it is intimately related to the grade of synchronism. As a general rule, synchronous clock less protocols are not able to achieve the fine degree of steadiness and tightness, that clock driven ones are, and this is also true of AMp. However, their ability to fulfill temporal order ....
....In fact, all we can say is that the achievable synchronism of clock less protocols is normally looser than their clock driven counterparts . By measuring the quality of synchronism by steadiness and tightness a metrics that applies equally to both classes of protocols we have shown in [19] that order properties of any protocol are related with its synchronism. In consequence, we extended the criteria of suitability for real time and fault tolerant applications, to clock less protocols. ....
P. Ver'issimo and L. Rodrigues. Order and Synchronism Properties of Reliable Broadcast Protocols. Technical Report RT/66-89, INESC, Lisboa, Portugal, December 1989.
....[13] have been pointed out earlier on as disturbance factors of theoretical models based on fully synchronous systems, and perfect and continuous clocks. A model for real time objects and a discussion on the impact of temporal uncertainties on total order protocols has been advanced in [12] In [22,26] it was proposed to match the granularity of computer derived orderings to the pace at which computer or physical processes evolve (ffi t precedence) A recent work [9] discusses how to match sparse timebases to ffi t precedent sets of events. This paper equates the time and order problems of ....
....messages, which can then be processed by independent threads, or to receive the same ten in some order, which requires them to be processed one at a time. 4. 3 The ffi t precedence order We recall a definition that will help us show how to take advantage of these facts in real settings [22,26]: ffi t precedence order ( ffi t ) An event a is said to ffi t precede an event b, a ffi t b, if t b Gamma t a ffi t . Since ffi t is the minimum real time interval for causal relations to be generated, ffi t precedence is the criterium for potential causality (which will not ....
P. Verssimo and L. Rodrigues. Order and synchronism properties of reliable broadcast protocols. Technical Report RT/66-89, INESC, Lisboa, Portugal, December 1989.
....and parallelism to the communication system, some protocols use knowledge about the way the applications are built to avoid imposing ordering constraints on all messages in the system. This way, messages are split in subsets, which are ordered independently, in what is called an incomplete order [24]. Another reason to support incomplete orders is that they allow the implementation of different levels of priorities in communications. Messages of the same priority could be delivered in causal order, but a message of high priority would not need to be delayed by a low priority message. It is ....
P. Verssimo and L. Rodrigues. Order and synchronism properties of reliable broadcast protocols. Technical Report RT/66-89, INESC, Lisboa, Portugal, December 1989.
....was driven by a number of goals: # Exploitation of technology offered by the network infrastructure. # Offer a versatile set of primitives that can satisfy all application requirements regarding group communication. ################## For a more detailed study the reader is referred to [Ver89a]. 340 Technical OpenForum 92 Utrecht, 23 27 November Fast Group Communication for Standard Workstations M LSE operating environment Abstract Network xAMp G S DIALOG SYNC Figure 1: Modules in the Group Communication Service # Highly responsive behavior of all primitives. # Entry points at ....
P. Verssimo and L. Rodrigues, "Order and Synchronism Properties of Reliable Broadcast Protocols," RT/66-89, INESC, Lisboa, Portugal (December 1989).
....and parallelism to the communication system, some protocols use knowledge about the way the applications are built to avoid imposing ordering constraints on all messages in the system. This way, messages are split in subsets, which are ordered independently, in what is called an incomplete order [24]. Another reason to support incomplete orders is that they 5 Naturally, it should always be possible to bypass the causality mechanisms for applications not wanting to pay the overhead. allow the implementation of different levels of priorities in communications. Messages of the same priority ....
P. Verssimo and L. Rodrigues. Order and synchronism properties of reliable broadcast protocols. Technical Report RT/66-89, INESC, Lisboa, Portugal, December 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC