.png){kind=icon}
.png){kind=icon}
Return
RUSH: Rule-Based Scheduling for Low-Latency Serverless Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/LNET.2025.3603863.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Serverless computing abstracts server management, enabling developers to focus on application logic while benefiting from automatic scaling and pay-per-use pricing. However, dynamic workloads pose challenges in resource allocation and response time optimization. Response time is a critical performance metric in serverless environments, especially for latency-sensitive applications, where inefficient scheduling can degrade user experience and system efficiency. This letter proposes RUSH (Rule-based Scheduling for Low-Latency Serverless Computing), a lightweight and adaptive scheduling framework designed to reduce cold starts and execution delays. RUSH employs a set of predefined rules that consider system state, resource availability, and timeout thresholds to make proactive, latency-aware scheduling decisions. We implement and evaluate RUSH on a real-world serverless application that generates emoji meanings. Experimental results demonstrate that RUSH consistently outperforms First-Come-First-Served (FCFS), Random Scheduling, and Profaastinate, achieving approximate to 33 % reduction in average execution time.
Keywords:
Time factors
Processor scheduling
Scheduling
Optimal scheduling
Dynamic scheduling
Serverless computing
Low latency communication
Emojis
Delays
Complexity theory
response time
rule-based scheduler
FCFS
and random scheduling
Journal
I
IF:
0
Papers:
62
Citations:
0