Approximation-Aware Computation for Graceful QoS Degradation in Modern Multiprocessor Operating Systems

Year : 2025 | Volume : 12 | Issue : 03 | Page : 08 15
    By

    Yamuna Mundru,

  • Manas Kumar Yogi,

  1. Assistant Professor, Department of Computer Science and Engineering (AI & ML) Department, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India
  2. Assistant Professor, Department of Computer Science and Engineering Department, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India

Abstract

Modern multiprocessor operating systems face unprecedented challenges in maintaining Quality of Service (QoS) guarantees under dynamic workload conditions and resource constraints. Traditional approaches to resource management often result in abrupt service degradation or complete task failure when system resources become scarce. This study presents a comprehensive framework for approximation-aware computation that enables graceful QoS degradation in multiprocessor environments. We explore the integration of approximate computing paradigms with operating system schedulers, resource allocators, and runtime systems to provide continuous service delivery with controlled accuracy trade-offs. Our approach leverages computational approximation techniques, including loop perforation, precision scaling, and algorithmic substitution to maintain system responsiveness while managing quality degradation predictably. The framework introduces novel scheduling algorithms that consider approximation tolerance levels, dynamic quality profiling mechanisms, and adaptive resource allocation strategies. We demonstrate how approximation-aware policies can extend system availability, improve throughput, and enhance user experience during resource contention scenarios. This research establishes theoretical foundations and practical implementation strategies for next-generation operating systems capable of intelligent quality management across heterogeneous multiprocessor architectures.

Keywords: Multiprocessor, resources, QoS, schedulers, approximation-aware

[This article belongs to Journal of Operating Systems Development & Trends ]

How to cite this article:
Yamuna Mundru, Manas Kumar Yogi. Approximation-Aware Computation for Graceful QoS Degradation in Modern Multiprocessor Operating Systems. Journal of Operating Systems Development & Trends. 2025; 12(03):08-15.
How to cite this URL:
Yamuna Mundru, Manas Kumar Yogi. Approximation-Aware Computation for Graceful QoS Degradation in Modern Multiprocessor Operating Systems. Journal of Operating Systems Development & Trends. 2025; 12(03):08-15. Available from: https://journals.stmjournals.com/joosdt/article=2025/view=232687


References

  1. Baruah S, Fisher N. The partitioned multiprocessor scheduling of sporadic task systems. In 26th IEEE International Real-Time Systems Symposium (RTSS’05). 2005 Dec 5; 9.
  2. Chen JJ, Chakraborty S. Resource augmentation bounds for approximate demand bound functions. In 2011 IEEE 32nd Real-Time Systems Symposium. 2011 Nov 29; 272–281.
  3. Mittal S. A survey of techniques for approximate computing. ACM Comput Surv. 2016 Mar 18; 48(4): 1–33.
  4. Xu Q, Mytkowicz T, Kim NS. Approximate computing: A survey. IEEE Des Test. 2015 Dec 7; 33(1): 8–22.
  5. Dalloo AM, Humaidi AJ, Al Mhdawi AK, Al-Raweshidy H. Approximate computing: Concepts, architectures, challenges, applications, and future directions. IEEE Access. 2024 Sep 25; 12: 146022–88.
  6. Liu L, Lu S, Zhong R, Wu B, Yao Y, Zhang Q, Shi W. Computing systems for autonomous driving: State of the art and challenges. IEEE Internet Things J. 2020 Dec 9; 8(8): 6469–86.
  7. Saridakis T. Design patterns for graceful degradation. In Transactions on pattern languages of programming I. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009 Jan 1; 67–93.
  8. Min C, Kang W, Kumar M, Kashyap S, Maass S, Jo H, Kim T. Solros: a data-centric operating system architecture for heterogeneous computing. In Proceedings of the Thirteenth EuroSys Conference. 2018 Apr 23; 1–15.
  9. Koutsovasilis P, Kalogirou C, Konstantas C, Maroudas M, Spyrou M, Antonopoulos CD. AcHEe: Evaluating approximate computing and heterogeneity for energy efficiency. Parallel Comput. 2018 Apr 1; 73: 52–67.
  10. Brandenburg BB, Anderson JH. Optimality results for multiprocessor real-time locking. In 2010 31st IEEE Real-Time Systems Symposium. 2010 Nov 30; 49–60.
  11. Hanumaiah V, Vrudhula S. Energy-efficient operation of multicore processors by DVFS, task migration, and active cooling. IEEE Trans Comput. 2012 Aug 30; 63(2): 349–60.
  12. Leon V, Hanif MA, Armeniakos G, Jiao X, Shafique M, Pekmestzi K, Soudris D. Approximate computing survey, part i: Terminology and software & hardware approximation techniques. ACM Comput Surv. 2025 Mar 5; 57(7): 1–36.
  13. Burns A, Baruah S. Timing faults and mixed criticality systems. In: Dependable and Historic Computing: Essays Dedicated to Brian Randell on the Occasion of His 75th Birthday. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011 Jan 1; 147–166.
  14. Davis RI, Cucu-Grosjean L, Bertogna M, Burns A. A review of priority assignment in real-time systems. J Syst Arch. 2016 Apr 1; 65: 64–82.
  15. Seifi N, Al-Mamun A. Optimizing memory access efficiency in CUDA kernel via data layout technique. J Comput Commun. 2024 May 14; 12(5): 124–39.
  16. Kislal O, Kandemir MT, Kotra J. Cache-aware approximate computing for decision tree learning. In 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 2016 May 23; 1413–1422.
  17. Liu W, Gu C, O’Neill M, Qu G, Montuschi P, Lombardi F. Security in approximate computing and approximate computing for security: Challenges and opportunities. Proc IEEE. 2020 Oct 29; 108(12): 2214–31.
  18. Rodrigues GS, Kastensmidt FL, Bosio A. Approximate computing for safety-critical applications. In 2021 IEEE 22nd Latin American Test Symposium (LATS). 2021 Oct 27; 1–3.
  19. Venkataramani S, Chippa VK, Chakradhar ST, Roy K, Raghunathan A. Quality programmable vector processors for approximate computing. In Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture. 2013 Dec 7; 1–12.
  20. Liu B, Wang Z, Wang X, Zhang R, Xue A, Shen Q, Xie N, Gong Y, Wang Z, Yang J, Cai H. An efficient BCNN deployment method using quality-aware approximate computing. IEEE Trans Comput-Aided Des Integr Circuits Syst. 2022 Oct 20; 41(11): 4217–28.
  21. Karnagel T, Habich D, Lehner W. Adaptive work placement for query processing on heterogeneous computing resources. Proc VLDB Endow. 2017 Mar 1; 10(7): 733–44.
  22. Armeniakos G, Zervakis G, Soudris D, Henkel J. Hardware approximate techniques for deep neural network accelerators: A survey. ACM Comput Surv. 2022 Nov 21; 55(4): 1–36.
Regular Issue Subscription Review Article
Volume 12
Issue 03
Received 27/10/2025
Accepted 30/10/2025
Published 19/11/2025
Publication Time 23 Days
43

Login


My IP

PlumX Metrics