A Survey on Scheduling Approaches for Hard Real-Time Systems

Rouhifar, Mehrin; Ravanmehr, Reza

doi:10.5120/ijca2015907656

Cited by 9 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Longest Remaining Time (LRT) scheduling focuses on the burst time of the task same as LJF, but the work of this scheduling is different from LJF. This scheduling arranges the tasks based on the remaining time of the burst time and it arranges the priority of the tasks according to the longest burst time [19].…”

Section: Longest Remaining Time Schedulingmentioning

confidence: 99%

Simulator for Scheduling Real-Time Systems with Reduced Power Consumption

Al-Fareed¹,

Ali²,

Alshuraya³

et al. 2022

MMEP

View full text Add to dashboard Cite

Optimum resources utilization in computing devices especially power is among the prime areas of research from the very beginning of computer systems. However, its importance in the current era has been significantly increased due to the diverse nature of devices and their real time applications. On the other hand, paradigm is shifting towards sustainable resources that are green/environment friendly (low emission) in nature and produce relatively low energy/power. Real time systems (RTS) are relatively power-hungry due to their time constrained nature. So, there is room to investigate the scheduling algorithms (schedulers) with minimum (low) power consumption. On the other hand simulators are the software that mimic the real time environment for various parameter testing without actual implementation that could be costly as well as complex to build in the beginning. In this study, we are intended to develop a simulator for scheduling Real-Time Systems (RTS) with Reduced Power Consumptions (RPC). That is potentially an environment where various algorithms can be tested over different case studies to examine their performance pertaining RPC for RTS.

show abstract

Section: Longest Remaining Time Schedulingmentioning

confidence: 99%

Simulator for Scheduling Real-Time Systems with Reduced Power Consumption

Al-Fareed¹,

Ali²,

Alshuraya³

et al. 2022

MMEP

View full text Add to dashboard Cite

show abstract

“…The data center comprises multiple hosts, each having its own VM. 80,81 A user maintains task flow in a task queue. The system schedules the task which keeps record of both task scheduler and performance monitor.…”

Section: Ra Schemes For Rt Services In Cloud Computingmentioning

confidence: 99%

A comparative analysis of resource allocation schemes for real-time services in high-performance computing systems

Qureshi

Fayaz

et al. 2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

An efficient resource allocation scheme plays a vital role in scheduling applications on high-performance computing resources in order to achieve desired level of service. The major part of the existing literature on resource allocation is covered by the real-time services having timing constraints as primary parameter. Resource allocation schemes for the real-time services have been designed with various architectures (static, dynamic, centralized, or distributed) and quality of service criteria (cost efficiency, completion time minimization, energy efficiency, and memory optimization). In this analysis, numerous resource allocation schemes for real-time services in various high-performance computing (distributed and non-distributed) domains have been studied and compared on the basis of common parameters such as application type, operational environment, optimization goal, architecture, system size, resource type, optimality, simulation tool, comparison technique, and input data. The basic aim of this study is to provide a consolidated platform to the researchers working on scheduling and allocating high-performance computing resources to the real-time services. This work comprehensively discusses, integrates, analysis, and categorizes all resource allocation schemes for real-time services into five high-performance computing classes: grid, cloud, edge, fog, and multicore computing systems. The workflow representations of the studied schemes help the readers in understanding basic working and architectures of these mechanisms in order to investigate further research gaps.

show abstract

“…Global scheduling has several advantages over partitioned‐based real‐time scheduling such as automatic load balancing, lower average response time, compatibility for open system environment for dynamic tasks execution, high system utilization 19 . Global scheduling also faces some significant drawbacks like high system overhead like migration, preemption, and scheduling overhead 20 . Some task sets having low task utilization then also not schedule using the global scheduling approach.…”

Section: Introductionmentioning

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

A Survey on Scheduling Approaches for Hard Real-Time Systems

Cited by 9 publications

References 16 publications

Simulator for Scheduling Real-Time Systems with Reduced Power Consumption

Simulator for Scheduling Real-Time Systems with Reduced Power Consumption

A comparative analysis of resource allocation schemes for real-time services in high-performance computing systems

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

Contact Info

Product

Resources

About