Skip to main content
SpringerLink
Log in

Implementing dataflow with threads

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

A general algorithm is presented for implementing dataflow computations with multiple threads that communicate using only reads and writes of shared memory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alpha Architecture Committee: Alpha Architecture Reference Manual, 3rd edn. Digital Press, Boston (1998)

  2. Commoner F., Holt A.W., Even S., Pnueli A.: Marked directed graphs. J. Comput. Syst. Sci. 5(6), 511–523 (1971)

    MATH  MathSciNet  Google Scholar 

  3. Dijkstra E.W.: Cooperating sequential processes. In: Genuys, F.(eds) Programming Languages, Academic Press, New York (1968)

    Google Scholar 

  4. Hill, J.M.D., Skillicorn, D.B.: Practical barrier synchronisation. In: 6th Euromicro Workshop on Parallel and Distributed Processing. IEEE, Computer Society Press (1998)

  5. Lamport, L.: The + CAL algorithm language. URL http://research.microsoft.com/users/lamport/tla/pluscal.html. The page can also be found by searching the Web for the 25-letter string obtained by removing the “–” from uid-lamportpluscalhomepage.

  6. Lamport L.: Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3(2), 125–143 (1977)

    Article  MathSciNet  Google Scholar 

  7. Lamport L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28(9), 690–691 (1979)

    Article  Google Scholar 

  8. Lamport L.: On interprocess communication. Distrib. Comput. 1, 77–101 (1986)

    Article  MATH  Google Scholar 

  9. Lamport L.: Arbiter-free synchronization. Distrib. Comput. 16(2–3), 219–237 (2003)

    Article  Google Scholar 

  10. Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2003). Also available on the Web via a link at http://lamport.org

  11. Lamport, L., Schneider, F.B.: Pretending atomicity. Research Report 44, Digital Equipment Corporation, Systems Research Center (1989)

  12. Mellor-Crummey J.M., Scott M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 272–314 (1991)

    Article  Google Scholar 

  13. Reisig W.: Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer, Heidelberg (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, 1065 La Avenida, Mountain View, CA, 94043, USA

    Leslie Lamport

Authors
  1. Leslie Lamport
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leslie Lamport.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lamport, L. Implementing dataflow with threads. Distrib. Comput. 21, 163–181 (2008). https://doi.org/10.1007/s00446-008-0065-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-008-0065-1

Keywords

Search

Navigation