Advertisement

A Principled Semantics for inp

  • Jeremy L. Jacob
  • Alan M. Wood
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1906)

Abstract

The ‘predicated’ forms of the Linda in and rd primitives have given problems for both kernel implementors and Linda formalists. This paper firstly analyses these problems and then proposes a precise semantics for inp which is both reasonable, in that it does not admit unexpected or useless implementations, and implementable for open distributed tuple-space systems.

The semantics is given in a CSP style by the introduction of several new operators including kick-start, and deadlock-breaking concurrency which together enable a variety of well-defined, and feasibly implementable interpretations.

The paper includes a discussion of the implementation of these operators, and examples of the use of the resulting inp in practical coordination applications.

Keywords

Garbage Collection Communicate Sequential Process Elimination Rule Algebraic Semantic Stable Marriage 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Antonio Brogi and Jean-Marie Jacquet. On the expressiveness of coordination models. In Paolo Ciancarini and Alexander L. Wolf, editors, Coordination Languages and Models: Third International Conference, COORDINATION’ 99, number 1594 in Lecture Notes in Computer Science, pages 134–149, Berlin, April 1999. Springer.Google Scholar
  2. 2.
    N. Busi, R. Gorrieri, and G. Zavattaro. Three Semantics for the Output Operation for Generative Communication. In D. Garlan and D. Le Métayer, editors, Coordination Langauges and Models: Proceedings of the Second International Conference COORDINATION’ 97, volume LNCS 1282, pages 205–21. Springer, 1997.CrossRefGoogle Scholar
  3. 3.
    Nadia Busi and Gianluigi Zavattaro. Event notification in data-driven coordination languages: Comparing the ordered and unordered interpretations. In Janice Carroll, Ernesto Damiani, Hisham Haddad, and Dave Oppenheim, editors, Applied Computing 2000: Proceedings of the 2000 ACM Symposium on Applied Computing, volume 1, pages 233–239. ACM Press, March 2000.Google Scholar
  4. 4.
    Paul Butcher, Alan Wood, and Martin Atkins. Global Synchronisation in Linda. Concurrency: Practice and Experience, 6(6):505–516, 1994.CrossRefGoogle Scholar
  5. 5.
    N. Carriero and D. Gelernter. How to Write Parallel Programs: a First Course. MIT Press, 1990.Google Scholar
  6. 6.
    K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1988.zbMATHGoogle Scholar
  7. 7.
    Andrew Douglas, Alan Wood, and Antony Rowstron. Linda Implementation Revisited. In Transputer and occam Developments, pages 125–138. IOS Press, 1995.Google Scholar
  8. 8.
    David Gelernter and Nicholas Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97–107, 1992.CrossRefGoogle Scholar
  9. 9.
    C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice Hall International, Hemel Hempstead, 1985.zbMATHGoogle Scholar
  10. 10.
    C. A. R. Hoare and Jifeng He. Unifying Theories of Programming. Series in Computer Science. Prentice Hall, London, 1998.zbMATHGoogle Scholar
  11. 11.
    IBM. IBM TSpaces Programmer’s Guide. http://www.almaden.ibm.com/cs/TSpaces/html/ProgrGuide.html, 1999.
  12. 12.
    IBM. Untitled (TSpaces specification). http://www.almaden.ibm.com/cs/TSpaces/html/javadoc/index.html, 1999.
  13. 13.
    D. E. Knuth. Stable Marriage and its Relation to Other Combinatorial Problems: an introduction to the mathematical analysis of algorithms. American Mathematical Society, 1997.Google Scholar
  14. 14.
    Jeff Magee and Jeff Kramer. Concurrency: State models and Java programs. Worldwide Series in Computer Science. Wiley, Chichester, UK, 1999.zbMATHGoogle Scholar
  15. 15.
    Ronaldo Menezes. Ligia: Incorporating Garbage Collection in a Java based Lindalike Run-Time System. In Proceedings of the 2nd Workshop on Distributed Systems (WOSID’98), pages 81–88, 1998.Google Scholar
  16. 16.
    Ronaldo Menezes and Alan Wood. Garbage Collection in Open Distributed Tuple Space Systems. In Proc. 15th Brazilian Computer Networks Symposium-SBRC’ 97, pages 525–543, 1997.Google Scholar
  17. 17.
    Ronaldo Menezes and Alan Wood. Using Tuple Monitoring and Process Registration on the Implementation of Garbage Collection in open Linda-like Systems. In Proceedings of the Tenth IASTED International Conference: PDCS’98, pages 490–495. IASTED/Acta Press, 1998.Google Scholar
  18. 18.
    I. Merrick and A. M. Wood. Coordination with Scopes. Proc. ACM Symposium on Applied Computing, pages 210–217, 2000.Google Scholar
  19. 19.
    R. Milner. Communications and Concurrency. Series in Computer Science. Prentice-Hall International, Hemel Hempstead, 1989.zbMATHGoogle Scholar
  20. 20.
    Robin Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge, UK, 1999.zbMATHGoogle Scholar
  21. 21.
    E.S. Page and L.B. Wilson. An Introduction to Computational Combinatorics. Cambridge University Press, 1979.Google Scholar
  22. 22.
    A. W. Roscoe. The Theory and Practice of Concurrency. Series in Computer Science. Prentice Hall Europe, 1998.Google Scholar
  23. 23.
    A. Rowstron and A. M. Wood. Solving the Multiple-rd Problem. Science of Computer Programming, 31:335–358, July 1998.Google Scholar
  24. 24.
    Antony Rowstron and Alan Wood. BonitA: A Set of Tuple Space Primitives for Distributed Coordination. In Hesham El-Rewini and Yale N. Patt, editors, Proc. of the 30th Hawaii International Conference on System Sciences, volume 1, pages 379–388. IEEE Computer Society Press, January 1997.Google Scholar
  25. 25.
    Steve A. Schneider. Concurrent and Real-time Systems: The CSP approach. Worldwide Series in Computer Science. Wiley, Chichester, UK, 2000.Google Scholar
  26. 26.
    Scientific Computing Associates. Linda User’s Guide & Reference Manual, 1995.Google Scholar
  27. 27.
    Sun Microsystems. JavaSpaces Specification, 1999.Google Scholar
  28. 28.
    Alan Wood. Coordination with Attributes. In P. Ciancarini and A.L. Wolf, editors, Coordinatiion Languages and Models: Proceedings of the Third International Conference COORDINATION’ 99, volume LNCS-1594, pages 21–36. Springer, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jeremy L. Jacob
    • 1
  • Alan M. Wood
    • 2
  1. 1.Department of Computer ScienceUniversity of YorkUK
  2. 2.Department of Computer ScienceUniversity of YorkUK

Personalised recommendations