Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userScheduling large number of independent Tasks on homogenous multiprocessors using Bees Algorithm
جدولة مهام مستقلة ذات عدد كبير على معالجات متعددة متماثلة باستخدام خوارزمية النحل
1700
0 34
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
في هذا البحث، تمت دراسة مسألة الجدولة الستاتيكية للمهام المستقلة على نظام معالجات-متعدد متماثلة، و عرض خوارزمية اعتماداً على أمثلة جماعة النحل، و حل مسألة الجدولة باستخدامها، و مقارنتها مع خوارزمية سابقة قد استوحيت من سلوك النحل لنفس الغرض و مع الحل الأمثل لمسألة الجدولة المعروضة.
In this paper, we study the static scheduling issue for the independent tasks on a homogenous multiprocessor system. In addition, we develop an algorithm based on Bees Colony Optimization to solve the scheduling Problem. Thereafter, our algorithm is compared with a previous one inspired also by the bees mentioned for the same purpose, and with the optimal solution for the displayed scheduling Problem.
References used
G. BENI, 1988. “The concept of cellular robotic system,” in Proc. of the IEEE International Symposium on Intelligent Control, IEEE Computer Society Press, Los Alamitos, CA , pp. 57–62
G. BENI, AND J. WANG, 1989. “Swarm intelligence,” in Proc. of the Seventh Annual Meeting of the Robotics Society of Japan, RSJ Press, Tokyo, pp. 425–428
G. BENI, AND S. HACKWOOD, 1992. “Stationary waves in cyclic swarms,” in: Proc. of the International Symposium on Intelligent Control, IEEE Computer Society Press, Los Alamitos, CA, pp. 234–242
rate research
Read More
Scheduling tasks on multiprocessors is considered one of the most
important issues studied to make processors operate without inertia (idleness) and thus to reduce the total time of completion or makespan. This increased interest in studying schedul
ing and its algorithms, especially in multiprocessor systems that need to
arrange the tasks to been optimally implemented.
In this research, we study the static scheduling issue for the
independent tasks on a homogenous multiprocessor system. In
addition, we develop an algorithm based on Bees Colony
Optimization to solve the scheduling Problem. Thereafter, our
algorithm is compared with a previous one inspired also by the bees behavior for the same purpose, and the optimal solution for the displayed scheduling Problem.
The aim of the algorithm is to find an acceptable solution with the
best time through Bees Colony's algorithm. To evaluate our reach,
we Study the effect of increasing the number of tasks when
processors numbers are constant, and the impact of increasing the
number of processors for a number of tasks on the stability of the
presented algorithm.
Our algorithm has shown the ability to obtain optimal value for the objective function in terms of scheduling tests for small and
medium size.
Our results shown that the imposed algorithm gives the best
solution for the scheduling problem, in most cases, and improves
the traditional BCO algorithm.
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.
In this paper, we propose a new accurate and fast converging
independent component analysis algorithm.
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.
The purpose of this research is to design and realization of an electronic circuitthat is able to control the water level in a tank. The circuit shows a tank water level in decimal numbers and controls the volume of water in the tank. So that when th
e level of water drops below a specific value that is preselected using a probe, the pump water works. When the water level reaches to another limit value, the pump stops working.We used for water level control a container which is made by transparent glass with volume of 15 L. the container is divided in nine levels. In addition to this purpose, because of large applications for realized electronic board, The circuit measures the speed of rotation of DC motorsin a wide range (0001 to 9999) cycles during a chosen period of time that ranges from 1 sec to 110 sec and display the speed of rotation in decimal numbers that appears on four displays. Moreover, the circuit contains a switch reset/start, for display clear and restart of measurement.
This study was carried out on samples of tap water, for several values of distance between the probes, and power supply. We found a quick response in showing levels and high efficiency in performance. We measured the number of special motor cycles for several values of the power supply during 30 s and 60 s, and the relation between the number of cycles and applied voltagewas drawingwe found it a linear relation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
