SQShuo Quan

Shuo Quan

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shuo Quan has a total of 35 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Efficient Strict Serializability for Stateful Serverless Workflows via Workflow Reconciliation

    by Shenghao Ao, Zijun Li, Chuhao Xu, Quan Chen, Shuo Quan, Yanan Yang, Meiqi Zhu, Yujun Wang, Jie Wu, Minyi Guo

  • Open Access

    Delphinus: Improving Resource Efficiency of Applications with Shared Microservices and Diverse Queries

    by Jiuchen Shi, Jinyuan Chen, Quan Chen, Kaihua Fu, Fanrong Du, Zijun Li, Deze Zeng, Jiannong Cao, Shuo Quan, Jie Wu, et al.

    Microservices are widely shared in production user-facing applications. These shared microservices have various resource usage patterns when queries from different call graphs of different services access them. However, existing microservice management works fail to efficiently scale resources for them, mainly due to the lack of fine-grained scheduling of diverse queries. We therefore propose Delphinus , a runtime system that efficiently manages resources for shared microservices while ensuring the Quality-of-Service (QoS). Delphinus comprises a group-oriented query scheduler and a borrowing-based load adapter . The query scheduler identifies diverse queries, groups the containers of shared microservices, and schedules the queries into separate groups. The load adapter efficiently scales resources for shared microservices, and fully utilizes the idle containers among groups when the loads of diverse queries change. Results show that Delphinus reduces CPU and memory usage by 40.1% and 36.4% for shared microservices, respectively, compared to state-of-the-art works.

  • Open Access

    FaaSBoard: Efficient Graph Processing with a Disaggregated Architecture on Serverless Services

    by Yushi Liu, Yikang Ruan, Letian Ruan, Zijun Li, Sen Gao, Weihao Cui, Shixuan Sun, Quan Chen, Shuo Quan, Jie Wu, et al.

    Graph processing workloads are increasingly being migrated to the cloud. With the growing adoption of serverless computing, graph processing gains advantages such as cost-effectiveness and resource elasticity. However, existing graph processing systems with monolithic function architecture struggle to detect intra-job resource elasticity and suffer from significant communication overhead. In this paper, we present FaaSBoard, a graph processing system with a disaggregated serverless architecture powered entirely by serverless cloud services. FaaSBoard features a multi-tier data communication mechanism and an autonomous-elastic computing mechanism. Specifically, these two mechanisms are realized through image-based graph loading for faster starts, proxy-based collective communication leveraging high-bandwidth shared memory, 2D balanced graph partitioning for improved load balance, and a proactive terminate-and-respawn mechanism enabling fine-grained elasticity. Together, these four techniques collectively enhance both resource and overall execution efficiency. Experimental results demonstrate that FaaSBoard delivers up to 3.8× higher compute performance and reduces monetary cost by up to 61.5% compared to FaaSGraph, the current state-of-the-art serverless-based graph processing system. The source code of FaaSBoard is publicly available athttps://github.com/SJTU-Liquid/FaaSBoard.

  • Redundant Hierarchical Ring All-Reduce in Hypercubes

    by Huimei Guo, Shuo Quan, Rong-Xia Hao, Jie Wu

    Distributed training of large language models demands efficient gradient synchronization strategies. Existing All Reduce algorithms often fail to fully leverage underlying topological properties, resulting in low edge utilization and unbalanced load in hypercube networks. This paper proposes a Redundant Hierarchical Ring All-Reduce (RHRA) algorithm tailored for hypercube topologies. The algorithm first designs a hierarchical Ring All-Reduce structure with high edge utilization by exploiting the hypercube's inherent high parallelism and symmetry, proving that the optimal number of hierarchical layers is n 2. It then introduces controlled redundancy, dynamically adjusting transmission strategies based on the relationship between the value of bandwidth B and the value of data volume D to reduce communication hops and transmission latency while ensuring reliability. Experiments demonstrate that our algorithm achieves the minimum number of gradient synchronization hops under varying bandwidth constraints, with end-to-end transmission time significantly outperforming existing schemes. Further reliability simulations verify its effectiveness in balancing redundancy to prevent resource waste while maintaining high reliability.

  • Open Access

    FaaSGNN: Enabling Memory Efficient and Low Latency GNN Inference Services with Serverless Computing

    by Yuzhuo Yang, Kaihua Fu, Quan Chen, Deze Zeng, Shuo Quan, Jie Wu, Minyi Guo


  • Lightweight and Holistic-Scalable Serverless Secure Container Runtime for High-Density Deployment and High-Concurrency Startup

    by Zijun Li, Chenyang Wu, Chuhao Xu, Quan Chen, Shuo Quan, Bin Zha, Qiang Wang, Weidong Han, Jie Wu, Minyi Guo

    The secure container that hosts a single container in a micro virtual machine (VM) is now used in serverless computing, as the containers are isolated through the microVMs. There are high demands on the high-density container deployment and high-concurrency container startup to improve both the resource utilization and user experience, as user functions are fine-grained in serverless platforms. Our investigation shows that the entire software stacks, containing the cgroups in the host operating system, the guest operating system, and the container rootfs for the function workload, together result in low deployment density and slow startup performance at high-concurrency. We propose a lightweight and holistic-scalable secure container runtime, named RunD-V, to resolve above problems in serverless computing. RunD-V proposes a guest-to-host runtime template for microVM scaling-out, and CR-bind feature in guest kernel for microVM scaling-up. Using guest-to-host runtime template, over 200 secure containers can be launched within 1s on a node equipped with 104 vCPUs. It also enables more than 2,500 secure containers to be deployed on a node with 384GB of memory. The vertical scaling mechanism CR-bind further enhances both startup concurrency and deployment density.


  • Open Access

    Time Series Classification Based on Multi-Dimensional Feature Fusion

    by Shuo Quan, Mengyu Sun, Xiangyu Zeng, Xuliang Wang, Zeya Zhu

    Time series classification is a key problem in data mining, most of existing classification methods directly extract one-dimensional data from one-dimensional features, which cannot effectively express the inter-relation between different time points. Besides, some classification methods extract two-dimensional features through encoding raw one-dimensional data into two-dimensional images, and part of information is lost due to the difference of encoding methods. How to make full use of one-dimensional and two-dimensional features to extract valuable information and integrate them in an optimal fashion remains a promising challenge. In this paper, we propose a multi-scale convolutional network to extract one-dimensional features from time series for obtaining more feature information based on multi-scale convolution kernels. Two-dimensional features are constructed in terms of two-dimensional image coding based on ${G}$ ramian angular field, ${M}$ arkov transition field and ${R}$ ecurrence plot (GMR) methods. We develop a multi-dimensional feature fusion approach leveraging ${S}$ queeze-and- ${E}$ xcitation (SE) and ${S}$ elf- ${A}$ ttention (SA) mechanism to effective fusing one-dimensional multi-scale features and two-dimensional image features in terms of weight setting. We conduct experimental verification based on 84 complete data traces from a typical UCR dataset in the field. Experimental results show that the accuracy of our proposed approach improves by 3.35% compared with existing benchmark methods. The Grad ient-weighted ${C}$ lass ${A}$ ctivation ${M}$ apping (Grad-CAM) visualization analysis method is adopted, where our proposed approach extracts more accurate features and effectively distinguishes different time series data categories.