ZSZhuo Song

Zhuo Song

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Zhuo Song has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    PLUGSCHED+: Efficient and General Live Update and Recovery for Linux Scheduler

    by Zhuo Song, Peng Wang, Yi Tao, Pu Pang, Chengqi Jiang, Quan Chen, Teng Ma, Shuai Xue, Huanle Xu, Tao Ma, et al.

    The scheduler is a critical component of the operating system (OS) and is tightly coupled with Linux. Production-level clouds often host various workloads, and these workloads require different schedulers to achieve high performance. Furthermore, the scheduler may encounter faults during runtime, leading to the kernel panic. Thus the capability of updating and recovering the scheduler lively without rebooting the OS is crucial for the production environments. However, existing techniques only apply for the fine-grained function-level updates, or require extra constraints such as virtualization when performing update and recovery. We therefore propose Plugsched+ to enable scheduler live update and recovery with two key novelties. First, with the idea of modularization, Plugsched+ decouples the scheduler from the Linux kernel to be an independent module. Second, Plugsched+ uses the data rebuild technique to migrate the state from the old scheduler to the new one during live update, or clear anomalous data during live recovery. This scheme can be directly applied to the Linux kernel scheduler in production environments without replacing the kernel. Experimental and production results show that Plugsched+ can effectively update and recover the scheduler lively, and the downtime is no more than tens of milliseconds.

  • Zero+: Monitoring Large-Scale Cloud-Native Infrastructure Using One-Sided RDMA

    by Zhuo Song, Jiejian Wu, Teng Ma, Zhe Wang, Linghe Kong, Zhenzao Wen, Jingxuan Li, Yang Lu, Yong Yang, Tao Ma, et al.

    Cloud services have shifted from monolithic designs to microservices running on cloud-native infrastructure with monitoring systems to ensure service level agreements (SLAs). However, traditional monitoring systems no longer meet the demands of cloud-native monitoring. In Alibaba’s “double eleven” shopping festival, it is observed that the monitor occupies resources of the monitored infrastructure and even disrupts services. In this paper, we propose a novel monitoring system named for cloud-native monitoring. achieves zero overhead in collecting raw metrics using one-sided remote direct memory access (RDMA) and remedies network congestion by adopting a receiver-driven flow control scheme. also features a priority queue mechanism to meet different quality of service requirements and an efficient batch processing design to relieve CPU occupation. has been deployed and evaluated in four different clusters with heterogeneous RDMA NIC devices and architectures in Alibaba Cloud. Results show that achieves no CPU occupation at the monitored host and supports $1\sim10k$ hosts with $0.1\sim1s$ sampling interval using a single thread for network I/O. significantly relieves the incast issue and maintains $80\sim95\%$ of bandwidth utilization in several clusters when monitoring $1k$ hosts. also ensures services with high priority accomplish collecting metrics earlier than low priority ones by at least $400 \mu s$ when monitoring $1k$ hosts.


  • Recalling Direct 2D-3D Matches for Large-Scale Visual Localization

    by Zhuo Song, Chuting Wang, Yuqian Liu, Shuhan Shen

    Estimating the 6-DoF camera pose of an image with respect to a 3D scene model, known as visual localization, is a fundamental problem in many computer vision and robotics tasks. Among various visual localization methods, the direct 2D-3D matching method has become the preferred method for many practical applications due to its computational efficiency. When using direct 2D-3D matching methods in large-scale scenes, a vocabulary tree can be used to accelerate the matching process, which will also induce the quantization artifacts leading to reduce the inlier ratio and decrease the localization accuracy. To this end, in this paper two simple and effective mechanisms, called visibility-based recalling and space-based recalling, are proposed to recover lost matches caused by the quantization artifacts, thus can largely improve the localization accuracy and success rate without increasing too much computational time. Experimental results on long-term visual localization benchmarks demonstrate the effectiveness of our method compared with state-of-the-arts.