Abstract
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 storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Awerbuch, B., L. M. Kirousis, E. Kranakis, and P. M. B. Vitányi, On proving register atomicity, Technical Report CS-R8707, Centrum voor Wiskunde en Informatica, Amsterdam (May, 1987).
Broomel, G. and J. R. Heath, Classification categories and historical development of circuit switching topologies,ACM Computing Surveys 15, pp. 95–133 (1983).
Dalai, Y. K. and R. Metcalfe, Reverse path forwarding of broadcast packets,Communications of the Association for Computing Machinery 21, pp. 1040–1048 (1978).
Dijkstra, E. W., Solution to a problem in concurrent programming control,Communications of the Association for Computing Machinery 8, p. 567 (1965).
Erdös, P., L. Geréncser, and A. Maté, Problems of graph theory concerning optimal design, inColloquia Mathematica Societatis János Bolyai 4, ed. P. Erdös, North-Holland, Amsterdam (1970), pp. 317–325.
Farber, D. J. and K. C. Larson, The system architecture of the distributed system—the communication system,Proceedings of the Polytechnic Institute of Brooklyn Symposium on Computer Networks (April, 1972).
Fowler, R. J., The complexity of forwarding address protocols for decentralized object finding,Proceedings of the 5th ACM Symposium on Principles of Distributed Computing (1986), pp. 108–120.
Gelernter, D. and A. J. Bernstein, Distributed communication via a global buffer,Proceedings of the llth ACM Symposium on Principles of Distributed Computing (1982), pp. 10–18.
Gifford, D. K., Weighted voting for replicated data,Proceedings of the 7th ACM Symposium on Operating Systems Principles (1979).
Gifford, D. K., Information storage in a decentralized computer system, Technical Report CSL-81-8, Xerox Corporation (March, 1983).
Kranakis, E. and P. M. B. Vitányi, Distributed control in computer networks and cross-sections of colored multidimensional bodies, Technical Report MIT/LCS/TM-304, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA (March, 1986).
Lamport, L., The mutual exclusion problem, Parts I and II,Journal of the Association for Computing Machinery 33, pp. 313–326, 327–348 (1986).
Lampson, B. W., Designing a global nameservice,Proceedings of the 5th ACM Symposium on Principles of Distributed Computing (1986), pp. 1–10.
Liskov, B. and S. Zilles, Programming with abstract data types,SIGPLAN Notices 9, pp. 50–59 (1974).
Maekawa, M., AN**1/2 algorithm for mutual exclusion in decentralized systems,ACM Transactions on Computer Systems 3, pp. 145–159 (1985).
Mullender, S. J. and P. M. B. Vitányi, Distributed match-making for processes in computer networks,Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing (1985), pp. 261–271. (Reprinted inOperating System Review, 1986.)
Needham, R. M. and A. J. Herbert,The Cambridge Distributed Computer System, Addison-Wesley, Reading, MA (1982).
Powell, M. L. and B. P. Miller, Process migration in DEMOS/MP,Proceedings of the 9th ACM Symposium on Operating Systems Principles (1983), pp. 110–119.
Seitz, Ch. L., The cosmic cube,Communications of the Association for Computing Machinery 28, pp. 22–33 (1985).
Sloane, N. J. A.,A Handbook of Integer Sequences, Academic Press, New York (1973).
Tanenbaum, A. S. and S. J. Mullender, An overview of the Amoeba distributed operating system,Operating System Review 15, pp. 51–64 (1981).
Mullender, S. J. and A. S. Tanenbaum, The design of a capability-based distributed operating system,The Computer Journal 29, pp. 289–300 (1986).
Valiant, L. G., A scheme for fast parallel communication,SIAM Journal on Computing 11, pp. 350–361 (1982).
Vitanyi, P. M. B. and B. Awerbuch, Atomic shared register access by asynchronous hardware,Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (1986).
Author information
Authors and Affiliations
Additional information
Communicated by Jeffrey Scott Vitter.
The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.
Rights and permissions
About this article
Cite this article
Mullender, S.J., Vitányi, P.M.B. Distributed match-making. Algorithmica 3, 367–391 (1988). https://doi.org/10.1007/BF01762123
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01762123