Proceedings Article10.1109/LCN.1997.630906
Distributed shared memory layer for cooperative work applications
Hervé Guyennet,J.-C. Lapayre,M. Trehel +2 more
- 02 Nov 1997
- pp 72-79
74
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Mechanism and apparatus for using messages to look up documents stored in spaces in a distributed computing environment
Gregory L. Slaughter,Thomas E. Saulpaugh,Bernard A. Traversat,Mohamed M. Abdelaziz,Michael J. Duigou +4 more
- 12 Sep 2000
TL;DR: In this article, a system and method for searching for documents within spaces in a distributed computing environment are provided, where a client sends a lookup message to a space which stores documents, and a set of zero or more documents which match the lookup message are discovered.
458
Patent
Method and system for leasing storage
Ann M. Wollrath,James H. Waldo,Kenneth C. R. C. Arnold +2 more
- 15 Feb 2002
TL;DR: In this paper, a method and system for leasing storage locations in a distributed processing system is presented, where a client requests access to storage locations for a period of time from a server, such as the file system manager.
257
Patent
Dynamic lookup service in a distributed system
Brian T. Murphy,Robert W. Scheifler,Zane Pan,James H. Waldo,Ann M. Wollrath,Kenneth C. R. C. Arnold +5 more
- 08 Apr 2003
TL;DR: In this article, an improved lookup service is provided that allows for the dynamic addition and deletion of services automatically, without user intervention, allowing clients to continue using the lookup service and its associated services while the updates occur.
223
Patent
Methods, apparatus, and product for distributed garbage collection
Ann M. Wollrath,Jim Waldo,Roger Riggs +2 more
- 12 Jul 2004
TL;DR: In this paper, a process for allocating and deallocating resources in a distributed processing system having a requester platform and a server platform is described, where the process involves receiving a request from the requestor platform referring to a system resource and specifying a requested lease period, permitting shared access to the system resource for a lease period.
195
Patent
Mechanism and apparatus for returning results of services in a distributed computing environment
Gregory L. Slaughter,Saulpaugh E,Bernard A. Traversat,Mohamed M. Abdelaziz +3 more
- 09 May 2001
TL;DR: In this article, results of a service invocation are returned to the client in a plurality of ways: in a message, in a space (e.g., a network-addressable storage location), in an event, using an advertisement returned in message, and in the event itself.
194
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Groupware: some issues and experiences
TL;DR: C categories and examples of groupware are described and some underlying research and development issues are discussed and GROVE, a novel group editor, is explained in some detail as a salient groupware example.
Memory coherence in shared virtual memory systems
Kai Li,Paul Hudak +1 more
TL;DR: Both theoretical and practical results show that the memory coherence problem can indeed be solved efficiently on a loosely coupled multiprocessor.
1.3K
Memory consistency and event ordering in scalable shared-memory multiprocessors
Kourosh Gharachorloo,Daniel E. Lenoski,James Laudon,Phillip B. Gibbons,Anoop Gupta,John L. Hennessy +5 more
- 01 May 1990
TL;DR: A new model of memory consistency, called release consistency, that allows for more buffering and pipelining than previously proposed models is introduced and is shown to be equivalent to the sequential consistency model for parallel programs with sufficient synchronization.