Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStudying and Analyzing the real Time in Electrical Power Systems
دراسة و تحليل الزمن الحقيقي في أنظمة الطاقة الكهربائية
1656
1 69
0
(
0
)
Authors
زياد هرموش( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
يهدف البحث إلى دراسة و تحليل الزمن الحقيقي في نظام الطاقة الكهربائية المؤلف من تجهيزات التوليد و النقل و التوزيع عن طريق إعادة توزيع الاستطاعة الفعلية للمولدات الكهربائية, بغية تقييد عمليات الإفراط في تحميل خطوط نقل الطاقة الكهربائية في الحالة التي يكون فيها حمولات المحطة الكهربائية الاحتياطية لا تغطي الأحمال الضرورية و الهامة عند العطل. تشير أغلب القوانين المتعلقة بتصميم نظم الطاقة الكهربائية إلى تناسب طردي للزمن الحقيقي لعمل تجهيزات نظام الطاقة الكهربائي مع الميزات التي تعطيها العلاقات الرياضية الناظمة لتوابع التوزيع الاحتمالية بالإضافة للطرق الإحصائية, و التي تعطي إمكانية كبيرة لدراسة و تحليل زمن التحليل الرياضي الحقيقي عند حساب الحمولات المعتبرة, و هذا ما يستتبع الوصول إلى الحلول المنشودة في الحد من الأضرار الناجمة عن الأعطال التي يمكن أن تحدث في أي وقت من الأوقات.
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.
References used
GNEDENKO B., Probability Theory in Arabic language , MER Publisher, Moscow,1990,591
NERC, Planning Standard, (Date accessed: September 1, 2003). <http://www.nerc.com/~filez/pss-psg.html>
CIGRE, task Force 38.02.19, System protection schemes in power networks, CIGRE SCTF 38.02.19, 2000
ALWASSOUF, A.,JADEED A., NAZEEHA K., Entrance In Probability and Statistics (1) , Tishreen University , 2007-2008, 441
HARMOUSH Z., Probability Theory. Third class, Tishreen University , 2012- 2013, 413
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 purpose of this study is to define the reliability index for electrical power
systems specifically and without using alot of data and treating processes. Results of this
study is useful in electrical networks planning and design because of its
technical and
economical importance in the optimal choosing of networks elements and connections. In
this research we use petri nets concept to represent electrical nets under studying then
simulate the equivalent chart on GRIF program to find reliability degree for the system and
its elements. This research includes comparing the suggested methodology to a reference
net and then apply this method on electrical local network to discuss the results. It has
been proved that petri nets are effective in reliability calculations with the best of
simulation methods.
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
المزيد..
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
