Distributed match-making

@article{Mullender1988DistributedM,
  title={Distributed match-making},
  author={Sape J. Mullender and Paul M. B. Vit{\'a}nyi},
  journal={Algorithmica},
  year={1988},
  volume={3},
  pages={367-391}
}
In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called “distributed match-making” as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Vit~inyi, On proving register atomicity

  • B. Awerbuch, L. M. Kirousis, E. Kranakis, B P.M.
  • Technical Report CS-R8707, Centrum voor Wiskunde…
  • 1987
2 Excerpts

The complexity of forwarding address protocols for decentralized object finding

  • R. J. Fowler
  • Proceedings of the 5th ACM Symposium on…
  • 1986
1 Excerpt

Similar Papers

Loading similar papers…