Guanyu Ding
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Guanyu Ding has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jie Si Yang
The University of Utah, Salt Lake City, UT, USA
2 shared publications - Shiyu Yang
University of California, Los Angeles, Los Angeles, CA, USA
2 shared publications - Han Lin
University of WisconsinMadison, Madison, WI, USA
1 shared publication Zifan Chen
University of Pennsylvania, Philadelphia, PA, USA
1 shared publication- Zifan Chen
University of Pennsylvania, Philadelphia, PA, USA
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Computer Society
- Vol. 7, 560-573
LLM-Driven Adaptive Cloud Resource Scheduling: Bridging Reasoning Intelligence With Optimization Guarantees
Cloud resource scheduling presents a fundamental challenge in modern distributed computing, where heterogeneous workloads, complex task dependencies, and multi-objective optimization requirements exceed the capabilities of traditional rule-based and small-scale machine learning approaches. Existing schedulers struggle to dynamically adapt to evolving workload patterns while simultaneously satisfying Service Level Agreement (SLA) constraints, resource efficiency targets, and fairness policies. This paper introduces LLMSched, a novel Large Language Model (LLM)-driven adaptive scheduling framework that synergistically combines the contextual reasoning capabilities of foundation models with the execution guarantees of classical optimization techniques. Our approach transforms heterogeneous cluster states-including task dependency graphs, real-time resource utilization metrics, and SLA specifications-into a unified structured-textual representation that leverages LLMs' few-shot learning and causal reasoning abilities to generate intelligent scheduling candidates. These candidates are subsequently refined through a lightweight Integer Linear Programming (ILP) module that ensures feasibility and optimality under resource constraints. We evaluate LLMSched on Google's production cluster trace dataset, demonstrating significant improvements over state-of-the-art baselines: 23.7% reduction in average job completion time, 18.4% improvement in resource utilization efficiency, and 31.2% decrease in SLA violations across diverse workload scenarios. Extensive ablation studies validate the contributions of each architectural component, while robustness analysis under workload perturbations confirms the framework's practical viability. Our work establishes a new paradigm for intelligent resource management that bridges the gap between neural reasoning and algorithmic precision, opening avenues for LLM applications in systems optimization domains.
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Computer Society
- Vol. 7, 560-573
Top Cited PapersOpen AccessLLM-Driven Adaptive Cloud Resource Scheduling: Bridging Reasoning Intelligence With Optimization Guarantees
Cloud resource scheduling presents a fundamental challenge in modern distributed computing, where heterogeneous workloads, complex task dependencies, and multi-objective optimization requirements exceed the capabilities of traditional rule-based and small-scale machine learning approaches. Existing schedulers struggle to dynamically adapt to evolving workload patterns while simultaneously satisfying Service Level Agreement (SLA) constraints, resource efficiency targets, and fairness policies. This paper introduces LLMSched, a novel Large Language Model (LLM)-driven adaptive scheduling framework that synergistically combines the contextual reasoning capabilities of foundation models with the execution guarantees of classical optimization techniques. Our approach transforms heterogeneous cluster states-including task dependency graphs, real-time resource utilization metrics, and SLA specifications-into a unified structured-textual representation that leverages LLMs' few-shot learning and causal reasoning abilities to generate intelligent scheduling candidates. These candidates are subsequently refined through a lightweight Integer Linear Programming (ILP) module that ensures feasibility and optimality under resource constraints. We evaluate LLMSched on Google's production cluster trace dataset, demonstrating significant improvements over state-of-the-art baselines: 23.7% reduction in average job completion time, 18.4% improvement in resource utilization efficiency, and 31.2% decrease in SLA violations across diverse workload scenarios. Extensive ablation studies validate the contributions of each architectural component, while robustness analysis under workload perturbations confirms the framework's practical viability. Our work establishes a new paradigm for intelligent resource management that bridges the gap between neural reasoning and algorithmic precision, opening avenues for LLM applications in systems optimization domains.
- Top Cited PapersOpen Access
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 200196-200216
GART: Graph Neural Network-Based Adaptive and Robust Task Scheduler for Heterogeneous Distributed Computing
Modern distributed computing systems face significant challenges in achieving optimal resource utilization and maintaining performance stability when operating in heterogeneous cluster environments with dynamic workloads. Existing task scheduling approaches often rely on heuristic rules or static policies that fail to adapt to runtime variations such as node failures, load fluctuations, and heterogeneous resource capacities. To address these limitations, we propose GART (Graph-based Adaptive Robust Task scheduling), a novel framework that leverages graph neural networks (GNN) and reinforcement learning for intelligent task scheduling in distributed systems. GART models distributed task workflows as directed acyclic graphs (DAGs) and employs a specially designed GNN architecture to capture complex inter-task dependencies and resource requirements. The framework learns optimal scheduling policies through deep reinforcement learning, enabling adaptive decision-making that responds to dynamic system conditions. Our approach incorporates a robust scheduling mechanism that maintains high throughput and low latency even under adverse conditions including node failures and sudden load spikes. Extensive experiments on the Alibaba cluster trace dataset demonstrate that GART achieves 23.7% improvement in average job completion time, 31.4% reduction in resource imbalance, and 42.6% better resilience to node failures compared to state-of-the-art baseline schedulers including Shortest Job First, Tetrisched, and Decima. The results validate GART’s effectiveness in real-world heterogeneous distributed computing environments and its potential for deployment in production systems.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 200196-200216
Top Cited PapersOpen AccessGART: Graph Neural Network-Based Adaptive and Robust Task Scheduler for Heterogeneous Distributed Computing
Modern distributed computing systems face significant challenges in achieving optimal resource utilization and maintaining performance stability when operating in heterogeneous cluster environments with dynamic workloads. Existing task scheduling approaches often rely on heuristic rules or static policies that fail to adapt to runtime variations such as node failures, load fluctuations, and heterogeneous resource capacities. To address these limitations, we propose GART (Graph-based Adaptive Robust Task scheduling), a novel framework that leverages graph neural networks (GNN) and reinforcement learning for intelligent task scheduling in distributed systems. GART models distributed task workflows as directed acyclic graphs (DAGs) and employs a specially designed GNN architecture to capture complex inter-task dependencies and resource requirements. The framework learns optimal scheduling policies through deep reinforcement learning, enabling adaptive decision-making that responds to dynamic system conditions. Our approach incorporates a robust scheduling mechanism that maintains high throughput and low latency even under adverse conditions including node failures and sudden load spikes. Extensive experiments on the Alibaba cluster trace dataset demonstrate that GART achieves 23.7% improvement in average job completion time, 31.4% reduction in resource imbalance, and 42.6% better resilience to node failures compared to state-of-the-art baseline schedulers including Shortest Job First, Tetrisched, and Decima. The results validate GART’s effectiveness in real-world heterogeneous distributed computing environments and its potential for deployment in production systems.