李权熹 (Quanxi Li)

Developing memory-disaggregated applications atop the emerging I/O fabrics is drawing more attention from industry and academia due to its ability to break the memory capacity wall and improve resource utilization. However, the microsecond(μs)-scale I/O fabrics raise tension between the programming productivity and performance. The multithreaded synchronous programming model is popular in developing memory-disaggregated applications due to its intuitive program logic. However, our key insight is that although thread switching can effectively mitigate the μs-scale latency, it leads to poor data locality and non-trivial scheduling overhead, leaving significant opportunities to improve the performance further.

This paper proposes a memory-disaggregated framework, Beehive, which improves the remote access throughput by exploiting the asynchrony within each thread. Beehive contains three components: the programming interfaces, the Rust compiler, and the runtime system. To improve the programming usability, Beehive allows the programmers to develop applications in the conventional multithreaded synchronous model and automatically transforms the code into pararoutine (a newly proposed computation and scheduling unit) based asynchronous code via the compiler. We evaluated Beehive with eight workloads, including data analytics, graph processing frameworks, machine learning frameworks, key-value stores, web services etc. As a result, Beehive outperforms the state-of-the-art memory-disaggregated frameworks, i.e., Hermit and AIFM, by 3.05× and 1.58× on average, correspondingly.