S. Mullender and P. Vitnyi, "Distributed Match-Making for Processes in Computer Networks," in Proceedings 4th ACM Principles of Distributed Computing, (Minaki, Canada), August 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Fault-Tolerant Network Kernel For Linda - Xu (1988) (4 citations) (Correct)
....server that 83 stores the mapping; workers would maintain a cache containing the mapping for recently used tuples and consult the server only when there is a cache miss or when the information in the cache is found to be out of date. Implementations of location servers are discussed in [12] 15] 17][21]. The portion of a worker s code that interacts with replicas would need to take the multiple sets into account. Operations concerning the same set would be done in order just as described in Chapter 3. Operations that make use of different sets can be done in the background in parallel, except ....
Sape Mullender and Paul Vitanyi. "Distributed Match-Making for Processes in Com- puter Networks--Preliminary Version". In Proceedings of the Fourth ACM Symposium on the Principles of Distributed Computing, August 1985. Held at Minaki, Ontario, Canada. Sponsored by ACM.
Distributed Systems: A Comprehensive Survey - Borghoff, Nast-Kolb (Correct)
....countries which are connected via a wide area network. Contact: Sape J. Mullender, CWI Amsterdam, Netherlands or Andy Tanenbaum, Dept. of Mathematics and Computer Science, Vrije Universiteit, Postbus 7161, 1007 MC Amsterdam, Netherlands. References: 10] 11] 12] 13] 14] 15] 16] [17], 18] 19] 20] 21] 22] 23] 24] 25] 26] 27] 28] 29] 30] 31] 32] 2.4 Andrew Main Goal Andrew is a distributed computing environment being developed at the Carnegie Mellon University, Pittsburg in a workstation server principle. The goals of the Andrew file system are ....
S.J. Mullender and P.M.B. Vitanyi, "Distributed Match-Making for Processes in Computer Networks", In Proc. 4th ACM Principles of Distributed Computing, Minaki, Canada, Aug 1985.
Using Sparse Capabilities in a Distributed Operating.. - Tanenbaum, Mullender.. (1986) (55 citations) Self-citation (Mullender) (Correct)
....simulated in software when the kernels are trusted by having each one maintain a cache of (port, machine number) pairs. If a port is not in the cache, it can be found by broadcasting a LOCATE message. How this can be carried out efficiently, even in a network without broadcasting, is discussed in [Mullender and Vitanyi 1984], along with many of the implications of location dependendent addressing, process migration, etc. 2.3. Capabilities In any object based system, a mechanism is needed to keep track of which processes may access which objects and in what way. The normal way is to associate a capability with each ....
Mullender, S.J., and Vitanyi, P.M.B. "Distributed Match-Making for Processes in Computer Networks," Report CS-8424, Centrum v Wiskunde en Informatica, Dec. 1984.
Facilitating Match-Making Service in Ad hoc and Sensor Networks .. - Aydin, Shen (2002) (2 citations) (Correct)
No context found.
S. Mullender and P. Vitnyi, "Distributed Match-Making for Processes in Computer Networks," in Proceedings 4th ACM Principles of Distributed Computing, (Minaki, Canada), August 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC