Jul 2026· ACM Transactions on Design Automation of Electronic Systems· 0 citations· 27 references
TL;DR
A novel QoS-aware task deployment methodology to enhance the Quality of Service (QoS) under resource limitations is introduced and results demonstrate that the proposed method achieves superior system performance compared to existing approaches.
Abstract
Heterogeneous multicore embedded systems can handle complex tasks such as data collection, processing, and wireless communication. However, these systems often face constraints due to limited computational resources, requiring efficient task deployment strategies to manage dependent and real-time tasks. Despite advancements, existing methods rarely address the deployment of Imprecise Computation (IC) tasks on heterogeneous multicore platforms that utilize both Dynamic Voltage/Frequency Scaling (DVFS) and Dynamic Power Management (DPM). This paper introduces a novel QoS-aware task deployment methodology to enhance the Quality of Service (QoS) under resource limitations. The proposed approach simultaneously optimizes frequency assignment, processor state transitions, task allocation, scheduling, and task execution cycle adjustments to maximize system QoS while adhering to time, energy, and dependency constraints. The problem is initially formulated as a Mixed Integer Non-Linear Programming (MINLP) model, then transformed into a Mixed Integer Linear Programming (MILP) formulation to obtain optimal solutions. We developed a heuristic method with low computational complexity to address scalability challenges, employing problem decomposition and a greedy algorithm. The process operates in two stages: task allocation and frequency assignment, followed by task scheduling and cycle adjustment. The simulation results demonstrate that the proposed method achieves superior system performance compared to existing approaches, particularly in QoS ( \(41.30\% \) ), task schedulability ( \(58.67\% \) ), and execution efficiency.
Efficient energy scheduling in heterogeneous computing environments is a critical challenge, as task allocation decisions directly affect both energy consumption and execution performance. This work presents an energy aware scheduling framework based on a discretized grasshopper optimization algorithm (GOA), designed t...
Macauley Opuwari, C. Igiri, D. Ikeh· International Journal Of Eng...· 0 citations
This work considers the problem of cost-effectively mapping a swarm of soft real-time stream processing applications with moldable-parallel tasks to multicore resources in the device-edge-cloud continuum, consisting of mobile devices, edge resources and cloud resources, and presents several offline algorithmic solution...
Sajad Khosravi, Christoph W. Kessler, Sebastian Litzinger et al.· Cluster Computing· 0 citations
Cloud computing has transformed the delivery of modern applications and services by providing scalable, flexible, and cost-effective access to computing resources. One of the most critical challenges in cloud environments is the efficient distribution of dynamic workloads across heterogeneous resources, commonly addres...
M. Yacoub, Ahmed E. Abdel Raouf, Walaa K. Gad et al.· Electronics· 0 citations
The Latency-Aware Adaptive Spotted Hyena Optimizer (LA-ASHO) is proposed, a novel metaheuristic scheduling framework grounded in the social hunting behaviour of spotted hyenas that achieves statistically significant reductions in workflow completion latency relative to established baseline schedulers such as; Min-Min,...
Igiri C. G, Ejekwu Obunezi, Ujah Alechenu Israel· Journal of Artificial Intell...· 0 citations
The rapid growth of Internet-of-Things (IoT) devices has increased the need for computing support close to end users, particularly for applications that cannot tolerate long processing delays or excessive energy consumption. Fog computing has emerged as a practical extension of the cloud to address these requirements,...
Ashish Bagla, Deepak Dagar, Pratik Srivastava· International Journal For Mu...· 0 citations
A distributed Multi-stage Adaptive Deferred Acceptance (MA-DA) algorithm is proposed that enables a stable and Pareto-optimal assignment of tasks to edge computing nodes (ECNs) and determines a reasonable task execution sequence and ensures the prioritized completion of delay-sensitive tasks.