RPC: An Approach for Reducing Compulsory Misses in Packet Processing Cache

被引:0
|
作者
Yamaki, Hayato [1 ]
Nishi, Hiroaki [2 ]
Miwa, Shinobu [1 ]
Honda, Hiroki [1 ]
机构
[1] Univ Electrocommun, Dept Comp & Network Engn, Chofu, Tokyo 1828585, Japan
[2] Keio Univ, Dept Syst Design Engn, Yokohama, Kanagawa 2238522, Japan
来源
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2020年 / E103D卷 / 12期
关键词
internet router; packet processing cache; data prediction; POWER;
D O I
10.1587/transinf.2020EDP7035
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a technique to reduce compulsory misses of packet processing cache (PPC), which largely affects both throughput and energy of core routers. Rather than prefetching data, our technique called response prediction cache (RPC) speculatively stores predicted data in PPC without additional access to the low-throughput and power-consuming memory (i.e., TCAM). RPC predicts the data related to a response flow at the arrival of the corresponding request flow, based on the request-response model of internet communications. Our experimental results with 11 real-network traces show that RPC can reduce the PPC miss rate by 13.4% in upstream and 47.6% in downstream on average when we suppose three-layer PPC. Moreover, we extend RPC to adaptive RPC (A-RPC) that selects the use of RPC in each direction within a core router for further improvement in PPC misses. Finally, we show that A-RPC can achieve 1.38x table-lookup throughput with 74% energy consumption per packet, when compared to conventional PPC.
引用
收藏
页码:2590 / 2599
页数:10
相关论文
共 50 条
  • [1] RPC: An approach for reducing compulsory misses in packet processing cache
    Yamaki, Hayato
    Nishi, Hiroaki
    Miwa, Shinobu
    Honda, Hiroki
    IEICE Transactions on Information and Systems, 2020, E103D (12): : 2590 - 2599
  • [2] Reducing cache misses through cache line overlapping
    Koo, S
    Kim, S
    Azougagh, D
    Cho, Y
    Maeng, S
    ELECTRONICS LETTERS, 2006, 42 (10) : 569 - 571
  • [3] Reducing garbage collector cache misses
    Boehm, Hans-J.
    HP Laboratories Technical Report, 2000, (99):
  • [4] Reducing garbage collector cache misses
    Boehm, HJ
    ACM SIGPLAN NOTICES, 2001, 36 (01) : 59 - 64
  • [5] Reducing cache misses through programmable decoders
    Zhang, Chuanjun
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2007, 4 (04) : 1 - 31
  • [6] Reducing Migration-induced Cache Misses
    Reza, Sajjid
    Byrd, Gregory T.
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW), 2012, : 1732 - 1741
  • [7] Victim retention for reducing cache misses in tiled chip multiprocessors
    Das, Shirshendu
    Kapoor, Hemangee K.
    MICROPROCESSORS AND MICROSYSTEMS, 2014, 38 (04) : 263 - 275
  • [8] Effective cache replacement policy for packet processing cache
    Yamaki, Hayato
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2020, 33 (14)
  • [9] Speeding up kernel scheduler by reducing cache misses - Effects of cache coloring for a task structure
    Yamamura, S
    Hirai, A
    Sato, M
    Yamamoto, M
    Naruse, A
    Kumon, K
    USENIX ASSOCIATION PROCEEDINGS OF THE FREENIX TRACK, 2002, : 275 - 285
  • [10] Reducing Shared Cache Misses via dynamic Grouping and Scheduling on Multicores
    El Din, Wael Amr Hossam
    ElSayed, Hany Mohamed
    Talkhan, Ihab ElSayed
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2014, 5 (09) : 135 - 144