A Design of Endurance Queue for Co-Existing Systems in Multi-Programmed Environments
Subrata Ashe

TL;DR
This paper proposes a dynamic queue length adjustment method for multi-programmed environments, aiming to prevent bottlenecks by modeling queue behavior based on system load and memory usage.
Contribution
It introduces a novel queue design that adapts to load variations in multiprogramming environments, improving system endurance and performance stability.
Findings
Dynamic queue length computation based on transmission growth
Correlation of memory heat map with queue distribution
Enhanced long-term service under variable loads
Abstract
These days enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly performing sub-systems, when the service demand and throughput are not synchronized. A poorly performing sub-system may become a serious performance bottleneck for the entire system if its serviceability and the capacity is over utilized by increased service demand from upstream systems. From all the integrated sub-systems, queuing systems are majorly categorized as choking elements due to their limited service length and lack of processing details. The situation becomes more pronounced in multiprogramming environments where the queue performance exponentially degrades with increased degree of multiprogramming at upstream levels. This paper presents an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Distributed systems and fault tolerance · Real-Time Systems Scheduling
