Priority‐based contention‐avoidance resource allocation algorithm for disaggregated data centers
TL;DR
A priority‐based contention‐avoidance (PCA) resource‐allocation method for disaggregated data centers (dDCs) that achieves a round‐trip time (RTT) of under 1 μs and achieves the lowest latency is proposed.
Abstract
In this study, we propose a priority‐based contention‐avoidance (PCA) resource‐allocation method for disaggregated data centers (dDCs) that achieves a round‐trip time (RTT) of under 1 μs. The proposed scheme employs the disaggregated resource manager (dRM), which applies both the contention‐avoidance method and the best‐fit allocation (BFA) method, depending on whether an application is memory‐intensive (MI) or CPU‐intensive (CI), to ensure lower memory‐access delays for delay‐sensitive, higher‐priority services while promoting efficient resource allocation. This approach reduces contention and maintains priority balance by minimizing traffic concentration and prioritizing higher‐priority services across specific memory locations. We evaluate the performance of the proposed scheme in terms of RTT, memory‐access queuing delay, and end‐to‐end (ETE) delay using the OPNET simulator. The results demonstrate that the PCA scheme achieves the lowest latency, with a maximum of 0.89 μs, compared with maximum latencies of approximately 2.6 and 1.2 μs for the first‐fit allocation (FFA) and BFA schemes, respectively, when the offered load is 0.9.