Data transfer analysis for a pair of asynchronous communication algorithms

Data transfer analysis for a pair of asynchronous communication algorithms

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A common form of asynchronous communication mechanism (ACM) provides a one-way data transfer connection between two concurrent processes in which the writer uses a control algorithm to release data within the mechanism and the reader uses a control algorithm to acquire data within the mechanism, without recourse to arbitration or exclusion which could impede the progress of either the writer or the reader. When execution of the control algorithms is distinct, the reader acquires the latest data item released by the writer. When execution of the control algorithms overlaps, the reader acquires either a data item which is being or has been released during the overlapped acquisition, or the data item which is the latest released prior to the start of acquisition. The particular data item acquired is determined by the interleaving of critical events in each algorithm. The paper formally analyses a pair of algorithms to determine the way in which the data item acquired depends on the precise ordering of interleaved algorithm events. New insights into the notion of data freshness in ACMs are gained, and the essential similarity between several well known pairs of control algorithms is exposed. The formal analysis of ACM algorithms complements the previously derived formal specifications for such ACMs.


    1. 1)
    2. 2)
    3. 3)
      • Burns, J.E., Peterson, G.L.: `Constructing multi-reader atomic values from non-atomic values', Proc. 6th Annual ACM Symp. on Principles of Distributed Computing, 1987, p. 222–231.
    4. 4)
      • Simpson, H.R.: `Fully asynchronous communication', IEE Colloq. on Mascot in Real-Time Systems, 1987, IEE Colloquium Digest 58.
    5. 5)
      • H.R. Simpson . Four-slot fully asynchronous communication mechanism. IEE Proc. Comput. Digit. Tech. , 1 , 17 - 30
    6. 6)
      • Tromp, J.: `How to construct an atomic variable', Proc. 3rd Int. Workshop on distributed algorithms, 1989, p. 292–302.
    7. 7)
    8. 8)
    9. 9)
    10. 10)
      • F. Jahanian , A.K. Mok . Safety analysis of timing properties of real-time systems. IEEE Trans. , 9 , 890 - 904
    11. 11)
      • Jahanian, F., Mok, A.K., Stuart, D.A.: `Formal specification of real time systems', TR-88-25, Dept. Computer Sciences, 1988.
    12. 12)
      • H.R. Simpson . Correctness analysis for class of asynchronous communication mechanisms. IEE Proc. Comput. Digit. Tech. , 1 , 35 - 49
    13. 13)
      • T.J. Chaney , C.E. Molnar . Anomalous behavior of synchronizer and arbiter circuits. IEEE Trans. , 4 , 421 - 422
    14. 14)
    15. 15)
    16. 16)

Related content

This is a required field
Please enter a valid email address