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 条
  • [1] Exploiting the locality of memory references to reduce the address bus energy
    Musoll, E
    Lang, T
    Cortadella, J
    1997 INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN, PROCEEDINGS, 1997, : 202 - 207
  • [2] Exploiting locality and tolerating remote memory access latency using thread migration
    Stephen Jenks
    Jean-Luc Gaudiot
    International Journal of Parallel Programming, 1997, 25 : 281 - 304
  • [3] Exploiting locality and tolerating remote memory access latency using thread migration
    Jenks, S
    Gaudiot, JL
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1997, 25 (04) : 281 - 304
  • [4] Exploiting data locality on scalable shared memory machines with data parallel programs
    Benkner, S
    Brandes, T
    EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 647 - 657
  • [5] Performance evaluation of modified hierarchical ring by exploiting link utilization and memory access locality
    Kwak, JW
    Jhon, CS
    2005 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT), VOLS 1 AND 2, 2005, : 82 - 87
  • [6] Exploiting Memory Access Patterns to Improve Memory Performance in Data-Parallel Architectures
    Jang, Byunghyun
    Schaa, Dana
    Mistry, Perhaad
    Kaeli, David
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (01) : 105 - 118
  • [7] EXPLOITING TEMPORAL LOCALITY FOR ENERGY EFFICIENT MEMORY MANAGEMENT
    Seo, Euiseong
    Maeng, Seungryoul
    Lim, Donghyouk
    Lee, Joonwon
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2008, 17 (05) : 929 - 941
  • [8] Asynchronous Memory Access Unit: Exploiting Massive Parallelism for Far Memory Access
    Wang, Luming
    Zhang, Xu
    Wang, Songyue
    Jiang, Zhuolun
    Lu, Tianyue
    Chen, Mingyu
    Luo, Siwei
    Hijang, Keji
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2024, 21 (03)
  • [9] Using DRAM Buffer to Reduce Persistence and Consistence Overheads of Persistent Memory
    Yuchuan Tian
    Fang Wang
    Wireless Personal Communications, 2018, 102 : 3879 - 3896
  • [10] Understand the Overheads of Storage Data Structures on Persistent Memory
    Islam, Abdullah Al Raqibul
    Dai, Dong
    PROCEEDINGS OF THE 25TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING (PPOPP '20), 2020, : 435 - 436