Downloads: 5 | Views: 127 | Weekly Hits: ⮙3 | Monthly Hits: ⮙3

Comparative Studies | Computer Science & Engineering | United States of America | Volume 13 Issue 2, February 2024 | Popularity: 5.6 / 10

Rate This Article!      

Comparative Analysis of Scheduling Algorithms for Latency Optimization in Real-Time Applications

Jatin Pal Singh

Abstract: Real-time applications, from video conferencing to financial trading, hinge on the timely delivery of data streams. However, latency can disrupt this flow, compromising user experience and operational efficiency. This paper explores scheduling and resource allocation algorithms as weapons against latency in data streaming. We delve into Earliest Deadline First (EDF), Weighted Fair Queuing (WFQ), and Rate Monotonic Scheduling (RMS), dissecting their mechanisms, theoretical guarantees, and practical implications for latency optimization. We examine trade-offs between these algorithms, considering factors such as deadline constraints, resource availability, and fairness requirements. Through theoretical analysis and experimental evaluation, we aim to provide actionable insights and recommendations for selecting and implementing optimal scheduling strategies in diverse data streaming scenarios, paving the way for more responsive and efficient real-time applications.

Keywords: Data streaming, Latency optimization, Scheduling algorithms, Resource allocation, Earliest Deadline First (EDF), Weighted Fair Queuing (WFQ), Rate Monotonic Scheduling (RMS), Network Calculus

Edition: Volume 13 Issue 2, February 2024

Pages: 1179 - 1185

DOI: https://www.doi.org/10.21275/SR24212060600

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article