Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComparison of the performance of sporadic tasks scheduling algorithms in real time systems
مقارنة أداء خوارزميات جدولة المهام العشوائية في نظم الزمن الحقيقي
1938
2 39
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تم في هذا البحث مقارنة أداء خوارزميات جدولة المهام العشوائية على منصة متعددة النوى بهدف تحديد الخوارزمية الأفضل من ناحية مجموعة من البارامترات المعتمدة من قبل الباحثين في هذا المجال و التي بدورها تعطينا تفاصيل دقيقة حول جودة مثل هذه الخوارزميات عند تطبيقها على مجموعة من المهام العشوائية المولدة وفق التوزع الاحتمالي اللوغاريتمي الموحد. تمت عملية المحاكاة على البرنامج simso و الذي أثبت موثوقية أداء عالية بشهادة العديد من الباحثين في هذا المجال فضلاً عن كونه يقدم إمكانية توليد المهام وفق توزعات احتمالية معينة، و يحاكي تفاصيل دقيقة متعلقة بخصائص المهام العشوائية.
In this paper, we compare the performance of sporadic tasks scheduler algorithms on a multi-core platform in order to determine the best algorithm in terms of a set of parameters adopted by researchers in this field, which in turn gives us accurate details about the quality of such algorithms when applied to a set of sporadic tasks generated according to uniformed Logarithmic probability distribution. The simulation is done using Simso simulator, which proved the reliability of high performance by the testimony of many researchers in this field, as it provides the possibility of generating tasks according to specific probability distributions, and simulates accurate details related to the characteristics of random tasks.
References used
RADHAKRISHNA NAIK at el, "Periodic and Aperiodic Real -Time Task Scheduling AlgorithmsSimulator", International Journal of Pure and Applied Mathematics, Volume 118 No. 20 , 2018, 2681-2687
HYEONGBOO BAEK, "Real-Time Scheduling for PreventingInformation Leakage with PreemptionOverheads ", Advances in Electrical and Computer Engineering, Volume 17, Number 2, 2017
ANKUR JAIN , “ Multishare Task Scheduling Algorithm For Real Time Microcontroller Based Application “ , Mechatronics and Applications: An International Journal (MECHATROJ), Vol. 1, No.1, 2015
rate research
Read More
The research presents molding and analytical study of several scheduling algorithms
types in real-time multiprocessor systems. The performance of three scheduling algorithms
have been analyzed : Earliest Deadline First Scheduling (EDF) , Least Laxi
ty First
Scheduling (LLF), and Earliest Deadline First until Zero Laxity Scheduling (EDZL). This
paper considers the scheduling of n periodic, independed, and preempted tasks with
implicit deadlines on a platform of m homogenous multiprocessor. It has compared in
terms of the load on the processor (processor's busyness) , the number of migrations, and
the number of preemptions and the number of times in which these algorithms did not
succeed in achieving the time limits for tasks where the latter is considered the most
important criterion in real time scheduling. It also considers scheduling growing task sets
of periodic tasks starting from 4 task set up to 64 task set, in order to study the effect of
increasing the number of tasks and processors also on the performance of the scheduling
algorithms. As a result of research, the strengths and weaknesses in the performance of
these three algorithms have presented. It is proposed the best type of real-time system to
apply each algorithm according to the strengths of its performance.
Most of Real-Time Systems which use FIFO (First In First Out)
algorithm to arrange the tasks in the queue suffer from a relatively long
waiting-time. Our study concerns on the effect of service time
probability distribution provided to the waiting tasks in the queues.
The study seeks to determine the real time in electrical power system, which consists of
generating, transmitting and distributing equipment by using redistributing active power of
electrical generators in order to organizing the overload operation
of electrical power
transmission line loading in such case that the spare loads of electrical station are not
covering the important and necessary loads at failures.
The most of laws related to electrical power systems design indicated to proper ratio of
real time of electrical power system equipment along with characteristics of probability
distributed functions in addition to statistics methods which give a high possibility to
reduce the real time of considered loads; so; this leads to the requested solutions which
reduce the damage of failures at any time.
Services that demanded by users via internet network are classified in two main
kinds, Services work in real time such as video and voice in real time and use UDP
protocol, and other services that work in non-real time such as web browsing (HTTP) a
nd
file transfer (FTP) which use TCP Protocol.
In this research, we study and analyze algorithms that enhance the quality of service
for various applications. For real time application, we use queues disciplines, which gives
high priority for these services and achieves minimum delay. For non-real time application,
we study congestion control algorithms, which achieve best performance for reliable
transfer process with existing the congestion in the network. We used OPNET 14.5
program for simulating various services via internet network. Simulation results show
achieving minimum delay for voice service, and achieving high transmission rate for FTP
application with existing of packets loss in the network.
تطبيقات الزمن الحقيقي
التحكم بالازدحام
Congestion Control
تطبيقات الزمن غير الحقيقي
قواعد الرتل
خوارزمية البداية البطيئة
تجنب الازدحام
خوارزمية إعادة الإرسال السريع و الاستعادة السريعة
Real Time application
non-real time application
Queue disciplines
Slow start algorithms
Congestion avoidance algorithms
Fast retransmit and Fast recovery
المزيد..
The spread of the modern data transfer techniques, in modern industrial and agricultural applications, and service areas, leads to the need to transfer this data effectively and flexibly, within installations parts.
This research aims to apply the h
ybrid mechanism, based on the use of ZigBee technology, and CAN Bus together to ensure the best performance, in accordance with the performance indicators required by the networks of these facilities, in near-real time operation. The study attempts to compare this mechanism with other mechanisms proposed in similar research.
The proposed solution supports the use of a hybrid data transfer networks, based on the internetworking of CAN Bus networks, using a backbone based on wireless ZigBee technology. This solution proposes an appropriate structure for gateways between the hybrid parts of the network. The research has concluded that the proposed mechanism preference, compared with the proposed mechanisms in similar research, according to the standards of performance indicators, is suitable for this kind of networks, as it allows us to recommend the use of this mechanism in the service and industrial applications. The NS2 network simulator is used to evaluate and compare the obtained results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
