Real time system for software Engineering: An overview

Panigrahi, Rajeeb Lochan; Senapaty, Murali Krishna

doi:10.15373/22778160/january2014/10

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Executing such applications not merely depend on producing the correct output but the time at which the results are generated. 8,9 We use an application, service, task, and system interchangeably in this article. Some common examples of RT applications can be found in chemical plants, robotics, anti-missile systems, pacemakers, multimedia systems, and embedded systems.…”

Section: Introductionmentioning

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

Section: Introductionmentioning

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

show abstract

“…The deadline of a task is the point in time before which the task must complete its execution [1]. There are three types of deadlines, which are mentioned below,…”

Section: Introductionmentioning

confidence: 99%

Comparison of Real Time Task Scheduling Algorithms

Shinde¹,

Biday²

2017

IJCA

View full text Add to dashboard Cite

In a Real-Time System, the correctness of the system is not only depending on the logical result of the computation but also on the time at which result is produced is very important. In real time system, scheduling is effected using certain criteria that ensure processes complete their various tasks at a specific time of completion. The quality of real-time scheduling algorithm has a direct impact on real-time system's working. We studied popular scheduling algorithms mainly Earliest Deadline First, Rate Monotonic, Deadline Monotonic, Least laxity First, Group Earliest Deadline First and Group Priority Earliest Deadline First for periodic task. We observe that the choice of a scheduling algorithm is important in designing a real-time system. We conclude by discussing the results of the Real-Time scheduling algorithm survey.

show abstract

Hardware Implementation and Research of Some Modern Algorithms for Planning Real-Time Operating Systems

Sinev¹,

Martyshkin²

2021

XCROTPACOTPP

View full text Add to dashboard Cite

The article studies three modern algorithms for planning real-time operating systems. An experimental study of scheduling algorithms was performed on the basis of the STM32F407G-DISC1 hardware platform. The software basis for the study of algorithms is the FreeRTOS operating system, which has the ability to work in two modes -with preemptive and cooperative multitasking. Planning algorithms have been experimentally implemented: Rate Monotonic, Earliest Deadline First and Background. For each of them, the functions of creating tasks that are planned in the system were synthesized. The principle of operation of each of the listed algorithms is implemented on the basis of the FreeRTOS scheduler. After preparing for the implementation of the planning algorithms, experiments were carried out directly with subsequent verification of their operability. Studies of algorithms for planning real-time operating systems were carried out on the basis of indicators -the duration of context switching and the effectiveness of the scheduler. Experiments were conducted with a different number of tasks to determine the trend of change in each of the parameters. The main results obtained are clearly shown in the graphs. As a result of the study, recommendations are presented for choosing a specific scheduling algorithm for specific types of tasks and load values. In conclusion, the main conclusions on the work done are formulated.

show abstract

Real time system for software Engineering: An overview

Cited by 3 publications

References 0 publications

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

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

Comparison of Real Time Task Scheduling Algorithms

Hardware Implementation and Research of Some Modern Algorithms for Planning Real-Time Operating Systems

Contact Info

Product

Resources

About