Abstract
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 paper 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 ≈ 33% reduction in average execution time.
Recommended Citation
P. A. Birajdar et al., "RUSH: Rule-Based Scheduling for Low-Latency Serverless Computing," IEEE Networking Letters, Institute of Electrical and Electronics Engineers, Jan 2025.
The definitive version is available at https://doi.org/10.1109/LNET.2025.3603863
Department(s)
Computer Science
Publication Status
Early Access
Keywords and Phrases
FCFS; Random scheduling; Response time; Rule-based scheduler; Serverless computing
International Standard Serial Number (ISSN)
2576-3156
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2025 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Jan 2025
