Skip to main content
Springer Nature Link
Log in

An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem

  • Conference paper
Distributed Computing and Networking (ICDCN 2011)

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

Included in the following conference series:

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. All the earlier algorithms for this problem have maximum message load of Ω(n logw).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804–823 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chang, E.: Echo algorithms: Depth parallel operations on general graphs. IEEE Trans. Software Eng. 8(4), 391–401 (1982)

    Article  Google Scholar 

  3. Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. In: SODA (2008)

    Google Scholar 

  4. 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 

  5. Garg, V., Ghosh, J.: Repeated computation of global functions in a distributed environment. IEEE Trans. Parallel Distrib. Syst. 5(8), 823–834 (1994)

    Article  Google Scholar 

  6. Huang, L., Garofalakis, M., Joseph, A., Taft, N.: Communication-efficient tracking of distributed cumulative triggers. In: ICDCS (2007)

    Google Scholar 

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

    Google Scholar 

  8. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  9. Segall, A.: Distributed network protocols. IEEE Transactions on Information Theory 29(1), 23–34 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Tel, G.: Distributed infimum approximation. In: Lupanov, O.B., Bukharajev, R.G., Budach, L. (eds.) FCT 1987. LNCS, vol. 278, pp. 440–447. Springer, Heidelberg (1987)

    Chapter  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, USA

    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. Microsoft Research Silicon Valley, 1065 La Avenida – bldg. 6, 94043, Mountain View, CA, USA

    Marcos K. Aguilera

  2. School of Computing, National University of Singapore, COM2-04-25, 15 Computing Drive, 117418, Republic of Singapore

    Haifeng Yu

  3. 458 Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, MC-228, 1308 West Main Street, 61801, Urbana, IL, USA

    Nitin H. Vaidya

  4. Alcatel-Lucent Technologies, Manyata Technology Park, Nagawara, 560045, Bangalore, India

    Vikram Srinivasan

  5. ECE Department, Duke University, 130 Hudson Hall, Box 90291, 27708, Durham, NC, USA

    Romit Roy Choudhury

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chakaravarthy, V.T., Choudhury, A.R., Garg, V.K., Sabharwal, Y. (2011). An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds) Distributed Computing and Networking. ICDCN 2011. Lecture Notes in Computer Science, vol 6522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17679-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17679-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17678-4

  • Online ISBN: 978-3-642-17679-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics