Distributed Computing
Development of the domain name system
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Scheduling parallel applications in distributed networks
Cluster Computing
A world-wide distributed system using Java and the Internet
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
| Hi-index | 0.00 |
This paper proposes a framework for the systematic design of directory-based distributed applications. We evaluate a space of directory designs using our framework. We present a case study consisting of design, implementation and analysis of directories for a multicast application. Our framework is based on a model that extends the formal concept of "process knowledge'' in distributed systems. This concept is used informally in phrases such as "process p knows when it is in state s that process q is active.'' We show that this definition of knowledge is too strong for many distributed applications, including directory design. We propose a weaker concept: "estimation''. We define the meaning of phrases of the form: "process p in state s estimates with probability 0.9 that process q is active.'' We specify directory design as an optimization problem with the objective function of maximizing estimation probabilities, and with constraints on the amount of bandwidth, computation and storage used. We show how this specification helps in a systematic analysis of alternative directory designs. Keywords: Distributed systems, directories, design frameworks, theory of process knowledge, estimation, performance models, multicast