Скачать или смотреть How to Properly Manage Counts in a Concurrent Hash Map for Java Applications

Learn how to efficiently extract counts from a Concurrent Hash Map while avoiding double counting or missing updates in a multithreaded Java application.
---
This video is based on the question https://stackoverflow.com/q/68896937/ asked by the user 'Anonymous Beaver' ( https://stackoverflow.com/u/12269777/ ) and on the answer https://stackoverflow.com/a/68897285/ provided by the user 'NorthernSky' ( https://stackoverflow.com/u/5008145/ ) at 'Stack Overflow' website. Thanks to these great users and Stackexchange community for their contributions.

Visit these links for original content and any more details, such as alternate solutions, latest updates/developments on topic, comments, revision history etc. For example, the original title of the Question was: Is this the correct way to extract counts from a Concurrent Hash Map without missing some or double counting?

Also, Content (except music) licensed under CC BY-SA https://meta.stackexchange.com/help/l...
The original Question post is licensed under the 'CC BY-SA 4.0' ( https://creativecommons.org/licenses/... ) license, and the original Answer post is licensed under the 'CC BY-SA 4.0' ( https://creativecommons.org/licenses/... ) license.

If anything seems off to you, please feel free to write me at vlogize [AT] gmail [DOT] com.
---
Managing Counts in Java's Concurrent Hash Map: Avoiding Double Counting and Lost Updates

When developing Java applications with multithreading capabilities, managing shared data structures can become challenging, particularly when trying to maintain a correct count of events. For example, if you need to aggregate user transactions without overwhelming your database, you might rely on a Concurrent Hash Map to sum updates in-memory before committing them to persistent storage. However, achieving accurate counts can lead to unexpected results if not implemented carefully.

The Problem

Consider the following situation:

You're counting the number of transactions, aiming to batch them into a single update to the database every second. Yet, you notice discrepancies in your counts, such as an expectation of exactly 1 million transactions but receiving 1,000,016 instead. This kind of issue raises the need to ensure that:

Updates aren't dropped.

No double counting occurs.

The counts maintain eventual accuracy.

So, what could be going wrong in your implementation?

Understanding the Implementation

Here’s a stripped-down version of a sample implementation that illustrates how the counting process is managed:

[[See Video to Reveal this Text or Code Snippet]]

Potential Issues

The main issue in this code lies in the risk of losing updates due to the timing of method calls across different threads. Here's a step-by-step breakdown of how this can occur:

Thread A invokes incrementCount, finds an existing LongAdder for a userId, and retrieves it.

Thread B runs sendAggregatedStatisticsToDatabase, concurrently removing the LongAdder associated with the same userId from the map.

Thread B computes the sum of the LongAdder, capturing the count.

Thread A finishes executing incrementCount and calls increment() on the now-removed LongAdder, effectively dropping this update as it doesn't exist in the map anymore.

This results in lost increments or inaccurate aggregation counts within your application.

Proposed Solution

To avoid these problems, you can reuse the LongAdder instances rather than removing them completely from the map. Here’s a revised way to manage counts:

[[See Video to Reveal this Text or Code Snippet]]

Key Changes

Retain the LongAdder: Instead of removing the LongAdder from the map, keep it in place and reset its count after obtaining the sum. This prevents lost updates because the increment() method will always reference an existing LongAdder.

Immediate Reset: By adding -count to the LongAdder, you effectively reset the count while still keeping the object in the map available for further increments, mitigating risks related to concurrent access and updates.

Conclusion

By carefully managing shared resources in multithreaded applications, you can ensure accurate and reliable counting mechanisms. The adjustments suggested in this guide aim to bridge the gap between performance and accuracy in your Java applications, particularly when utilizing structures like Concurrent Hash Map.

These best practices will help enhance the integrity of your transaction counting system and allow your application to scale effectively while handling concurrent operations. Happy coding!