JLJialong Li

Jialong 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


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


Latest Publications

  • QoS fusion-driven optimization of routing cooperation mechanisms in IoT multi-AS communication networks

    by Ying Zhou, Ziyang Chen, Huilin Ai, Zhiwei Yu, Heng Xu, Chengze Du, Jialong Li

  • Open Access

    FMD-AL: Cold-Start Active Learning based on Foundation Model

    by Huilin Ai, Ying Zhou, Zhonghua Peng, Ziyang Chen, Shuang Guo, Heng Xu, Zhiwei Yu, Jialong Li

  • Open Access

    LDCS-Net: Local Dual-Context Attention Network for 3D Semantic Segmentation

    by Shuang Guo, Ying Zhou, Meina Song, Huilin Ai, Jia Long Li, Zi Yang Chen

  • Temporal-Aware GPU Resource Allocation for Distributed LLM Inference via Reinforcement Learning

    by Chengze Du, Zhiwei Yu, Heng Xu, Haojie Wang, Bo Liu, Jialong Li

    The rapid growth of large language model (LLM) services imposes increasing demands on distributed GPU inference infrastructure. Most existing scheduling systems follow a reactive paradigm, relying solely on the current system state to make decisions, without considering how task demand and resource availability evolve over time. This lack of temporal awareness in reactive approaches leads to inefficient GPU utilization, high task migration overhead, and poor system responsiveness under dynamic workloads. In this work, we identify the fundamental limitations of these instantaneous-state-only scheduling approaches and propose Temporal Optimal Resource scheduling via Two-layer Architecture (TORTA). TORTA introduces a spatiotemporal scheduling framework that captures both long-term workload patterns and short-term execution constraints. It adopts a two-layer design: a macro-level scheduler leverages reinforcement learning and optimal transport to coordinate inter-region task distribution, while a micro-level allocator refines task-to-server assignments within each region to reduce latency and switching costs. Experimental results across multiple network topologies show that TORTA reduces average inference response time by up to 15%, improves load balance by approximately 4-5%, and cuts total operational cost by 10-20% compared to state-of-the-art baseline methods.


  • Gsched: Coordinated Flow-Control and Priority Scheduling for DNN Training in AI Cluster

    by Heng Xu, Chengze Du, Zhiwei Yu, Letian Li, Ying Zhou, Bo Liu, Jialong Li

    Distributed deep neural network (DNN) training in multi-tenant cloud environments generates long-lived, bandwidth-intensive, and interdependent flows that challenge traditional fairness-based network scheduling. We present Gsched, a framework that orchestrates centralized planning with hardware priority enforcement to realize communication interleaving, thereby eliminating contention and maximizing pipeline efficiency. Unlike methods relying on complex rate control or custom switch hardware, Gsched leverages standard commodity switch features like DSCP and SPQ to enforce strict priority scheduling. It employs a cold-start profiling mechanism to capture task characteristics without user intervention, and a centralized solver to compute the optimal interleaving order that maximizes Average Transmission Efficiency (ATE). Our analysis proves that this prioritization strategy deterministically drives the system to a contention-free state, while a local perturbation theorem guarantees robustness against distributed execution conflicts via network backpressure. Across workloads, Gsched achieves performance close to the state-of-the-art Crux under heterogeneous workloads and remains competitive in highly diverse cases. More importantly, Gsched provides a theoretical foundation that justifies scalable per-bottleneck scheduling in multi-bottleneck networks.


  • S3AD: Efficient industrial anomaly detection via selection, space, and scale

    by Zhonghua Peng, Chengyang Dong, Bo Liu, Zuoyong Li, Kun Zeng, Jialong Li


  • Open Access

    QoS Fusion-Driven Optimization of Routing Cooperation Mechanisms in IoT Multi-AS Communication Networks

    by Ying Zhou, Ziyang Chen, Huilin Ai, Zhiwei Yu, Heng Xu, Chengze Du, Fan Yang, Jialong Li

    To meet the specific Quality of Service (QoS) requirements of Internet of Things (IoT) networks, routing optimization in inter-domain communication is crucial. Existing inter-AS routing protocols typically focus on route reachability based solely on neighboring ASes, neglecting global QoS metrics such as latency and packet loss. Moreover, intra-AS protocols are limited to single-AS optimization, preventing effective cross-AS coordination. This paper presents a novel QoS-Aware Federated Reinforcement Learning Routing algorithm (Q-FRLR), which constructs a transmission delay probability distribution using both historical and real-time AS link data. By mapping delay thresholds to packet loss probabilities, the multi-objective optimization problem is reformulated into a single-objective problem to minimize end-to-end delay during path selection. Q-FRLR incorporates homomorphic encryption to securely share desensitized five-tuple data across ASes, allowing each AS to train a local reinforcement learning model using historical QoS data, while fine-tuning it with cross-AS information. A Software Defined Networking (SDN) controller aggregates QoS scores, dynamically adjusts routing weights, and makes real-time routing decisions. Experimental results conducted in Mininet on three large-scale network topologies demonstrate that Q-FRLR reduces average end-to-end delay by 9.01% compared to the optimal benchmark, and decreases controller decision time by 11.34%, eliminating the need for global model training.

  • RailS: Load Balancing for All-to-All Communication in Distributed Mixture-of-Experts Training

    by Heng Xu, Zhiwei Yu, Chengze Du, Ying Zhou, Letian Li, Haojie Wang, Weiqiang Cheng, Jialong Li

    Training Mixture-of-Experts (MoE) models introduces sparse and highly imbalanced all-to-all communication that dominates iteration time. Conventional load-balancing methods fail to exploit the deterministic topology of Rail architectures, leaving multi-NIC bandwidth underutilized. We present RailS, a distributed load-balancing framework that minimizes all-to-all completion time in MoE training. RailS leverages the Rail topology’s symmetry to prove that uniform sending ensures uniform receiving, transforming global coordination into local scheduling. Each node independently executes a Longest Processing Time First (LPT) spraying scheduler to proactively balance traffic using local information. RailS activates N parallel rails for fine-grained, topology-aware multipath transmission. Across synthetic and real-world MoE workloads, RailS improves bus bandwidth by 20%–78% and reduces completion time by 17%–78%. For Mixtral workloads, it shortens iteration time by 18%–40% and achieves near-optimal load balance, fully exploiting architectural parallelism in distributed training.


  • FedSA-CE: Selection-Aware Clustering for Personalized Federated Learning in Heterogeneous Vehicular Networks

    by Ying Zhou, Ziyang Chen, Huilin Ai, Heng Xu, Chengze Du, Guangjing He, Jialong Li

    Federated learning (FL) is being increasingly adopted in consumer-electronics (CE)-enabled vehicular networks to support privacy-preserving model training. However, the performance of existing FL frameworks significantly degrades under practical heterogeneous conditions, where devices differ in data distribution, computing capabilities, and wireless link quality. To address these challenges, we develop a delay-aware system model that quantifies per-CE computation and communication costs, and formulates a resource-constrained integer programming strategy for CE selection. Building on this model, we propose FedSA-CE, a selection-aware clustering framework tailored for personalized FL in dynamic vehicular environments. FedSA-CE extracts compact CE representations using truncated Singular Value Decomposition (SVD), groups CEs based on cosine similarity, and adaptively selects participants via a contribution– latency objective with time-decaying weighting. The framework prioritizes CEs with rapidly changing gradients in early training phases to accelerate convergence and gradually incorporates more diverse CEs in later stages to enhance generalization while maintaining acceptable waiting time. A similarity-weighted personalized aggregation scheme further improves local model adaptation. Experiments on 4 benchmark datasets demonstrate that FedSA-CE achieves an average accuracy improvement of 24.7% and reduces average waiting time by 83.0% compared with 7 state-of-the-art baselines. Moreover, under all extreme non-independent and identically distributed (Non-IID) settings, FedSA-CE yields an average minimum accuracy gain of 2.92% over the best-performing competing method across all datasets.


  • REACH: Reinforcement Learning for Efficient Allocation in Community and Heterogeneous Networks

    by Zhiwei Yu, Chengze Du, Heng Xu, Ying Zhou, Bo Liu, Jialong Li

    Community GPU(Graphics Processing Unit) platforms are emerging as a cost-effective and democratized alternative to centralized GPU clusters for AI(Artificial Intelligence) workloads, aggregating idle consumer GPUs from globally distributed and heterogeneous environments. However, their extreme hardware/software diversity, volatile availability, and variable network conditions render traditional schedulers ineffective, leading to suboptimal task completion. In this work, we present REACH (Reinforcement Learning for Efficient Allocation in Community and Heterogeneous Networks), a Transformer-based reinforcement learning framework that redefines task scheduling as a sequence scoring problem to balance performance, reliability, cost, and network efficiency. By modeling both global GPU states and task requirements, REACH learns to adaptively co-locate computation with data, prioritize critical jobs, and mitigate the impact of unreliable resources. Extensive simulation results show that REACH improves task completion rates by up to 17%, more than doubles the success rate for high-priority tasks, and reduces bandwidth penalties by over 80% compared to state-of-the-art baselines. Stress tests further demonstrate its robustness to GPU churn and network congestion, while scalability experiments confirm its effectiveness in large-scale, high-contention scenarios.