Revisiting Hash Table Design for Phase Change Memory

Debnath, Biplob; Haghdoost, Alireza; Kadav, Asim; Khatib, Mohammed G.; Ungureanu, Cristian

doi:10.1145/2883591.2883597

Cited by 34 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different data structures based on hashing do different internal work. Hash table is a data structure that stores data in an associative manner [51]. In a hash table, data is saved in an array format, where each data value has its unique index value.…”

Section: E Discussionmentioning

confidence: 99%

An Efficient Approach for Uncertain Event Detection in RFID Complex Event Processing

Yaacob

Mahdin

Jawad

et al. 2021

JOIV : Int. J. Inform. Visualization

View full text Add to dashboard Cite

The globalization of manufacturing has increased the risk of counterfeiting as the demand grows, the production flow increases, and the availability expands. The intensifying counterfeit issues causing a worriment to companies and putting lives at risk. Companies have ploughed a large amount of money into defensive measures, but their efforts have not slowed counterfeiters. In such complex manufacturing processes, decision-making and real-time reactions to uncertain situations throughout the production process are one way to exploit the challenges. Detecting uncertain conditions such as counterfeit and missing items in the manufacturing environment requires a specialized set of technologies to deal with a flow of continuously created data. In this paper, we propose an uncertain detection algorithm (UDA), an approach to detect uncertain events such as counterfeit and missing items in the RFID distributed system for a manufacturing environment. The proposed method is based on the hashing and thread pool technique to solve high memory consumption, long processing time and low event throughput in the current detection approaches. The experimental results show that the execution time of the proposed method is averagely reduced 22% in different tests, and our proposed method has better performance in processing time based on RFID event streams.

show abstract

Section: E Discussionmentioning

confidence: 99%

An Efficient Approach for Uncertain Event Detection in RFID Complex Event Processing

Yaacob

Mahdin

Jawad

et al. 2021

JOIV : Int. J. Inform. Visualization

View full text Add to dashboard Cite

show abstract

“…Cuckoo-based hashing, as explored in [47], offers a way to reduce write operations to PCM (phase change memory) while maintaining higher memory efficiency. It achieves this by displacing randomly chosen records to alternative buckets [47]. The insertion of records into buckets is carried out using independent hash functions.…”

Section: Related Workmentioning

confidence: 99%

“…The primary focus of many research studies is to reduce the cost associated with fulltable rehashing and improve the load factor of hash tables. Some proposals have explored the idea of incorporating additional levels [47] to store records that are actively maintained in memory rather than being directly stored in the hash table. Another notable approach gaining popularity is the use of cache-line-level indexing with a failure atomic structure, as described in [14].…”

Section: Related Workmentioning

confidence: 99%

ESH: Design and Implementation of an Optimal Hashing Scheme for Persistent Memory

Regassa,

Yeom,

Hwang

2023

Applied Sciences

View full text Add to dashboard Cite

Recent advancements in memory technology have opened up a wealth of possibilities for innovation in data structures. The emergence of byte-addressable persistent memory (PM) with its impressive capacity and low latency has accelerated the adoption of PM in existing hashing-based indexes. As a result, several new hashing schemes utilizing emulators have been proposed. However, these schemes have proven to be suboptimal, lacking scalability when implemented on real devices. Only a handful of hash table designs have successfully addressed critical properties such as load factor, scalability, efficient memory utilization, and recovery. One of the main challenges in redesigning data structures for an effective hashing scheme in PM is minimizing the overhead associated with dynamic hashing operations in the hash table. To tackle this challenge, this paper introduces ESH, an efficient and scalable hashing scheme that significantly improves memory efficiency, scalability, and overall performance on PM. The ESH scheme maximizes the utilization of the hash table’s available space, thus reducing the frequency of full-table rehashing and improving performance. Consequently, this scheme achieves a high load factor while minimizing the need for rehashing. To evaluate the effectiveness of the ESH scheme, we compare it to widely used dynamic hashing schemes employing similar techniques on Intel Optane® DC persistent memory (DCPMM). The experimental results demonstrate that ESH outperforms CCEH and Dash in terms of data insertion performance, exhibiting a 30% improvement over CCEH and a 4% improvement over Dash. Furthermore, ESH improves the lookup operation by nearly 10% compared to Dash, while achieving a load factor of up to 91%, surpassing its competitors.

show abstract

“…The limited writing lifetime is the shortcoming for NVM such as PCM. Therefore, there is much research on how to reduce the write times of NVM devices [24][25][26][27]. Shimin Chen proposed an unordered leaf node B+ tree to reduce the write caused by sorting [24].…”

Section: Related Workmentioning

confidence: 99%

A New Embedded Key–Value Store for NVM Device Simulator

Cai

Niu

et al. 2020

Micromachines

View full text Add to dashboard Cite

The non-volatile memory (NVM) device is a useful way to solve the memory wall in computers. However, the current I/O software stack in operating systems becomes a performance bottleneck for applications based on NVM devices, especially for key–value stores. We analyzed the characteristics of key–value stores and NVM devices and designed a new embedded key–value store for an NVM device simulator named PMEKV. The embedded processor in NVM devices was used to manage key–value pairs to reduce the data transfer between NVM devices and key–value applications. Meanwhile, it also cut down the data copy between the user space and the kernel space in the operating system to alleviate the I/O software stacks on the efficiency of key–value stores. The architecture, data layout, management strategy, new interface and log strategy of PMEKV are given. Finally, a prototype of PMEKV was implemented based on PMEM. We used YCSB to test and compare it with Redis, MongDB, and Memcache. Meanwhile, the Redis for PMEM named PMEM-Redis and PMEM-KV were also used to test and compared with PMEKV. The results show that PMEKV had the advantage of throughput and adaptability compared with the current key–value stores.

show abstract

Revisiting Hash Table Design for Phase Change Memory

Cited by 34 publications

References 18 publications

An Efficient Approach for Uncertain Event Detection in RFID Complex Event Processing

An Efficient Approach for Uncertain Event Detection in RFID Complex Event Processing

ESH: Design and Implementation of an Optimal Hashing Scheme for Persistent Memory

A New Embedded Key–Value Store for NVM Device Simulator

Contact Info

Product

Resources

About