Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An improved multiple identification algorithm for synchronous broadcasting networks

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 312))

Included in the following conference series:

  • 156 Accesses

Abstract

Galil, Landau and Yung proposed the synchronous broadcasting network as a model for distributed computation and studied the multiple identification problem, where each of the p processors has a bit-string of length n and wants to determine the subset of processors that have the same string as itself. They described an O(n log2p + p) algorithm where the processors do not use any algebraic operations. In this paper an improved version is given with complexity O(n log p) for the case n≥p and O(n log p loglog p + p) for the general case.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, J. Komlos, E. Szemeredi: An O(n log n) Sorting Network. Symposium on Theory of Computing, ACM, 1983, 1–9

    Google Scholar 

  2. G. M. Landau, M. M. Yung, Z. Galil: Distributed Algorithms in Synchronous Broadcasting Networks. Proc. 12th Int. Conf. on Automata, Languages and Programming, 1985, LNCS 194, 363–372

    Google Scholar 

  3. Z. Galil, G. M. Landau, M. M. Yung: Distributed Algorithms in Synchronous Broadcasting Networks. TCS 49 (1987) 171–184

    Article  Google Scholar 

  4. J. M. Marberg, E. Gafni: Distributed Sorting Algorithms in Multi-Channel Broadcast Networks. Comp. Sci. Dept., Univ. of California, Los Angeles, 1986

    Google Scholar 

  5. A.C. Yao: Some Complexity Questions Related to Distributive Computing. Symposium on Theory of Computing, ACM, 1979, 209–213

    Google Scholar 

  6. Y. Yemini, A.Lazar: Towards Distributed Sensor Networks. Conference on Information Science and Systems, Princeton University, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-8000, München 2

    Walter Vogler

Authors
  1. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1988). An improved multiple identification algorithm for synchronous broadcasting networks. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019796

Download citation

  • DOI: https://doi.org/10.1007/BFb0019796

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

  • Online ISBN: 978-3-540-39239-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation