HLHaoran Li

Haoran Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Haoran Li has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    PagePilot: Synergizing Heterogeneous Backend Devices with Reusability-Aware Page Offloading

    by Xingze Liu, Jialin Dong, Xinyu Liu, Lizhi Wang, Shiyang Li, Haoran Li, Xiaoli Gong, Jin Zhang, Pen-Chung Yew

    Page swapping remains the dominant mechanism for extending physical memory in modern operating systems. Despite the emergence of new memory technologies, swap-based memory extension continues to be widely deployed due to its transparency and compatibility with diverse storage backends. However, current Linux swap management relies on a simple priority-based policy when multiple heterogeneous backends are available, and is oblivious to page reuse behavior. As a result, fast devices are often occupied by pages that are rarely reused, while frequently refaulted pages are placed on slow devices, leading to unnecessary performance degradation under memory pressure. We present PagePilot , a reuse-aware page offloading framework for heterogeneous swap systems. PagePilot persistently tracks refault behavior across eviction and refault cycles and uses average refault distance to guide backend selection. In addition, a background migration mechanism corrects misplacements to preserve fast-device capacity for pages with imminent reuse. We implement PagePilot in the Linux 6.3 kernel and evaluate it using representative data-serving and analytics workloads. Our results show that PagePilot improves application throughput and reduces page-fault handling latency under memory pressure, while substantially increasing the fraction of refaults served by fast backends.

  • Open Access

    WallEve: A Cascade Top-k Re-ranking Recommendation for Operational E-commerce

    by Haoran Li, Haoran Li, Xiao Fei, Zhao Shikun, Cao Dingyuan, Xiaoli Gong, Wang Zhen, Jin Zhang

    Re-ranking has become an indispensable part of a recommender system. Based on several online experiments, we have found that there are several complex factors affecting the performance of re-ranking, such as sequence order, the dependency between documents or the diversity of categories. The combinations and interactions of these factors lead to an extremely large search space for the re-ranking model to find an optimal solution. The online behaviour of users is very different from the data collected offline, and such a significant difference implies that the recommendation model should be trained with online interactions to avoid misleading from offline data. Therefore, it is critical to propose an optimized solution within the limited response time for a better user experience. In this paper, we propose a hierarchical cascade Top-k recommendation framework, named WallEve, which can be used to balance the accuracy and efficiency of re-ranking. WallEve employs a contextual bandit algorithm at a high level for proper diversity control, reduction in space exploration and fast convergence. A reinforcement learning model is also employed at a low level to fine-tune the permutation results. Comprehensive experiments have been conducted, and the results show that WallEve outperforms DQN with a superior performance in terms of accuracy and efficiency. The A/B test results in the Taobao online environment show that WallEve improves the UV (Unique Visitor) by 5.5%-77% in different scenarios.

  • Open Access

    Prism: Decomposing Program Semantics for Code Clone Detection through Compilation

    by Haoran Li, Siqian Wang, Weihong Quan, Xiaoli Gong, Huayou Su, Jin Zhang

    Code clone detection (CCD) is of critical importance in software engineering, while semantic similarity is a key evaluation factor for CCD. The embedding technique, which represents an object using a numerical vector, is utilized to generate code representations, where code snippets with similar semantics (clone pairs) should have similar vectors. However, due to the diversity and flexibility of high-level program languages, the code representation of clone pairs may be inconsistent. Assembly code provides the program execution trace and can normalize the diversity of high-level languages in terms of the program behavior semantics. After revisiting the assembly language, we find that different assembly codes can align with the computational logic and memory access patterns of cloned pairs. Therefore, the use of multiple assembly languages can capture the behavior semantics to enhance the understanding of programs. Thus, we propose Prism, a new method for code clone detection fusing behavior semantics from multiple architecture assembly code, which directly captures multilingual domains' syntax and semantic information. Additionally, we introduce a multi-feature fusion strategy that leverages global information interaction to expand the representation space. This fusion process allows us to capture the complementary information from each feature and leverage the relationships between them to create a more expressive representation of the code. After testing the OJClone dataset, the Prism model exhibited exceptional performance with precision and recall scores of 0.999 and 0.999, respectively.


  • Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory

    by Zhang Jiang, Xianduo Li, Tianxiang Peng, Haoran Li, Jingxuan Hong, Jin Zhang, Xiaoli Gong

    Memcached is a widely adopted, high-performance, in-memory key-value object caching system utilized in data centers. Nonetheless, its data is stored in volatile DRAM, making the cached data susceptible to loss during system shutdowns. Consequently, cold restarts experience significant delays. Persistent memory is a byte-addressable, large-capacity, and non-volatility storage media, which can be employed to avoid the cold restart problem. However, deploying Memcached on persistent memory requires consideration of issues such as write endurance, asymmetric read/write latency and bandwidth, and write granularity of persistent memory. In this paper, we propose Hybrid-Memcached, an optimized Memcached framework based on a hybrid combination of DRAM and persistent memory. Hybrid-Memcached includes three key components: (1) a DRAM-based data aggregation buffer to avoid multiple fine-grained writes, which extends the write endurance of persistent memory, (2) a data-object alignment mechanism to avoid write amplification, and (3) a non-temporal store instruction-based writing strategy to improve the bandwidth utilization. We have implemented Hybrid-Memcached on the Intel Optane persistent memory. Several micros-benchmarks are designed to evaluate Hybrid-Memcached by varying read/write ratios, access distributions, and key-value item sizes. Additionally, we evaluated it with the YCSB benchmark, showing a 21.2% performance improvement for fully write-intensive workloads and 11.8% for read-write balanced workloads.