Personal and Ubiquitous Computing

, Volume 10, Issue 1, pp 45–49 | Cite as

Supporting ordering and consistency in a distributed Event Heap for Ubiquitous Computing

Original Article
  • 37 Downloads

Abstract

The Stanford Event Heap has been shown to provide appropriate support for constructing interactive workspace applications. Given this success it is natural to consider the Event Heap as a platform to support other classes of Ubiquitous Computing applications. In this paper we argue that the distributed, spontaneous nature of these applications places additional demands on the Event Heap that require extensions to both the engineering and API. Suitable extensions are described and their use to support a typical Ubicomp application is discussed.

Notes

Acknowledgements

This work was supported by EPSRC project Grid based Medical Devices for Everyday Health (EPSRC GR/R85877) and the European Union funded Simplicity project (IST-2004-507558).

References

  1. 1.
    Xu LA, Liskov B (1989) A design for a fault-tolerant distributed implementation of Linda Andrew Xu and Barbara Liskov. In: Nineteenth international symposium on fault-tolerant computing (FTCS-19), pp 199–206, June (http://ieeexplore.ieee.org/iel2/251/3238/00105566.pdf)
  2. 2.
    Rowstron AIT, Wood AM (1996) Solving the Linda multiple rd problem using the copy-collect primitive. In: Ciancarini P, Hankin C (eds) Proceedings of coordination ’96, coordination languages and models. vol 1061. Lecture notes in computer science, Springer, Berlin Heidelberg New York, pp 357–367Google Scholar
  3. 3.
    Rowstron AIT, Wood AM (1997) Bonita: a set of tuple space primitives for distributed coordination. In: Proceedings of the 30th Hawaii international conference on system sciences, IEEE computer society (0-8186-7743-0 379)Google Scholar
  4. 4.
    Johanson B, Fox A, Winograd T (2002) The interactive workspaces project: experiences with ubiquitous computing rooms. IEEE pervasive computing magazine, vol 1(2), AprilGoogle Scholar
  5. 5.
    Johanson B (2003) Application coordination infrastructure for ubiquitous computing rooms. PhD thesis, Stanford University, Stanford, December (pdf-http://graphics.stanford.edu/~bjohanso/dissertation/johanson-thesis.pdf)
  6. 6.
    Gelernter D (1985) Generative communication in Linda. ACM transactions on programming languages and systems. ACM Press, New York 7(1):80–112 (0164-0925) (http://doi.acm.org/10.1145/2363.2433)
  7. 7.
    Cristian F (1996) Group majority and strict agreement in timed asynchronous distributed systems. In: The proceedings of the twenty-sixth annual international symposium on fault-tolerant computing (FTCS ’96), Sendai, Japan, pp 178–189, JuneGoogle Scholar
  8. 8.
    Picco GP, Murphy AL, Roman G-C (1999) LIME: Linda meets mobility. In: Proceedings of the 21st international conference on Software engineering. IEEE Computer Society Press, Los Angeles, California, USA, pp 368–377 (1-58113-074-0)Google Scholar
  9. 9.
    Hupfer S (1990) Melinda: Linda with multiple tuple spaces. Technical Report YALEU/DCS/RR-766, Department of Computer Science, Yale University, New Haven, Connecticut, USA, FebruaryGoogle Scholar
  10. 10.
    Leichter JS (1989) Shared tuple memories, shared memories, buses and LAN’s—Linda implementations across the spectrum of connectivity. PhD thesis, Department of Computer Science, Yale University, New Haven, Connecticut, USA, JulyGoogle Scholar
  11. 11.
    Lamport L (1978) Time clocks and the ordering of events in a distributed system. Communications of the ACM, ACM Press, New York 21(7):558–565 (0001-0782) (http://doi.acm.org/10.1145/359545.359563)
  12. 12.
    Román M, Hess C, Cerqueira R, Ranganathan A, Campbell RH, Nahrstedt K (2002) A middleware infrastructure for active spaces. IEEE pervasive computing. IEEE computer society 1(4):74–83Google Scholar
  13. 13.
    Davies N, Wade S, Friday A, Blair G (1997) Limbo: a tuple space based platform for adaptive mobile applications. In: Joint international conference on open distributed processing and distributed platforms (ICODP/ICDP ’97). Chapman and Hall, Toronto, CanadaGoogle Scholar
  14. 14.
    Davies N, Friday A, Wade S, Blair G (1998) L2imbo: a distributed systems platform for mobile computing. ACM mobile networks and applications (MONET): special issue on protocols and Software paradigms of mobile networks 3(2):143–156 (http://delivery.acm.org/10.1145/300000/294529/p143-davies.pdf)
  15. 15.
    Wyckoff P, McLaughry SW, Lehman TJ, Ford DA (1998) T Spaces. IBM Syst J 37(3):454–474CrossRefGoogle Scholar
  16. 16.
    Floyd S, Van Jacobson, McCanne S, Liu C-G, Zhang L (1995) A reliable multicast framework for light-weight sessions and application level framing. In: Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication. ACM Press, Cambridge, Massachusetts, USA, pp 342–356 (0-89791-711-1) (http://doi.acm.org/10.1145/217382.217470)
  17. 17.
    Kindberg T, Barton J, Morgan J, Becker G, Bedner I, Caswell D, Debaty P, Gopal G, Frid M, Krishnan V, Morris H, Pering C, Schettino J, Serra B, Spasojevic M (2000) People, places, things: Web presence for the real world. In: Proceedings of 3rd IEEE workshop of mobile computing systems and applications (WMCSA 2000). IEEE Computer Society, Monterey, California, pp 19–30, DecemberGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2005

Authors and Affiliations

  1. 1.Computing DepartmentLancaster UniversityLancasterUK

Personalised recommendations