|
Title:
|
PERFORMANCE ANALYSIS BETWEEN HASHMAP AND CONCURRENT HASHMAP UPON BUCKET SIZE AND THREAD NUMBERS WITH CONCURRENCY LEVEL |
|
Author(s):
|
Haklin Kimm and Eun-Joo Lee |
|
ISBN:
|
978-989-8704-71-9 |
|
Editors:
|
Paula Miranda and Pedro Isaías |
|
Year:
|
2025 |
|
Edition:
|
Single |
|
Keywords:
|
Hashing, Java Hashmap, Java Concurrent Hashmap, Threads, Buckets, Concurrency Level |
|
Type:
|
Short Paper |
|
First Page:
|
245 |
|
Last Page:
|
249 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
if you are a member please login 
|
|
Paper Abstract:
|
A HashMap is a data structure that enables efficient storage and retrieval of key-value pairs. In this paper, we focus specifically on the Java HashMap and ConcurrentHashMap implementations due to Java's widespread adoption across various industries. To evaluate their performance, we implemented and tested both data structures of HashMaps under multiple conditionssuch as bucket size vs. data size, number of threads vs. data size, and bucket size vs. number of threads. We also examined how concurrency levels correlate with the number of threads in ConcurrentHashMap. Our experimental results show that ConcurrentHashMap maintains its accuracy even as the number of updates over HashMap increases, whereas the accuracy of a regular HashMap declines under the same conditions. Additionally, increasing the number of threads improves runtime performance significantlyup to approximately 16 threadsafter which the performance gains become marginal. |
|
|
|
|
|
|
