Skip to main content
Article thumbnail
Location of Repository

Supporting Ordering and Consistency in a Distributed Event Heap for Ubiquitous Computing

By Oliver Storz, Adrian Friday and Nigel Davies


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

Topics: QA75 Electronic computers. Computer science
Year: 2004
DOI identifier: 10.1007/s00779-005-0039-2
OAI identifier:
Provided by: Lancaster E-Prints

Suggested articles


  1. (1989). A design for a fault-tolerant, distributed implementation of Linda.
  2. (1995). A reliable multicast framework for light-weight sessions and application level framing.
  3. (2003). Application Coordination Infrastructure for Ubiquitous Computing Rooms.
  4. (1997). Bonita: A set of tuple space primitives for distributed coordination.
  5. (1985). Generative communication in Linda.
  6. Hess et al.: A Middleware Infrastructure for Active Spaces.
  7. Leichter: Shared Tuple Memories, Shared Memories, Buses and LAN’s – Linda Implementations across the Spectrum of Connectivity.
  8. (1997). Limbo: A Tuple Space Based Platform for Adaptive Mobile Applications.
  9. LIME: Linda meets mobility.
  10. (1990). Melinda: Linda with Multiple Tuple Spaces.
  11. (2000). Places, Things: Web Presence for the Real World.
  12. (1996). Solving the Linda multiple rd problem using the copy-collect primitive.
  13. (2002). The Interactive Workspaces Project: Experiences with Ubiquitous Computing Rooms.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.