Address Order Violation Detection with Parallel Counting Bloom Filters
-
- KURATA Naruki
- Graduate School of Information Science and Technology, The University of Tokyo
-
- SHIOYA Ryota
- Graduate School of Engineering, Nagoya University
-
- GOSHIMA Masahiro
- National Institute of Informatics
-
- SAKAI Shuichi
- Graduate School of Information Science and Technology, The University of Tokyo
Description
To eliminate CAMs from the load/store queues, several techniques to detect memory access order violation with hash filters composed of RAMs have been proposed. This paper proposes a technique with parallel counting Bloom filters (PCBF). A Bloom filter has extremely low false positive rates owing to multiple hash functions. Although some existing researches claim the use of Bloom filters, none of them make mention to multiple hash functions. This paper also addresses the problem relevant to the variety of access sizes of load/store instructions. The evaluation results show that our technique, with only 2720-bit Bloom filters, achieves a relative IPC of 99.0% while the area and power consumption are greatly reduced to 14.3% and 22.0% compared to a conventional model with CAMs. The filter is much smaller than usual branch predictors.
Journal
-
- IEICE Transactions on Electronics
-
IEICE Transactions on Electronics E98.C (7), 580-593, 2015
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1390001204378401792
-
- NII Article ID
- 130005086133
-
- ISSN
- 17451353
- 09168524
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
- OpenAIRE
-
- Abstract License Flag
- Disallowed