Skip to main content
Springer Nature Link
Log in

Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting

  • Conference paper
Distributed Computing (DISC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6343))

Included in the following conference series:

  • 1163 Accesses

Abstract

Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. The problem has applications in monitoring, global snapshots, synchronizers and other distributed settings. The main result of the paper is a decentralized and randomized algorithm with expected message complexity O(nlogn logw). Moreover, every processor in this algorithm receives no more than O(logn logw) messages with high probability.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Emek, Y., Korman, A.: Brief announcement: New bounds for the controller problem. In: PODC ’09 (2009)

    Google Scholar 

  2. Garg, R., Garg, V.K., Sabharwal, Y.: Scalable algorithms for global snapshots in distributed systems. In: 20th Int. Conf. on Supercomputing, ICS (2006)

    Google Scholar 

  3. Keralapura, R., Cormode, G., Ramamirtham, J.: Communication-efficient distributed monitoring of thresholded counts. In: SIGMOD Conference (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research, India, New Delhi

    Venkatesan T. Chakaravarthy, Anamitra R. Choudhury & Yogish Sabharwal

  2. University of Texas at Austin,  

    Vijay K. Garg

Authors
  1. Venkatesan T. Chakaravarthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anamitra R. Choudhury
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay K. Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yogish Sabharwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, 02139-4307, Cambridge, MA, USA

    Nancy A. Lynch

  2. Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, Unit 2155, 06269, Storrs, CT, USA

    Alexander A. Shvartsman

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chakaravarthy, V.T., Choudhury, A.R., Garg, V.K., Sabharwal, Y. (2010). Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15763-9_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15762-2

  • Online ISBN: 978-3-642-15763-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics