Parloom: A New Low-Power Set-Associative Instruction Cache Architecture Utilizing Enhanced Counting Bloom Filter and Partial Tags

2019 ◽  
Vol 28 (12) ◽  
pp. 1950203
Author(s):  
Sajjad Rostami-Sani ◽  
Mojtaba Valinataj ◽  
Saeideh Alinezhad Chamazcoti
Keyword(s):  
Energy Consumption ◽  
System Performance ◽  
Bloom Filter ◽  
Instruction Cache ◽  
Cache Architecture ◽  
Power Set ◽  
Novel Method ◽  
Instruction Caches ◽  
Cache System ◽  
Counting Bloom Filter

The cache system dissipates a significant amount of energy compared to the other memory components. This will be intensified if a cache is designed with a set-associative structure to improve the system performance because the parallel accesses to the entries of a set for tag comparisons lead to even more energy consumption. In this paper, a novel method is proposed as a combination of a counting Bloom filter and partial tags to mitigate the energy consumption of set-associative caches. This new hybrid method noticeably decreases the cache energy consumption especially in highly-associative instruction caches. In fact, it uses an enhanced counting Bloom filter to predict cache misses with a high accuracy as well as partial tags to decrease the overall cache size. This way, unnecessary tag comparisons can be prevented and therefore, the cache energy consumption is considerably reduced. Based on the simulation results, the proposed method provides the energy reduction from 22% to 31% for 4-way–32-way set-associative L1 caches bigger than 16[Formula: see text]kB running the MiBench programs. The improvements are attained with a negligible system performance degradation compared to the traditional cache system.

scholarly journals A Cache Architecture for Counting Bloom Filters: Theory and Application

2011 ◽  
Vol 2011 ◽  
pp. 1-10
Author(s):  
Mahmood Ahmadi ◽  
Stephan Wong
Keyword(s):  
Mathematical Analysis ◽  
Bloom Filter ◽  
Packet Classification ◽  
Bloom Filters ◽  
Memory Hierarchies ◽  
Cache Architecture ◽  
Multilevel Memory ◽  
Memory Accesses ◽  
Counting Bloom Filter ◽  
Counting Bloom Filters

Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, for example, utilizing multilevel memory hierarchies, special hardware architectures, and hardware threading. In this paper, we introduce a multilevel memory architecture for counting Bloom filters. Based on the probabilities of incrementing of the counters in the counting Bloom filter, a multi-level cache architecture called the cached counting Bloom filter (CCBF) is presented, where each cache level stores the items with the same counters. To test the CCBF architecture, we implement a software packet classifier that utilizes basic tuple space search using a 3-level CCBF. The results of mathematical analysis and implementation of the CCBF for packet classification show that the proposed cache architecture decreases the number of memory accesses when compared to a standard Bloom filter. Based on the mathematical analysis of CCBF, the number of accesses is decreased by at least 53%. The implementation results of the software packet classifier are at most 7.8% (3.5% in average) less than corresponding mathematical analysis results. This difference is due to some parameters in the packet classification application such as number of tuples, distribution of rules through the tuples, and utilized hashing functions.

The Variable-Increment Counting Bloom Filter

2014 ◽  
Vol 22 (4) ◽  
pp. 1092-1105 ◽  
Author(s):  
Ori Rottenstreich ◽  
Yossi Kanizo ◽  
Isaac Keslassy
Keyword(s):  
Bloom Filter ◽  
Counting Bloom Filter

Improving counting Bloom filter performance with fingerprints

2016 ◽  
Vol 116 (4) ◽  
pp. 304-309 ◽  
Author(s):  
Salvatore Pontarelli ◽  
Pedro Reviriego ◽  
Juan Antonio Maestro
Keyword(s):  
Bloom Filter ◽  
Filter Performance ◽  
Counting Bloom Filter

scholarly journals A Novel Method for Detecting Abnormal Energy Data in Building Energy Monitoring System

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Liang Zhao
Keyword(s):  
Energy Consumption ◽  
Power Consumption ◽  
Real Time ◽  
Difference Method ◽  
Building Energy ◽  
Energy Monitoring ◽  
Order Difference ◽  
Energy Data ◽  
First Order ◽  
Novel Method

This paper presents a novel abnormal data detecting algorithm based on the first order difference method, which could be used to find out outlier in building energy consumption platform real time. The principle and criterion of methodology are discussed in detail. The results show that outlier in cumulative power consumption could be detected by our method.

An Energy-Efficient DRAM Cache Architecture for Mobile Platforms With PCM-Based Main Memory

2022 ◽  
Vol 21 (1) ◽  
pp. 1-22
Author(s):  
Dongsuk Shin ◽  
Hakbeom Jang ◽  
Kiseok Oh ◽  
Jae W. Lee
Keyword(s):  
Energy Consumption ◽  
Main Memory ◽  
Battery Life ◽  
Mobile Platforms ◽  
Total Energy Consumption ◽  
Efficient Manner ◽  
Hybrid Memory ◽  
Spatial Locality ◽  
Cache Architecture ◽  
Energy Delay Product

A long battery life is a first-class design objective for mobile devices, and main memory accounts for a major portion of total energy consumption. Moreover, the energy consumption from memory is expected to increase further with ever-growing demands for bandwidth and capacity. A hybrid memory system with both DRAM and PCM can be an attractive solution to provide additional capacity and reduce standby energy. Although providing much greater density than DRAM, PCM has longer access latency and limited write endurance to make it challenging to architect it for main memory. To address this challenge, this article introduces CAMP, a novel DRAM c ache a rchitecture for m obile platforms with P CM-based main memory. A DRAM cache in this environment is required to filter most of the writes to PCM to increase its lifetime, and deliver highest efficiency even for a relatively small-sized DRAM cache that mobile platforms can afford. To address this CAMP divides DRAM space into two regions: a page cache for exploiting spatial locality in a bandwidth-efficient manner and a dirty block buffer for maximally filtering writes. CAMP improves the performance and energy-delay-product by 29.2% and 45.2%, respectively, over the baseline PCM-oblivious DRAM cache, while increasing PCM lifetime by 2.7×. And CAMP also improves the performance and energy-delay-product by 29.3% and 41.5%, respectively, over the state-of-the-art design with dirty block buffer, while increasing PCM lifetime by 2.5×.

scholarly journals A Bit String Content Aware Chunking Strategy for Reduced CPU Energy on Cloud Storage

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Bin Zhou ◽  
ShuDao Zhang ◽  
Ying Zhang ◽  
JiaHao Tan
Keyword(s):  
Energy Consumption ◽  
Data Center ◽  
System Performance ◽  
Cloud Storage ◽  
High Performance ◽  
Factors Affecting ◽  
Redundant Data ◽  
Energy Factors ◽  
The Cost ◽  
Content Aware

In order to achieve energy saving and reduce the total cost of ownership, green storage has become the first priority for data center. Detecting and deleting the redundant data are the key factors to the reduction of the energy consumption of CPU, while high performance stable chunking strategy provides the groundwork for detecting redundant data. The existing chunking algorithm greatly reduces the system performance when confronted with big data and it wastes a lot of energy. Factors affecting the chunking performance are analyzed and discussed in the paper and a new fingerprint signature calculation is implemented. Furthermore, a Bit String Content Aware Chunking Strategy (BCCS) is put forward. This strategy reduces the cost of signature computation in chunking process to improve the system performance and cuts down the energy consumption of the cloud storage data center. On the basis of relevant test scenarios and test data of this paper, the advantages of the chunking strategy are verified.

Multi-Granularities Counting Bloom Filter

2006 ◽  
pp. 542-551
Author(s):  
Zhou Mingzhong ◽  
Gong Jian ◽  
Ding Wei ◽  
Cheng Guang
Keyword(s):  
Bloom Filter ◽  
Counting Bloom Filter
Sign in / Sign up

Export Citation Format

Share Document