Reduce data coherence cost with an area efficient double layer counting bloom filter

Kuan Ting Chen, Ping Ru Wu, Bo-Cheng Lai

    研究成果: Conference contribution同行評審

    3 引文 斯高帕斯(Scopus)

    摘要

    The snoopy protocol is a widely used scheme to maintain cache coherence. However, the protocol requires a broadcast scheme and forces substantial unnecessary data searches at the local cache. This paper proposes a novel Double Layer Counting Bloom Filter (DLCBF) to significantly reduce the redundant data searches and transmission. The DLCBF implements an extra layer of hash function and the counting feature at each filter entry. By using the hierarchical structure of the hash function, DLCBF can effectively increase the successful filter rates while requiring a smaller memory usage than the conventional Bloom filters. Experimental results show that the DLCBF can screen out 4.05X of unnecessary cache searches and use 18.75% less memory compared to conventional Bloom filters. The DLCBF is also used to filter out the redundant data transmission on a hierarchical shared bus. Simulation results show that the DLCBF outperforms conventional filters by 58% for local transmissions and 1.86X for remote transmissions.

    原文English
    主出版物標題Proceedings - 2012 5th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2012
    頁面7-12
    頁數6
    DOIs
    出版狀態Published - 1 12月 2012
    事件2012 5th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2012 - Taipei, Taiwan
    持續時間: 17 12月 201220 12月 2012

    出版系列

    名字Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP
    ISSN(列印)2168-3034
    ISSN(電子)2168-3042

    Conference

    Conference2012 5th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2012
    國家/地區Taiwan
    城市Taipei
    期間17/12/1220/12/12

    指紋

    深入研究「Reduce data coherence cost with an area efficient double layer counting bloom filter」主題。共同形成了獨特的指紋。

    引用此