Resource-Aware Scheduling for Dependable Multicore Real-Time Systems: Utilization Bound and Partitioning Algorithm

Han, Jian-Jun; Wang, Zhenjiang; Gong, Sunlu; Miao, Tianpeng; Yang, Laurence T.

doi:10.1109/tpds.2019.2926455

Cited by 5 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each processor has its ready queue. The main advantage of the partitioned‐based multiprocessor real‐time scheduling is once the task assignment is done, the existing uniprocessor algorithms can be used to schedule the task to processors 33 . The advantages of partitioned based scheduling are some task sets with higher utilization cannot be scheduled using global scheduling.…”

Section: Related Workmentioning

confidence: 99%

Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system

Talmale

Shrawankar

2021

Concurrency and Computation

View full text Add to dashboard Cite

Summary Real‐time systems are nowadays extensively used in most time‐critical embedded applications. The existing multiprocessor real‐time scheduling algorithms are based on partitioned and global scheduling approaches. The partitioned‐based algorithms suffer poor utilization bound, load balancing, not compatible for an open system environment, and the global scheduling approach faces problems like high scheduling, migration overhead. Cluster scheduling represents a hybrid scheduling approach which consists of a set of processors as clusters and tasks scheduled to each processor of clusters using a global scheduling approach. The different cluster formation heuristics are investigated for homogenous clusters. The main objective of this article is to propose task utilization‐based cluster formation and harmonic period aware task allocation for a hierarchical real‐time system on a multiprocessor platform. Tasks with high utilization, cluster size tune to a smaller value to achieve high utilization. Tasks with low utilization, the size of cluster tune to larger to reduce migration and scheduling overheads. Experimentation performed on multiprocessor real‐time simulator with a different set of tasks, multiprocessor system, different tasks utilization, and cluster size. Simulation results show that cluster base approach increases the number of tasks scheduled on a multiprocessor system, system utilization, and reduces response time, migration, and preemption overheads.

show abstract

Section: Related Workmentioning

confidence: 99%

Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system

Talmale

Shrawankar

2021

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Some examples of these problems include Balanced Partition, where one must distribute (balance) a set of ele-ments into teams, and Job-Shop Scheduling, where one must be identify an appropriate ordering (schedule) of activities. The first case is akin to situations with multiple operators, e.g., multi-core problems [1]. The second one usually maps the planning of manufacturing processes [2].…”

Section: Introductionmentioning

confidence: 99%

Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites

et al. 2021

View full text Add to dashboard Cite

Combinatorial optimization problems (COPs) are paramount for real-life problems with discrete variables. Even though the number of combinations is finite, some problems exhibit exponential growth, rendering exact approaches unfeasible. So, approximate methods, such as heuristics, are customary for making fast decisions. Despite their small computational cost, each heuristic specializes in specific kinds of problems. Hence, other approaches have appeared for merging their strengths. One of these approaches is commonly known as selection hyper-heuristics. However, a trained hyper-heuristic usually carries the following problem: it provides scarce information about its sensitivity. This makes it more difficult to estimate the effect of changing a parameter. Illumination algorithms seek to improve this issue by focusing on exploration rather than on exploitation while preserving information about the best solutions with different criteria. Still, literature falls short when merging both approaches, representing a knowledge gap. Therefore, in this work, we test the feasibility of using an illumination algorithm, the MAP-Elites (ME), for tuning a sequence-based selection hyper-heuristic model for Balanced Partition problems. We choose ME since it has been successfully applied to a different COP, and by linking it with hyper-heuristics, we may exploit upon its benefits. So, we may achieve a hyper-heuristic that represents the best combination of heuristics. Simultaneously, we can gain information about the expected performance of diverse hyperheuristics, e.g., those that begin with a different heuristic. Our approach operates by creating a multidimensional map, where each design variable represents the application of a given heuristic. Afterward, ME generates mutated sequences and tests them to determine if they represent a better-performing solution. To test our approach, we consider 1500 instances that include easy and hard instances, analyzed under different scenarios. We also include limit instances that are neither easy nor hard. Our resulting data supports the feasibility of the proposed approach. We show that this kind of hyper-heuristic can perform toe-to-toe with a synthetic oracle. Besides, under some conditions, the former may even outperform the latter. This represents an outstanding result, since such an oracle can only be obtained by a brute-force approach, and because it demonstrates that merging both approaches (ME and hyper-heuristics) is a path worth pursuing. We also present how each parameter affects the model performance, concluding that some parameters can be critical while others are virtually irrelevant. This is also a relevant result, since it serves as the groundwork for future works so that they can focus on exploiting the most relevant parameters.

show abstract

Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems

et al. 2020

View full text Add to dashboard Cite

Resource-Aware Scheduling for Dependable Multicore Real-Time Systems: Utilization Bound and Partitioning Algorithm

Cited by 5 publications

References 31 publications

Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system

Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system

Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites

Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems

Contact Info

Product

Resources

About