research-article

Scalable statistics counters

Authors:

Dave Dice,

Yossi Lev,

Mark MoirAuthors Info & Claims

SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Pages 43 - 52

https://doi.org/10.1145/2486159.2486182

Published: 23 July 2013 Publication History

Get Access

Abstract

Statistics counters are important for purposes such as detecting excessively high rates of various system events, or for mechanisms that adapt based on event frequency. As systems grow and become increasingly NUMA, commonly used naive counters impose scalability bottlenecks and/or such inaccuracy that they are not useful. We present both precise and statistical (probabilistic) counters that are nonblocking and provide dramatically better scalability and accuracy properties. Crucially, these counters are competitive with the naive ones even when contention is low.

References

[1]

Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, and Robert E. Tarjan. Cbtree: a practical concurrent self-adjusting search tree. In Proceedings of the 26th international conference on Distributed Computing, DISC'12, pages 1--15, Berlin, Heidelberg, 2012. Springer-Verlag.

Digital Library

Google Scholar

[2]

A. Agarwal and M. Cherian. Adaptive backoff synchronization techniques. In Proceedings of the 16th annual international symposium on Computer architecture, ISCA '89, pages 396--406, New York, NY, USA, 1989. ACM.

Digital Library

Google Scholar

[3]

Miklós Csűrös. Approximate counting with a floating-point counter. In Proceedings of the 16th annual international conference on Computing and combinatorics, COCOON'10, pages 358--367, Berlin, Heidelberg, 2010. Springer-Verlag.

Digital Library

Google Scholar

[4]

Dave Dice and Alex Garthwaite. Mostly lock-free malloc. In Proceedings of the 3rd international symposium on Memory management, ISMM '02, pages 163--174, New York, NY, USA, 2002. ACM.

Digital Library

Google Scholar

[5]

David Dice, Virendra J. Marathe, and Nir Shavit. Lock cohorting: a general technique for designing numa locks. In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, PPoPP '12, pages 247--256, New York, NY, USA, 2012. ACM.

Digital Library

Google Scholar

[6]

Philippe Flajolet. Approximate counting: a detailed analysis. BIT, 25(1):113--134, June 1985.

Digital Library

Google Scholar

[7]

Yossi Lev and Mark Moir. Lightweight parallel accumulators using c++ templates. In Proceedings of the 4th International Workshop on Multicore Software Engineering, IWMSE '11, pages 33--40, New York, NY, USA, 2011. ACM.

Digital Library

Google Scholar

[8]

George Marsaglia. Xorshift rngs. Journal of Statistical Software, 8(14):1--6, 7 2003.

Crossref

Google Scholar

[9]

Robert Morris. Counting large numbers of events in small registers. Commun. ACM, 21(10):840--842, October 1978.

Digital Library

Google Scholar

[10]

Zoran Radovic and Erik Hagersten. Hierarchical backoff locks for nonuniform communication architectures. In Proceedings of the 9th International Symposium on High-Performance Computer Architecture, HPCA '03, pages 241--, Washington, DC, USA, 2003. IEEE Computer Society.

Digital Library

Google Scholar

Cited By

View all

Li TChandramouli BMadden S(2024)Performant almost-latch-free data structures using epoch protection in more depthThe VLDB Journal10.1007/s00778-024-00859-833:6(1793-1812)Online publication date: 17-Jun-2024
https://doi.org/10.1007/s00778-024-00859-8
Hendler DKhattabi AMilani ATravers C(2021)Upper and Lower Bounds for Deterministic Approximate Objects2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS51616.2021.00049(438-448)Online publication date: Jul-2021
https://doi.org/10.1109/ICDCS51616.2021.00049
Brown TProkopec AAlistarh DGupta RShen X(2020)Non-blocking interpolation search trees with doubly-logarithmic running timeProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374542(276-291)Online publication date: 19-Feb-2020
https://dl.acm.org/doi/10.1145/3332466.3374542
Show More Cited By

Index Terms

Recommendations

Adding approximate counters
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

We describe a general framework for adding the values of two approximate counters to produce a new approximate counter value whose expected estimated value is equal to the sum of the expected estimated values of the given approximate counters. (To the ...
Scalable statistics counters
PPoPP '13

Naive statistics counters that are commonly used to monitor system events and performance become a scalability bottleneck as systems become larger and more NUMA; furthermore some are so inaccurate that they are not useful. We present a number of ...
Scalable statistics counters
PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming

Naive statistics counters that are commonly used to monitor system events and performance become a scalability bottleneck as systems become larger and more NUMA; furthermore some are so inaccurate that they are not useful. We present a number of ...

Comments

Information & Contributors

Information

Published In

SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

July 2013

348 pages

ISBN:9781450315722

DOI:10.1145/2486159

General Chair:
Guy Blelloch
Carnegie Mellon University, USA
,
Program Chair:
Berthold Vöcking
RWTH Aachen University, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPAA '13

Sponsor:

SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures

July 23 - 25, 2013

Québec, Montréal, Canada

Acceptance Rates

SPAA '13 Paper Acceptance Rate 31 of 130 submissions, 24%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li TChandramouli BMadden S(2024)Performant almost-latch-free data structures using epoch protection in more depthThe VLDB Journal10.1007/s00778-024-00859-833:6(1793-1812)Online publication date: 17-Jun-2024
https://doi.org/10.1007/s00778-024-00859-8
Hendler DKhattabi AMilani ATravers C(2021)Upper and Lower Bounds for Deterministic Approximate Objects2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS51616.2021.00049(438-448)Online publication date: Jul-2021
https://doi.org/10.1109/ICDCS51616.2021.00049
Brown TProkopec AAlistarh DGupta RShen X(2020)Non-blocking interpolation search trees with doubly-logarithmic running timeProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374542(276-291)Online publication date: 19-Feb-2020
https://dl.acm.org/doi/10.1145/3332466.3374542
Mukherjee RGovindan VKoteshwara SDas AParhi KChakraborty R(2020)Probabilistic Hardware Trojan Attacks on Multiple Layers of Reconfigurable Network InfrastructureJournal of Hardware and Systems Security10.1007/s41635-020-00107-94:4(343-360)Online publication date: 2-Nov-2020
https://doi.org/10.1007/s41635-020-00107-9
Dice DKogan ADan TDahlia M(2019)BRAVOProceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference10.5555/3358807.3358835(315-328)Online publication date: 10-Jul-2019
https://dl.acm.org/doi/10.5555/3358807.3358835
Hedayati MShen KScott MMarty MDan TDahlia M(2019)Multi-queue fair queueingProceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference10.5555/3358807.3358834(301-314)Online publication date: 10-Jul-2019
https://dl.acm.org/doi/10.5555/3358807.3358834
Tassarotti JHarper R(2019)A separation logic for concurrent randomized programsProceedings of the ACM on Programming Languages10.1145/32903773:POPL(1-30)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290377
Govindan VKoteshwara SDas AParhi KChakraborty R(2019)ProTro: A Probabilistic Counter Based Hardware Trojan Attack on FPGA Based MACSec Enabled Ethernet SwitchSecurity, Privacy, and Applied Cryptography Engineering10.1007/978-3-030-35869-3_12(159-175)Online publication date: 21-Nov-2019
https://doi.org/10.1007/978-3-030-35869-3_12
Alistarh DBrown TKopinsky JLi JNadiradze GScheideler CFineman J(2018)Distributionally Linearizable Data StructuresProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210411(133-142)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210411
David TGuerraoui RScheideler CGilbert S(2016)Concurrent Search Data Structures Can Be Blocking and Practically Wait-FreeProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935774(337-348)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2935764.2935774
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Adding approximate counters