Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiments reveal unique patterns in algorithmic behaviors by workload. In the 15-task and 5-node scenario, the GA and PSO algorithms outclass all others, completing 100 percent of tasks before deadlines, Task 5 was a bane to the ACO algorithm. The study proposes a more extensive system that promotes an adaptive algorithmic approach based on workload characteristics. Numerically, the GA and PSO algorithms triumphed completing 100 percent of tasks before their deadlines in the face of 10 tasks and 5 nodes, while the ACO algorithm stumbled on certain tasks. As it is stated in the study, The above-mentioned system offers an integrated approach to ill-structured problem of task scheduling and resource allocation. It offers an intelligent and aggressive scheduling scheme that runs asynchronously when a higher number of tasks is submitted for the completion in addition to those dynamically aborts whenever system load and utilization cascade excessively. The proposed design seems like full-fledged solution over project scheduling or resource allocation issues. It highlights a detailed method of the choice of algorithms based on semantic features, aiming at flexibility. Effects of producing quantifiable statistical results from the experiments on performance empirically demonstrate each algorithm performed under various settings.
In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.
In this article, we will present a quasi-contraction mapping approach for D iteration, and we will prove that this iteration with modified SP iteration has the same convergence rate. At the other hand, we prove that the D iteration approach for quasi-contraction maps is faster than certain current leading iteration methods such as, Mann and Ishikawa. We are giving a numerical example, too.
The interests toward developing accurate automatic face emotion recognition methodologies are growing vastly, and it is still one of an ever growing research field in the region of computer vision, artificial intelligent and automation. However, there is a challenge to build an automated system which equals human ability to recognize facial emotion because of the lack of an effective facial feature descriptor and the difficulty of choosing proper classification method. In this paper, a geometric based feature vector has been proposed. For the classification purpose, three different types of classification methods are tested: statistical, artificial neural network (NN) and Support Vector Machine (SVM). A modified K-Means clustering algorithm
... Show MoreIn this paper was discussed the process of compounding two distributions using new compounding procedure which is connect a number of life time distributions ( continuous distribution ) where is the number of these distributions represent random variable distributed according to one of the discrete random distributions . Based on this procedure have been compounding zero – truncated poisson distribution with weibell distribution to produce new life time distribution having three parameter , Advantage of that failure rate function having many cases ( increasing , dicreasing , unimodal , bathtube) , and study the resulting distribution properties such as : expectation , variance , comulative function , reliability function and fa
... Show MoreThe phytoremediation technique has become very efficient for treating soil contaminated with heavy metals. In this study, a pot experiment was conducted where the Dodonaea plant (known as hops) was grown, and soil previously contaminated with metals (Zn, Ni, Cd) was added at concentrations 100, 50, 0 mg·kg-1 for Ni and Zn, and at concentrations of 0, 5, 10 mg·kg-1 for cadmium. Irrigation was done within the limits of the field capacity of the soil. Cadmium, nickel and zinc was estimated in the soil to find out the capacity of plants to the absorption of heavy and contaminated metals by using bioconcentration factors (BCFs), bioaccumulation coefficient (BAC) and translocation factor (TF). Additionally, BCF values of both Ni and Zn were l
... Show MoreThe experiment aimed to compare different methods of measuring the Feed pellet durability through the effect of pellet die speeds and the particle size (mill sieve holes diameter). Feed pellet durability was studied in four different ways: pellet direct measurement (%), pellet lengths (%), pellet water absorption (%), pellet durability by drop box device (%), pellet durability by air pressure device (%). Three pellet die speeds 280, 300, and 320 rpm, three mill sieve holes diameter 2, 4, and 6 mm, have been used. The results showed that increasing the pellet die speeds from 280 to 300 then to 320 rpm led to a significant decrease in the feed pellet durability by direct measurement, drop box device, and air pressure device, while pel
... Show MoreIn our article, three iterative methods are performed to solve the nonlinear differential equations that represent the straight and radial fins affected by thermal conductivity. The iterative methods are the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM) to get the approximate solutions. For comparison purposes, the numerical solutions were further achieved by using the fourth Runge-Kutta (RK4) method, Euler method and previous analytical methods that available in the literature. Moreover, the convergence of the proposed methods was discussed and proved. In addition, the maximum error remainder values are also evaluated which indicates that the propo
... Show Moresummary
In this search, we examined the factorial experiments and the study of the significance of the main effects, the interaction of the factors and their simple effects by the F test (ANOVA) for analyze the data of the factorial experience. It is also known that the analysis of variance requires several assumptions to achieve them, Therefore, in case of violation of one of these conditions we conduct a transform to the data in order to match or achieve the conditions of analysis of variance, but it was noted that these transfers do not produce accurate results, so we resort to tests or non-parametric methods that work as a solution or alternative to the parametric tests , these method
... Show More