Exploiting Data Locality in Memory for ORAM to Reduce Memory Access Overheads

被引:0
|
作者
Kuang, Jinxi [1 ]
Shen, Minghua [1 ]
Lu, Yutong [1 ]
Xiao, Nong [1 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou, Peoples R China
关键词
D O I
10.1145/3489517.3530547
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a locality-aware Oblivious RAM (ORAM) primitive, named Green ORAM, which exploits spatial locality of data in the physical memory for reducing ORAM overheads. The Green ORAM is novel consisting of three policies. The first is row-guided label allocation used for mapping spatial locality onto ORAM tree to reduce the number of memory commands. The second is segment-based path replacement able to improve the data locality within the path in the ORAM tree in order to remove the redundant memory accesses. The third is multi-path write-back able to improve the data locality between different paths in order to obtain theoretical best stash hit rate. Notably, the Green ORAM still maintains the security as we analyzed. Experimental results show that Green ORAM achieves a 28.72% access latency reduction, and a 19.06% memory energy consumption reduction on average, compared with the state-of-the-art String ORAM.
引用
收藏
页码:703 / 708
页数:6
相关论文
共 50 条
  • [21] Exploiting Content Locality to Improve the Performance and Reliability of Phase Change Memory
    Wu, Suzhen
    Xi, Zaifa
    Mao, Bo
    Jiang, Hong
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2014, PT II, 2014, 8631 : 339 - 351
  • [22] Algorithm for optimally exploiting spatial and temporal locality in upper memory levels
    Versailles Univ, France
    IEEE Trans Comput, 2 (150-158):
  • [23] Memory Allocation Exploiting Temporal Locality for Reducing Data-Transfer Bottlenecks in Heterogeneous Multicore Processors
    Waidyasooriya, Hasitha Muthumala
    Ohbayashi, Yosuke
    Hariyama, Masanori
    Kameyama, Michitaka
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2011, 21 (10) : 1453 - 1466
  • [24] On the effectiveness of runtime techniques to reduce memory sharing overheads in distributed Java']Java implementations
    Lobosco, Marcelo
    Loques, Orlando
    de Amorim, Claudio L.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2008, 20 (13): : 1509 - 1538
  • [25] Memory Access Scheduling to Reduce Thread Migrations
    Damani, Sana
    Barua, Prithayan
    Sarkar, Vivek
    CC'22: PROCEEDINGS OF THE 31ST ACM SIGPLAN INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION, 2022, : 144 - 155
  • [26] Exploiting memory access patterns of programs for energy-efficient memory system techniques
    Zhang, T.-F. (tfzhang@mail.zjgsu.edu.cn), 1600, Chinese Academy of Sciences (25):
  • [27] The Random Address Shift to Reduce the Memory Access Congestion on the Discrete Memory Machine
    Nakano, Koji
    Matsumae, Susumu
    Ito, Yasuaki
    2013 FIRST INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2013, : 95 - 103
  • [28] Exploiting k-constraints to reduce memory overhead in continuous queries over data streams
    Babu, S
    Srivastava, U
    Widom, J
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2004, 29 (03): : 545 - 580
  • [29] Exploiting an infrastructure IP to reduce memory diagnosis costs in SoCs
    Bernardi, P
    Grosso, A
    Rebaudengo, M
    Reorda, MS
    ETS 2005:10TH IEEE EUROPEAN TEST SYMPOSIUM, PROCEEDINGS, 2005, : 202 - 207
  • [30] Reducing energy consumption of multiprocessor SoC architectures by exploiting memory bank locality
    Kandemir, Mahmut Taylan
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2006, 11 (02) : 410 - 441