Abstract
Many algorithms in distributed systems assume that the size of a single message depends on the number of processors. In this paper, we assume in contrast that messages consist of a single bit. Our main goal is to explore how the one-bit translation of unbounded message algorithms can be sped up by pipelining. We consider two problems. The first is routing between two processors in an arbitrary network and in some special networks (ring, grid, hypercube). The second problem is coloring a synchronous ring with three colors. The routing problem is a very basic subroutine in many distributed algorithms; the three coloring problem demonstrates that pipelining is not always useful.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bar-Noy A, Dolev D (1988) Families of consensus algorithms. VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing. Corfu, Greece (1988) pp. 380–390
Cole R, Vishkin U (1986) Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. Proc 18th Symp on Theory of Computing, pp 206–219
Gallager RG, Humblet PA, Spira PM (1983) A distributed algorithm for minimum weight spanning trees. ACM Trans Program, Lang, Syst 5:66–77
Goldberg A, Plotkin S, Shannon G (1988) Parallel symmetry breaking in sparse graphs. SIAM J Disc Math 1:pp 434–446
Leighton T (1984) Tight bounds on the complexity of parallel sorting. Proc 16th Symp. on Theory of Computing, pp 71–80
Le Lann G (1977) Distributed systems — towards a formal approach. Infirmation Processing, Vol 7. North Holland, Amsterdam, 1977, pp 155–160
Linial N (1987) Distributive graph algorithms — global solutions from local data. Proc 28th Symp on Foundations of Computer Science, pp 331–335
Author information
Authors and Affiliations
Additional information
Amotz Bar-Noy received his B.Sc. degree in Mathematics and Computer Science in 1981, and his Ph.D. degree in Computer Science in 1987, both from the Hebrew University of Jerusalem, Israel. Between 1987 and 1989 he was a post-doctoral fellow in the Department of Computer Science at Stanford University. He is currently a visiting scientist at the IBM Thomas J. Watson Research Center. His current research interests include the theoretical aspects of distributed and parallel computing, computational complexity and combinatorial optimization.
Joseph (Seffi) Naor received his B.A. degree in Computer Science in 1981 from the Technion, Israel Institute of Technology. He received his M.Sc. in 1983 and Ph.D. in 1987 in Computer Science, both from the Hebrew University of Jerusalem, Israel. Between 1987 and 1988 he was a post-doctoral fellow at the University of Southern California, Los Angeles, CA. Since 1988 he has been a post-doctoral fellow in the Department of Computer Science at Stanford University. His research interests include combinatorial optimization, randomized algorithms, computational complexity and the theoretical aspects of parallel and distributed computing.
Moni Naor received his B.A. in Computer Science from the Technion, Israel Institute of Technology, in 1985, and his Ph.D. in Computer Science from the University of California at Berkeley in 1989. He is currently a visiting scientist at the IBM Almaden Research Center. His research interests include computational complexity, data structures, cryptography, and parallel and distributed computation.
Supported in part by a Weizmann fellowship and by contract ONR N00014-85-C-0731
Supported by contract ONR N00014-88-K-0166 and by a grant from Stanford's Center for Integrated Systems. This work was done while the author was a post-doctoral fellow at the University of Southern California, Los Angeles, CA
This work was done while the author was with the Computer Science Division, University of California at Berkeley, and Supported by NSF grant DCR 85-13926
Rights and permissions
About this article
Cite this article
Bar-Noy, A., Naor, J. & Naor, M. One-bit algorithms. Distrib Comput 4, 3–8 (1990). https://doi.org/10.1007/BF01783661
Issue Date:
DOI: https://doi.org/10.1007/BF01783661