Search
2 articles for “multiprocessor systems”
-
Data Structure Driven Probabilistic Deadlock Resolution in Multiprocessor Systems
Abstract: Deadlock resolution in multiprocessor systems is fundamentally a graph-theoretic and probabilistic decision problem. Existing victim selection heuristics, such as youngest, oldest, and lowest priority, apply static rules that overlook the dynamic runtime state of processes, leading to unnecessary computational loss. This paper reframes the inference-guided preemption (IGP) algorithm as a data-structure-centric solution, highlighting how resource allocation graphs, wait-for graphs, adjacency lists, min-heaps, and hash-based evidence stores interact to enable efficient …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 11–20 Read article
-
Approximation-Aware Computation for Graceful QoS Degradation in Modern Multiprocessor Operating Systems
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, …
Published in Journal of Operating Systems Development & Trends · Vol. 12, Issue 3, 2025 · pp. 08–15 Read article