scholarly journals The problem of choosing the optimal performance in the multiprocessor computer system design

2021 ◽  
Vol 2094 (3) ◽  
pp. 032058
Author(s):  
S N Efimov ◽  
V A Terskov ◽  
I Yu Sakash ◽  
V V Molokov ◽  
D L Nikiforov
Keyword(s):  
Control Systems ◽  
Real Time ◽  
Optimization Methods ◽  
Computing System ◽  
Control Problems ◽  
Real Time Systems ◽  
Computing Systems ◽  
Multiprocessor Computer ◽  
The Cost ◽  
Time Systems

Abstract The article presents the formulation of the problem of optimizing the structure of multiprocessor computing systems designed to solve control problems in real time. The features of this problem, which influence the choice of optimization methods, have been studied. It is concluded that this problem can be effectively solved using evolutionary methods of optimization. The considered models for finding performance can be used to optimize the architecture of multiprocessor computing systems. Besides, it should be taken into account that the resources allocated for the development and operation of computing systems are always limited. Therefore, it is advisable to consider the problem of optimizing the structure of a computing system as multi-criterial one: one criterion is the performance, and the other one is the cost of development and operation of the system. Acquired results can be used in development of multiprocessor computing systems for real-time systems, which is going to reduce the cost of development and operation of these control systems.

EFFICIENT COMBINED SCHEDULING OF HARD AND SOFT REAL-TIME TASKS IN MULTIPROCESSOR SYSTEMS UNDER A PROCESSING POWER-SHARE STRATEGY

2009 ◽  
Vol 19 (01) ◽  
pp. 23-38
Author(s):  
EHAB Y. ABDEL MAKSOUD
Keyword(s):  
Real Time ◽  
Operating Systems ◽  
Arrival Time ◽  
Multiprocessor Systems ◽  
Real Time Systems ◽  
Computing Systems ◽  
Processing Power ◽  
High Utilization ◽  
Hard Real Time ◽  
Time Systems

Increasingly, real-time systems are being used in applications that contain tasks that have deadlines and require predictable performance. Many complex real-time applications require modern operating systems capable of scheduling multiple classes of tasks in an integrated way. These applications require scheduling that result in high utilization of available processing power to accommodate as many tasks as possible while satisfying the required deadlines of each task. In this paper, we propose a combined heuristic approach to schedule a set of independent soft and hard real-time tasks in multiprocessor computing systems. Each of these tasks is characterized by its arrival time, deadline and required processing power. The proposed approach distributes the total available processing power of any processor, if it is needed and possible, among more than one task, while ensuring that hard real-time tasks are given higher priority and enough processing power to meet deadlines. This strategy can be used as a tool to efficiently guide scheduling processes. In addition, it can help to optimize processor utilization and maintain higher success ratios by maximizing the schedulability of soft tasks without jeopardizing the schedulability of hard tasks.

A LEGO Mindstorms NXT approach for teaching at Data Acquisition, Control Systems Engineering and Real-Time Systems undergraduate courses

2012 ◽  
Vol 59 (3) ◽  
pp. 974-988 ◽  
Author(s):  
A. Cruz-Martín ◽  
J.A. Fernández-Madrigal ◽  
C. Galindo ◽  
J. González-Jiménez ◽  
C. Stockmans-Daou ◽  
...  
Keyword(s):  
Data Acquisition ◽  
Control Systems ◽  
Real Time ◽  
Systems Engineering ◽  
Real Time Systems ◽  
Control Systems Engineering ◽  
Lego Mindstorms ◽  
Time Systems

DVS Scheduling for Reducing Both Dynamic and Leakage Energy for (M,K)-Firm Real-Time Systems

2011 ◽  
Author(s):  
Linwei Niu ◽  
Yuanchang Xie
Keyword(s):  
Energy Consumption ◽  
Real Time ◽  
The Other ◽  
Primary Concern ◽  
Real Time Systems ◽  
Computing Systems ◽  
Qos Guarantee ◽  
Dynamic Voltage ◽  
Time Systems

While the dynamic voltage scaling (DVS) techniques are efficient in reducing the dynamic energy consumption for the processor, varying voltage alone becomes less effective for the overall power reduction as the leakage power is growing rapidly, i.e., five times per technical generation as predicted. On the other hand, Quality of Service (QoS) is also a primary concern in the development of today’s pervasive computing systems. In this paper, we study the problem of minimizing the overall energy consumption for soft real-time systems while ensuring the QoS-guarantee. In our research, the QoS requirements are deterministically quantified with the (m,k)-constraints, which require that at least m out of any k consecutive jobs of a task meet their deadlines. Two approaches are proposed in this paper. One statically determines the mandatory jobs that have to meet their deadlines in order to satisfy the (m,k)-constraints, and the other one does so dynamically. Moreover, we present efficient scheduling techniques to reduce the overall energy by procrastinating the execution of mandatory jobs and thus to merge the idle intervals. The simulation results demonstrate that our proposed techniques significantly outperformed previous research in both overall and idle energy reduction while providing the (m,k)-guarantee.

Software Engineering for Real Time Systems

IEE Review ◽  
1992 ◽  
Vol 38 (3) ◽  
pp. 112
Author(s):  
Stuart Bennett
Keyword(s):  
Software Engineering ◽  
Real Time ◽  
Real Time Systems ◽  
Time Systems

Generic Round Robin Scheduling for Real Time Systems

2017 ◽  
Vol 7 (5) ◽  
pp. 148-155
Author(s):  
Pallab Banerjee ◽  
◽  
Riya Shree ◽  
Richa Kumari Verma ◽  
◽  
...  
Keyword(s):  
Real Time ◽  
Round Robin ◽  
Real Time Systems ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document