Secure and Dynamic Core and Cache Partitioning for Safe and Efficient Server Consolidation

被引:8
|
作者
Han, Myeonggyun [1 ]
Yu, Seongdae [1 ]
Baek, Woongki [1 ]
机构
[1] UNIST, Sch ECE, Ulsan, South Korea
基金
新加坡国家研究基金会;
关键词
D O I
10.1109/CCGRID.2018.00046
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With server consolidation, latency-critical and batch workloads are collocated on the same physical servers. The resource manager dynamically allocates the hardware resources to the workloads to maximize the overall throughput while providing the service-level objective (SLO) guarantees for the latency-critical workloads. As the hardware resources are dynamically allocated across the workloads on the same physical server, information leakage can be established, making them vulnerable to micro-architectural side-channel attacks. Despite extensive prior works, it remains unexplored to investigate the efficient design and implementation of the dynamic resource management system that maximizes resource efficiency without compromising the SLO and security guarantees. To bridge this gap, this work proposes SDCP, secure and dynamic core and cache partitioning for safe and efficient server consolidation. In line with the state-of-the-art dynamic server consolidation techniques, SDCP dynamically allocates the hardware resources (i.e., cores and caches) to maximize the resource utilization with the SLO guarantees. In contrast to the existing techniques, however, SDCP dynamically sanitizes the hardware resources to ensure that no micro-architectural side channel is established between different security domains. Our experimental results demonstrate that SDCP provides high resource sanitization quality, incurs small performance overheads, and achieves high resource efficiency with the SLO and security guarantees.
引用
收藏
页码:311 / 320
页数:10
相关论文
共 50 条
  • [1] SDRP: Safe, Efficient, and SLO-Aware Workload Consolidation Through Secure and Dynamic Resource Partitioning
    Han, Myeonggyun
    Baek, Woongki
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (04) : 1868 - 1882
  • [2] SecDCP: Secure Dynamic Cache Partitioning for Efficient Timing Channel Protection
    Wang, Yao
    Ferraiuolo, Andrew
    Zhang, Danfeng
    Myers, Andrew C.
    Suh, G. Edward
    2016 ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2016,
  • [3] FairSDP: Fair and Secure Dynamic Cache Partitioning
    Sari, Sercan
    Demir, Onur
    Kucuk, Gurhan
    2019 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2019, : 469 - 474
  • [4] DICER: Diligent Cache Partitioning for Efficient Workload Consolidation
    Nikas, Konstantinos
    Papadopoulou, Nikela
    Giantsidi, Dimitra
    Karakostas, Vasileios
    Goumas, Georgios
    Koziris, Nectarios
    PROCEEDINGS OF THE 48TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP 2019), 2019,
  • [5] SCALE: Secure and Scalable Cache Partitioning
    Holtryd, Nadja Ramhoj
    Manivannan, Madhavan
    Stenstrom, Per
    2023 IEEE INTERNATIONAL SYMPOSIUM ON HARDWARE ORIENTED SECURITY AND TRUST, HOST, 2023, : 68 - 79
  • [6] Implications of Cache Asymmetry on Server Consolidation Performance
    Apparao, Padma
    Iyer, Ravi
    Newell, Don
    2008 IEEE INTERNATIONAL SYMPOSIUM ON WORKLOAD CHARACTERIZATION, 2008, : 22 - 30
  • [7] M-Party: A Secure Dynamic Cache Partitioning by More Than Two Parties
    Lin, Yuan-Tai
    Sun, Chin-Yu
    Hwang, TingTing
    2023 IEEE 36TH INTERNATIONAL SYSTEM-ON-CHIP CONFERENCE, SOCC, 2023, : 42 - 47
  • [8] Dynamic cache partitioning based on the MLP of cache misses
    Moreto M.
    Cazorla F.J.
    Ramirez A.
    Valero M.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6590 : 3 - 23
  • [9] Dynamic Partitioning of Shared Cache Memory
    G. E. Suh
    L. Rudolph
    S. Devadas
    The Journal of Supercomputing, 2004, 28 : 7 - 26
  • [10] Dynamic partitioning of shared cache memory
    Suh, GE
    Rudolph, L
    Devadas, S
    JOURNAL OF SUPERCOMPUTING, 2004, 28 (01): : 7 - 26