
Distributed real time system has developed into an outstanding computing platform for parallel, high-efficiency applications. A real time system is a kind of planning where tasks must be completed with accurate results within a predetermined amount of time. It is well known that obtaining an optimal assignment of tasks for more than three processors is an NP-hard problem. This article examines the issue of assigning tasks to processors in heterogeneous distributed systems with a view to reduce cost and response time of the system while maximizing system reliability. The proposed method is carried out in two phases, Phase Ⅰ provides a hybrid HPSOGAK, that is an integration of particle swarm optimization (PSO), genetic algorithm (GA), and k-means technique while Phase Ⅱ is based on GA. By updating cluster centroids with PSO and GA and then using them like initial centroids for the k-means algorithm to generate the task-clusters, HPSOGAK produces 'm' clusters of 'r' tasks, and then their assignment onto the appropriate processor is done by using GA. The performance of GA has been improved in this article by introducing new crossover and mutation operators, and the functionality of traditional PSO has been enhanced by combining it with GA. Numerous examples from various research articles are employed to evaluate the efficiency of the proposed technique, and the numerical results are contrasted with well-known existing models. The proposed method enhances PIR values by 22.64%, efficiency by 6.93%, and response times by 23.8 on average. The experimental results demonstrate that the suggested method outperforms all comparable approaches, leading to the achievement of superior results. The developed mechanism is acceptable for an erratic number of tasks and processors with both types of fuzzy and crisp time.
Citation: Karishma, Harendra Kumar. A novel hybrid model for task scheduling based on particle swarm optimization and genetic algorithms[J]. Mathematics in Engineering, 2024, 6(4): 559-606. doi: 10.3934/mine.2024023
[1] | T. A. Shaposhnikova, M. N. Zubova . Homogenization problem for a parabolic variational inequality with constraints on subsets situated on the boundary of the domain. Networks and Heterogeneous Media, 2008, 3(3): 675-689. doi: 10.3934/nhm.2008.3.675 |
[2] | Ken-Ichi Nakamura, Toshiko Ogiwara . Periodically growing solutions in a class of strongly monotone semiflows. Networks and Heterogeneous Media, 2012, 7(4): 881-891. doi: 10.3934/nhm.2012.7.881 |
[3] | Junlong Chen, Yanbin Tang . Homogenization of nonlinear nonlocal diffusion equation with periodic and stationary structure. Networks and Heterogeneous Media, 2023, 18(3): 1118-1177. doi: 10.3934/nhm.2023049 |
[4] | Benjamin Contri . Fisher-KPP equations and applications to a model in medical sciences. Networks and Heterogeneous Media, 2018, 13(1): 119-153. doi: 10.3934/nhm.2018006 |
[5] | Thomas Geert de Jong, Georg Prokert, Alef Edou Sterk . Reaction–diffusion transport into core-shell geometry: Well-posedness and stability of stationary solutions. Networks and Heterogeneous Media, 2025, 20(1): 1-14. doi: 10.3934/nhm.2025001 |
[6] | Iryna Pankratova, Andrey Piatnitski . Homogenization of convection-diffusion equation in infinite cylinder. Networks and Heterogeneous Media, 2011, 6(1): 111-126. doi: 10.3934/nhm.2011.6.111 |
[7] | Feiyang Peng, Yanbin Tang . Inverse problem of determining diffusion matrix between different structures for time fractional diffusion equation. Networks and Heterogeneous Media, 2024, 19(1): 291-304. doi: 10.3934/nhm.2024013 |
[8] | Xavier Blanc, Claude Le Bris . Improving on computation of homogenized coefficients in the periodic and quasi-periodic settings. Networks and Heterogeneous Media, 2010, 5(1): 1-29. doi: 10.3934/nhm.2010.5.1 |
[9] | Avner Friedman . PDE problems arising in mathematical biology. Networks and Heterogeneous Media, 2012, 7(4): 691-703. doi: 10.3934/nhm.2012.7.691 |
[10] | Bendong Lou . Self-similar solutions in a sector for a quasilinear parabolic equation. Networks and Heterogeneous Media, 2012, 7(4): 857-879. doi: 10.3934/nhm.2012.7.857 |
Distributed real time system has developed into an outstanding computing platform for parallel, high-efficiency applications. A real time system is a kind of planning where tasks must be completed with accurate results within a predetermined amount of time. It is well known that obtaining an optimal assignment of tasks for more than three processors is an NP-hard problem. This article examines the issue of assigning tasks to processors in heterogeneous distributed systems with a view to reduce cost and response time of the system while maximizing system reliability. The proposed method is carried out in two phases, Phase Ⅰ provides a hybrid HPSOGAK, that is an integration of particle swarm optimization (PSO), genetic algorithm (GA), and k-means technique while Phase Ⅱ is based on GA. By updating cluster centroids with PSO and GA and then using them like initial centroids for the k-means algorithm to generate the task-clusters, HPSOGAK produces 'm' clusters of 'r' tasks, and then their assignment onto the appropriate processor is done by using GA. The performance of GA has been improved in this article by introducing new crossover and mutation operators, and the functionality of traditional PSO has been enhanced by combining it with GA. Numerous examples from various research articles are employed to evaluate the efficiency of the proposed technique, and the numerical results are contrasted with well-known existing models. The proposed method enhances PIR values by 22.64%, efficiency by 6.93%, and response times by 23.8 on average. The experimental results demonstrate that the suggested method outperforms all comparable approaches, leading to the achievement of superior results. The developed mechanism is acceptable for an erratic number of tasks and processors with both types of fuzzy and crisp time.
Nonlinear partial differential equations (PDEs) impart multi-scale characteristics to the system, thereby allowing for a more accurate prediction of the transmission process of soliton solutions. In practical uses, nonlinear PDEs and soliton solutions are vital for characterizing various phenomena in science and engineering such as biology, physics, ocean engineering, and many more [1,2,3]. Various types of soliton solutions have been reported for integrable systems. For instance, horse-shoe like soliton and lump chain solitons have been studied for the elliptic cylindrical Kadomtsev–Petviashvili equation [4]. Yang et al. analyzed degenerating lump chains into anomalously scattered lumps for the Mel'nikov equation [5]. In literature [6], a series of ripple waves with decay modes for the (3+1)‑dimensional Kadomtsev–Petviashvili equation have been reported. Rogue wave solutions to the (3+1)-dimensional Korteweg-de Vries Benjamin-Bona-Mahony equation were studied via the Hirota bilinear approach [7]. The propagation features and interactions of Rossby waves soliton of the geophysical equation were studied [8]. Breather, lump, and its interaction solutions for the higher dimensional evolution equation were studied[9]. Multisoliton solutions for the variable coefficient Schrödinger equation has been explored in the literature [10]. Some other solitons solutions have been reported for the regularized long-wave equation [11], the Sharma-Tasso-Olver-Burgers equation [12], the modified Schrödinger's equation [13], the complex Ginzburg–Landau equation [14], the (2+1) dimensional Chaffee–Infante equation [15], and many more [16,17,18].
Stochastic differential equations (DEs) deal with phenomena having randomness or uncertainties. Stochastic DEs can be used in various field of science and engineering [19,20,21]. Solving stochastic nolinear PDEs is very challenging and hard due to randomness. Therefore, various methods have been introduced and implemented to derive solutions of stochatics PDEs such as the modified tanh method [22], the modified Kudrayshov technique [23], the Sardar subequation method [24], and many more [25,26].
Fractional operators (FOs) have been frequently used for modelling the physical phenomena in various fields due to its memory process [27,28,29]. In literature, several FOs have been constructed by researchers and scientists [30,31,32]. Most of them do not satisfy some properties such as the chain and quotient rules. A few years ago, Atangana [33] defined a local FO called beta derivative, which generalized the classical operator. The {beta derivative (BD)} is defined as follows:
DβxΨ(x)=dβΨdxβ=limh0→0Ψ(x+h0(x+1Γ(β))1−β−Ψ(x))h0,0<β≤1. |
Here, the BD has the following characteristics: For every real numbers, m and n:
(1)DβxΨ(x)=(x+1Γ(β))1−βdΨdx.(2)Dβx(mΨ+nΦ)=m(x+1Γ(β))1−βdΨdx+n(x+1Γ(β))1−βdΦdx.(3)Dβx(Ψ∘Φ(x))=(x+1Γ(β))1−βdΨdxΦ′(x)(Ψ′(x)).(4)DβxΨ(m)=0. |
The BD has been used for the analysis of soliton solutions with the fractional behavior of nonlinear PDEs [34,35,36]. This work modifies the Benjamin-Bona-Mahony equation (BBME) as follows:
Mt+6MDβxM+DβxxxM−ρDβxxMt=τ(M−ρDβxxM)dPdt, | (1.1) |
where ρ is real parameter, M=M(x,t) is a real valued wave profile, τ is the intensity of sound, and P=P(t) is a white noise having the following properties:
(i)P possesses constant trajectories.
(ii)P(0)=0.
(iii)P(tj+1)−P(tj) has a normal standard distribution.
When we consider τ=0 and β=1, we get the BBME as follows:
Mt+6MMx+Mxxx−ρMxxt=0. | (1.2) |
Benjamin, Bona, and Mahony examined equation (1.2) as an adjustment to the KdV equation. The BBME has been used to analyze the prorogation of long surface gravity pulses with small amplitudes. There are several studies on the BBME. For instance, BBME was studied by using the variational method [37], the deep learning method [38], the generalized exp-function method [39], and many more [40,41]. In [42], the authors have used the F-expansion method to study the solitary waves BBME under BD with white noise. In this paper, we use two advanced analytical methods to deduce more solitary waves solutions and to study the influence of the BD and the white noise.
This section provides the general procedure of the suggested approaches that one can use to find solitary and other waves solutions.
Here, we present the general procedure of the G′G′+G+A-expansion technique. Consider a PDE under space BD as follows
A1(M,∂βxM,∂tM,∂βx∂βxM,∂βx∂tM,∂t∂tM,⋯)=0, | (2.1) |
where A1 is a polynomial in M=M(x,t) and its partial derivatives. To use the proposed procedure, one should abide by the following:
Step 1. First using the wave transformation, one can obtain ODE as follows:
M(x,t)=M(ω1)eτP(t)−12τ2t, | (2.2) |
where ω1=ξ1β(x+1Γ(β))β+ξ2t. Additionally, ξ1 and ξ2 are referred to as the wave speed and the wave number, respectively. By inserting Eq (2.2) in Eq (2.1), the following will be obtained:
A1(M,M′,M′′,M′′′)=0, | (2.3) |
where the ordinary derivatives of different orders are indicated by primes.
Step 2. According to the proposed strategy, we examine the following form for the solution to Eq (2.3):
M(ω1)=ℵ∑i=0Fi(G′(ω1)G′(ω1)+G(ω1)+A)i, | (2.4) |
where Fi is the function of the polynomial's coefficients (G′G′+G+A)i,i=0,1,2,…,ℵ. Assume that G(ω1) is a function that fulfills the subsequent relation:
G′′+AG′+BG+BA=0. | (2.5) |
The value of ℵ can be determined using the homogeneous balance rule (HBR) between the highest nonlinear term and the highest order derivative in Eq (2.3).
Step 3. In this step, the result obtained from the substitution of Eq (2.4) into Eq (2.3) and the coefficients of various powers of (G′G′+G+A) should be compared in terms of A,B,ξ1,ξ2, and i=0,1,2,…,ℵ. Using Mathematica or any other mathematical package, one can determine the solution's values G in the term (G′G′+G+A), and ultimately for the principles of (G′G′+G+A), Fi and ω1. In doing so, the solution of Eq (2.2) can be obtained.
Here, we present the general procedure of applying the modified G′G2-expansion approach to obtain the wave solutions of a nonlinear PDE. This approach contains the following expansion:
M(ω1)=F0+ℵ∑i=1(Fi(G′(ω1)G(ω1)2)i+Si(G′(ω1)G(ω1)2)−i), | (2.6) |
where G(ω1) satisfies the following the equation:
G′′(ω1)=ΨG′(ω1)2G(ω1)2+ψG′(ω1)+2G′(ω1)2G(ω1)+ϖG(ω1)2, | (2.7) |
where Ψ,ψ, and ϖ are the arbitrary constants. Next, one should find the value of ℵ as previously mentioned. Then, substituting Eq (2.6) and using Eq (2.7) into Eq (2.3), one can obtain a differential equation in G(ω1). Then, collecting those terms which contain (G′G2)i, (i=0,1,2,…,n), and setting all the coefficients of (G′G2)i equal to zero, one can acquire a system of algebraic equations. Solving the obtained system can possibly result in the following families.
Family 1. If Ψϖ>0 and ψ=0, the we have the following:
G′G2=√Ψϖ(p1cos(ω1√Ψϖ)+p2sin(ω1√Ψϖ))ϖ(p2cos(ω1√Ψϖ)−p1sin(ω1√Ψϖ)), | (2.8) |
where p1,p2,Ψ, and ϖ are arbitrary constants.
Family 2. If Ψϖ<0 and ψ=0, then we have the following:
G′G2=−√Ψϖ(p1sinh(2ω1√Ψϖ)+p1cosh(2ω1√Ψϖ)+p2)ϖ(p1sinh(2ω1√Ψϖ)+p1cosh(2ω1√Ψϖ)+p2). | (2.9) |
Here, we explore the wave solutions for the proposed stochastic BBME under BD as given in Eq (1.1) with the following procedure:
M(x,t)=M(ω1)eτP(t)−12τ2t. | (3.1) |
Furthermore, we have the following:
Mt=(ξ2M′+τMPt+12τ2M−12τ2M)eτP(t)−12τ2t, | (3.2) |
and
DβxxMt=(ξ21ξ2M′′′+τPtξ21M′′)eτP(t)−12τ2t,DβxM=(ξ1M′)eτP(t)−12τ2t,DβxxxM=(ξ31M′′′)eτP(t)−12τ2t. | (3.3) |
Inserting Eq (3.1) into Eq (1.1) and using Eqs (3.2) and (3.3), we obtain the following:
ξ2M′+(ξ31−ρξ21ξ2)M′′′+6ξ1MM′e−12τ2tEeτP(t)=0. | (3.4) |
By considering P(t), the Gaussian process, and EeτP(t)=e12τ2t, then, Eq (3.4) becomes:
ξ2M′+(ξ31−ρξ21ξ2)M′′′+6ξ1MM′=0. | (3.5) |
Integrating Eq (3.5) one time while considering the integration constant to be zero, we obtain the following:
ζM+M′′+ηM2=0, | (3.6) |
where
ζ=ξ2ξ31−ρξ21ξ2,η=3ξ21−ρξ1ξ2. |
In Eq (3.6), by using the homogeneous balance principle, we obtain ℵ=2. Now, we have Eq (2.4) in the following form:
M1(ω1)=F0+F1(G′G′+G+A)+F2(G′G′+G+A)2. | (3.7) |
Inserting the solution of Eq (3.7) with Eq (2.5) into Eq (3.6), the polynomial of the left side will be in (G′G′+G+A)i,i=0,1,2⋯ℵ. By further equating the coefficients of various powers of (G′G′+G+A) to zero, we obtain a system of algebraic equations. Using Mathematica to solve the system of equations, we obtain the following sets:
{F0=ξ1ξ2(A2−12AB+4B(3B+2))−ξ2√ξ21(A2−4B)26ξ1√ξ21(A2−4B)2,F1=∓2ξ2(A−2B)(A−B−1)√ξ21(A2−4B)2,F2=2ξ2(−A+B+1)2√ξ21(A2−4B)2,ρ=ξ21√ξ21(A2−4B)2+ξ41ξ2ξ31. | (3.8) |
Now, inserting the parameter values presented in Eq (3.8) into Eq (3.7), we get the exact solutions of Eq (3.6) in the following two cases:
Set 1. For D=A2−4B>0, we have the following:
M(ω1)=(ξ1ξ2(A2−12AB+(12B2+8B))−ξ2√ξ21(A2−4B)26ξ1√ξ21(A2−4B)2−(2ξ2(A−2B)(A−B−1))(ν2e√Dω1(A−√D)+ν1(√D+A))√ξ21(A2−4B)2(ν2e√Dω1(−√D+A−2)+ν1(√D+A−2))(2ξ2(−A+B+1)2)(ν2e√Dω1(A−√D)+ν1(√D+A)ν2e√Dω1(−√D+A−2)+ν1(√D+A−2))2√ξ21(A2−4B)2)eτP(t)−12τ2t, | (3.9) |
where ν1 and ν2 remain constants.
Set 2. For D=A2−4B<0, we have the following:
M(ω1)=(ξ1ξ2(A2−12AB+(12B2+8B))−ξ2√ξ21(A2−4B)26ξ1√ξ21(A2−4B)2−(2ξ2(A−2B)(A−B−1))√ξ21(A2−4B)2(Aν2+ν1√−D)sin(√−D2)+(Aν1−ν2√−D)cos(√−D2)((A−2)ν2+ν1√−D)sin(√−D2)+((A−2)ν1−ν2√−D)cos(√−D2)(2ξ2(−A+B+1)2)√ξ21(A2−4B)2((Aν2+ν1√−D)sin(√−D2)+(Aν1−ν2√−D)cos(√−D2)((A−2)ν2+ν1√−D)sin(√−D2)+((A−2)ν1−ν2√−D)cos(√−D2))2)eτP(t)−12τ2t. | (3.10) |
Since the highest-order nonlinear term and the highest-order derivative term are balanced according to the homogenous balance principle in Eq (3.6), we know that the balance number is ℵ=2. Therefore, we have the following:
M(ω1)=F0+F1G′G2+F2(G′G2)2+S1G′G2+S2(G′G2)2. | (4.1) |
Inserting Eq (4.1) with aid of Eq (2.7) into Eq (3.6), and following the same procedure as earlier, we obtain the following:
F1=−2Ψξ21ψ4ρΨξ21ϖ+ρξ21(−ψ2)+1,F2=−2Ψ2ξ214ρΨξ21ϖ+ρξ21(−ψ2)+1,S1=0,S2=0,ξ2=ξ31(4Ψϖ−ψ2)4ρΨξ21ϖ+ρξ21(−ψ2)+1,F0=−2Ψξ21ϖρξ21(4ϖΨ−ψ2)+1. | (4.2) |
Putting the values of the parameters presented in Eq (4.1) into Eq (3.6) and making use of Eqs (2.8) and (2.9), we obtain the following exact solutions.
Family 1. If Ψϖ>0 and ψ=0, then we have the following:
M(ω1)=(−(2Ψ2ξ21)(√Ψϖ(p1cos(ω1√Ψϖ)+p2sin(ω1√Ψϖ))ϖ(p2cos(ω1√Ψϖ)−p1sin(ω1√Ψϖ))2)24Ψξ21ϖρ+1−2Ψξ21ϖ4Ψξ21ϖρ+1)eτP(t)−12τ2t. | (4.3) |
Family 2. If Ψϖ<0 and ψ=0, then we have the following:
M(ω1)=(−(2Ψ2ξ21)(−√Ψϖ(p1sinh(2ω1√Ψϖ)+p1cosh(2ω1√Ψϖ)+p2)(ϖ(p1sinh(2ω1√Ψϖ)+p1cosh(2ω1√Ψϖ)+p2))2)24Ψξ21ϖρ+1−2Ψξ21ϖ4Ψξ21ϖρ+1)eτP(t)−12τ2t. |
This portion of the present work graphically visualize the obtained solutions and presents some physical interpretations and discussions on the obtained results. In Figure 1, solution (3.9) with particular values (i.e, ν1=5,ν2=−.5,ξ1=−.2,ξ2=−1,A=3,B=2.6,τ=0,P=0) is visualized. In Figure 1, the value of β is varied while the noise intensity τ is considered as zero. The β is used as 1, 0.9, and 0.8 for subfigures (1a, 1d), (1b, 1e), and (1c, 1f), respectively. Here, we observed the dark soliton wave, where we see that as the fractional order decreases when the wave separation is increased.
Furthermore, Figure 2 shows the dynamics of the exact solution (2.2) by varying the noise intensity while keeping the β=0.95. Other parameters are used for the simulation of Figure 1. The τ is used as 0.1, 0.4, and 0.9 for subfigures (2a, 2d), which is (2b, 2e), and (2c, 2f), respectively. In Figure 2, one can observe the affects of noise on the dynamics of the solution, which is simulated here. Furthermore, the dynamics of the exact solution (3.10) are visualized in Figures 3 and 4 by varying β and τ, respectively. In the simulation of these figures, the parameters are selected in the form ν1=.5,ν2=1,ξ1=−.7,ξ2=.5,p1=2,p2=1,A=−4,B=0,τ=0,P=0; alternatively in Figure 3, the τ is considered as zero. and in Figure 4. the β is fixed as 0.95. The β is used as 1, 0.9, and 0.8 for subfigures (3a, 3d), (3b, 3e), and (3c, 3f), respectively. Similarly, τ is used as 0.2, 0.5, and 0.8 for subfigures (4a, 4d), (4b, 4e), and (4c, 4f), respectively. Here, we observed the interaction of the bright wave with a kink wave, where the amplitude of the bright wave decreases as the β decreases in the negative region of the spatial coordinate.
In Figure 5, the solution (3.9) with particular values (i.e, ν1=5,ν2=−.5,ξ1=−.2,ξ2=−1,A=3,B=2.6,τ=0, and P=0) is visualized. In Figure 5, the various values for β are considered, while the noise intensity τ is supposed to be zero. The β is considered as 1, 0.95, and 0.9 for subfigures (5a, 5d), (5b, 5e), and (5c, 5f), respectively. Here, we observed the hybrid bright-dark soliton wave, where we see that as the fractional order decreases when then amplitude of the dark solitons increases and the bright soliton is decreases.
Moreover, Figure 6 shows the dynamics of the exact solution (3.9) by varying the noise intensity while keeping the β=0.95. Other parameters are used for the simulation of Figure 5. The τ is used as 0.5, 0.6, and 0.9 for subfigures (6a, 6d), (6b, 6e), and (6c, 6f), respectively. In Figure 6, one can observe the affects of noise on the dynamics of the solution, which is simulated here; it can be seen that the highest and lowest amplitude areas become more random as τ increases.
Furthermore, the dynamics of the exact solution (3.10) are visualized in Figures 7 and 8 by varying β and τ, respectively. In the simulation of these figures, the parameters are selected in the form ρ=1,ϖ=−.1,ξ1=1,Ψ=1,p1=1,p2=1,P=0, and τ=0; alternatively, in Figure 7, the τ is considered as zero, and in Figure 8, the β is fixed as 0.95. The β is used as 1, 0.9, and 0.8 for subfigures (7a, 7d), (7b, 7e), and (7c, 7f), respectively. Similarly, τ is used as 0.05, 0.3, and 0.6 for subfigures (8a, 8d), (8b, 8e), and (8c, 4f), respectively. Here, we observed the periodic wave solution, where the amplitude of the periodic waves decreases as the β decreases in the negative region of the spatial coordinate. Furthermore, we see that the wave profile behaves more randomly in areas where the amplitude is either low or high. Thus, from these analyses, it can be noticed that the obtained results are more generalized than the solutions reported in previous papers. Indeed, when the BD operators equals one, the solution converges to the stochastic integer order solutions. If the intensity of the white noise is zero, then the solutions converge to a deterministic case. When β=1 and τ=0, the obtained solutions converge to the determinsitic case.
This study has explored the stochastic BBME with the BD, thereby incorporating multiplicative noise in the Itô sense. We have derived various analytical soliton solutions for these equations by utilizing two distinct expansion methods, both within the framework of beta derivatives. A fractional multistep transformation was employed to convert the equations into nonlinear forms with respect to an independent variable. After performing algebraic manipulations, the solutions were found to be trigonometric and hyperbolic trigonometric functions. Our analysis demonstrated that the wave behavior was influenced by the fractional-order derivative in the proposed equations, thus providing deeper insights into the wave composition as the fractional order increases or decreases. Additionally, we examined the effect of white noise on the propagation of wave solutions. This study has underscored the computational robustness and adaptability of the proposed approach to investigate various phenomena in the physical sciences and engineering.
Conceptualization: M.S.D.S. Methodology: K.A.A. Software: S.S. Validation: A.K. Formal analysis: A.K. Investigation: M.H. Writing-original draft preparation: K.A.A. Writing-review and editing: H.S., A.M.
The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2024-9/1). The authors wish to extend their sincere gratitude to the Deanship of Scientific Research at the Islamic University of Madinah.
All authors declare no conflicts of interest in this paper.
[1] | R. Mall, Real-time systems: theory and practice, Pearson Education India, 3 Eds., 2009. |
[2] |
H. Jin, P. Tan, A novel dynamic allocation and scheduling scheme with CPNA and FCF algorithms in distributed real-time systems, 11th International Conference on Parallel and Distributed Systems (ICPADS'05), 1 (2005), 550–556. https://doi.org/10.1109/ICPADS.2005.38 doi: 10.1109/ICPADS.2005.38
![]() |
[3] | Y. Singh, M. Popli, S. S. P. Shukla, Energy reduction in weakly hard real time systems, 2012 1st International Conference on Recent Advances in Information Technology (RAIT), 2012,909–915. https://doi.org/10.1109/RAIT.2012.6194555 |
[4] |
V. Jeyakrishnan, P. Sengottuvelan, A hybrid strategy for resource allocation and load balancing in virtualized data centers using BSO algorithms, Wireless Pers. Commun., 94 (2017), 2363–2375. https://doi.org/10.1007/s11277-016-3481-8 doi: 10.1007/s11277-016-3481-8
![]() |
[5] |
V. M. A. Xavier, S. Annadurai, Chaotic social spider algorithm for load balance aware task scheduling in cloud computing, Cluster Comput., 22 (2019), 287–297. https://doi.org/10.1007/s10586-018-1823-x doi: 10.1007/s10586-018-1823-x
![]() |
[6] |
X. Huang, C. Li, H. Chen, D. An, Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies, Cluster Comput., 23 (2020), 1137–1147. https://doi.org/10.1007/s10586-019-02983-5 doi: 10.1007/s10586-019-02983-5
![]() |
[7] |
L. Abualigah, M. A. Elaziz, P. Sumari, Z. W. Geem, A. H. Gandomi, Reptile search algorithm (RSA): a nature-inspired meta-heuristic optimizer, Expert Syst. Appl., 191 (2022), 116158. https://doi.org/10.1016/j.eswa.2021.116158 doi: 10.1016/j.eswa.2021.116158
![]() |
[8] |
R. I. Davis, A. Burns, A survey of hard real-time scheduling for multiprocessor systems, ACM Comput. Surv. (CSUR), 43 (2011), 1–44. https://doi.org/10.1145/1978802.1978814 doi: 10.1145/1978802.1978814
![]() |
[9] |
Y. Zhang, A. Sivasubramaniam, J. Moreira, H. Franke, Impact of workload and system parameters on next generation cluster scheduling mechanisms, IEEE Trans. Parall. Distr. Syst., 12 (2001), 967–985. https://doi.org/10.1109/71.954632 doi: 10.1109/71.954632
![]() |
[10] | H. Casanova, A. Legrand, D. Zagorodnov, F. Berman, Heuristics for scheduling parameter sweep applications in grid environments, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000), 2000,349–363. https://doi.org/10.1109/HCW.2000.843757 |
[11] |
J. Kennedy, R. C. Eberhart, Particle swarm optimization, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000), 4 (1995), 1942–1948. https://doi.org/10.1109/ICNN.1995.488968 doi: 10.1109/ICNN.1995.488968
![]() |
[12] | D. E. Goldberg, Genetic algorithm in search, optimization and machine learning, Boston: Addison-Wesley Longman Publishing Co., Inc., 1989. |
[13] |
Z. Wu, X. Liu, Z. Ni, D. Yuan, Y. Yang, A market-oriented hierarchical scheduling strategy in cloud workflow systems, J. Supercomput., 63 (2011), 256–293. https://doi.org/10.1007/s11227-011-0578-4 doi: 10.1007/s11227-011-0578-4
![]() |
[14] |
M. Naderam, M. Dehgham, H. Pedram, Upper and lower bounds for dynamic cluster assignment for multi-agent tracking in heterogeneous WSNs, J. Parall. Distr. Com., 73 (2012), 1389–1399. https://doi.org/10.1016/j.jpdc.2013.04.007 doi: 10.1016/j.jpdc.2013.04.007
![]() |
[15] |
L. Wang, S. U. Khan, D. Chen, J. Kolodziej, R. Ranian, C. Z. Xu, et al., Energy-aware parallel task scheduling in a cluster, Future Gener. Comp. Sy., 29 (2013), 1661–1670. https://doi.org/10.1016/j.future.2013.02.010 doi: 10.1016/j.future.2013.02.010
![]() |
[16] |
B. Tripathy, S. Dash, S. K. Padhy, Dynamic task scheduling using a directed neural network, J. Parall. Distr. Com., 75 (2015), 101–106. https://doi.org/10.1016/j.jpdc.2014.09.015 doi: 10.1016/j.jpdc.2014.09.015
![]() |
[17] | Y. Xiao, Z. Ren, H. Zhang, C. Chen, C. Shi, A novel task allocation for maximizing reliability considering fault-tolerant in VANET real time systems, 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), 2017, 1–7. https://doi.org/10.1109/PIMRC.2017.8292511 |
[18] |
P. Neamatollahi, S. Abrishami, M. Naghibzadeh, M. H. Y. Moghaddam, O. Younis, Hierarchical clustering-task scheduling policy in cluster-based wireless sensor networks, IEEE Trans. Ind. Inform., 14 (2018), 1876–1886. https://doi.org/10.1109/TII.2017.2757606 doi: 10.1109/TII.2017.2757606
![]() |
[19] | H. Kumar, N. K. Chauhan, P. K. Yadav, A high performance model for task allocation in distributed computing system using k-means clustering technique, In: Research anthology on architectures, frameworks, and integration strategies for distributed and cloud computing, 9 (2021), 1244–1268. https://doi.org/10.4018/978-1-7998-5339-8.ch060 |
[20] |
T. K. Dao, T. S. Pan, T. T. Nguyen, J. S. Pan, Parallel bat algorithm for optimizing makespan in job shop scheduling problems, J. Intell. Manuf., 29 (2018), 451–462. https://doi.org/10.1007/s10845-015-1121-x doi: 10.1007/s10845-015-1121-x
![]() |
[21] |
H. Kumar, I. Tyagi, Implementation and comparative analysis of k-means and fuzzy c-means clustering algorithms for tasks allocation distributed real time system, Int. J. Embedded Real-Time Commun. Syst., 10 (2019), 66–86. https://doi.org/10.4018/IJERTCS.2019040105 doi: 10.4018/IJERTCS.2019040105
![]() |
[22] |
A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, H. Chen, Harris Hawks optimization: algorithm and applications, Future Gene. Comput. Syst., 97 (2019), 849–872. https://doi.org/10.1016/j.future.2019.02.028 doi: 10.1016/j.future.2019.02.028
![]() |
[23] |
F. Alkhateeb, B. H. Abed-alguni, A hybrid cuckoo search and simulated annealing algorithm, J. Intell. Syst., 28 (2019), 683–898. https://doi.org/10.1515/jisys-2017-0268 doi: 10.1515/jisys-2017-0268
![]() |
[24] |
E. B. Tirkolaee, A. Goli, G. W. Weber, Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option, IEEE Trans. Fuzzy Syst., 28 (2020), 2772–2783. https://doi.org/10.1109/TFUZZ.2020.2998174 doi: 10.1109/TFUZZ.2020.2998174
![]() |
[25] |
H. Kanemitsu, M. Hanada, H. Nakazato, Clustering-based task scheduling in a large number of heterogeneous processors, IEEE Trans. Parall. Distr. Syst., 27 (2016), 3144–3157. https://doi.org/10.1109/TPDS.2016.2526682 doi: 10.1109/TPDS.2016.2526682
![]() |
[26] |
K. Mishra, S. K. Majhi, A binary bird swarm optimization based load balancing algorithm for cloud computing environment, Open Comput. Sci., 11 (2021), 146–160. https://doi.org/10.1515/comp-2020-0215 doi: 10.1515/comp-2020-0215
![]() |
[27] |
N. A. Alawad, B. H. Abed-alguni, Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem, J. Supercomput., 78 (2022), 3517–3538. https://doi.org/10.1007/s11227-021-03998-9 doi: 10.1007/s11227-021-03998-9
![]() |
[28] |
M. Haris, S. Zubair, Mantaray modified multi-objective Harris hawk optimization algorithm expedites optimal load balancing in cloud computing, J. King Sau. Univ.-Comput. Inf. Sci., 34 (2022), 9696–9709. https://doi.org/10.1016/j.jksuci.2021.12.003 doi: 10.1016/j.jksuci.2021.12.003
![]() |
[29] |
M. Agarwal, G. M. S. Srivastava, Genetic algorithm-enabled particle swarm optimization (PSOGA)-based task scheduling in cloud computing environment, Int. J. Inf. Tech. Dec. Making, 17 (2018), 1237–1267. https://doi.org/10.1142/S0219622018500244 doi: 10.1142/S0219622018500244
![]() |
[30] |
Y. Kang, H. Lu, J. He, A PSO-based genetic algorithm for scheduling of tasks in a heterogeneous distributed system, J. Soft., 8 (2013), 1443–1450. https://doi.org/10.4304/jsw.8.6.1443-1450 doi: 10.4304/jsw.8.6.1443-1450
![]() |
[31] |
A. K. Samal, R. Mall, C. Tripathy, Fault tolerant scheduling of hard real-time tasks on multiprocessor system using a hybrid genetic algorithm, Swarm Evol. Comput., 14 (2014), 92–105. https://doi.org/10.1016/j.swevo.2013.10.002 doi: 10.1016/j.swevo.2013.10.002
![]() |
[32] |
I. R. K. Raju, P. S. Varma, M. V. R. Sundari, G. J. Moses, Deadline aware two stage scheduling algorithm in cloud computing, Indian J. Sci. Tech., 9 (2016), 1–10. https://doi.org/10.17485/ijst/2016/v9i4/80553 doi: 10.17485/ijst/2016/v9i4/80553
![]() |
[33] | M. Mutingi, C. Mbohwa, Modeling supplier selection using multi-criterion fuzzy grouping genetic algorithm, In: Grouping genetic algorithms: studies in computational intelligence, Cham: Springer, 666 (2017), 213–228. https://doi.org/10.1007/978-3-319-44394-2_12 |
[34] |
Z. Zhou, J. Chang, Z. Hu, J. Yu, F. Li, A modified PSO algorithm for task scheduling optimization in cloud computing, Concur. Comput.: Pract. Exper., 30 (2018), e4970. https://doi.org/10.1002/cpe.4970 doi: 10.1002/cpe.4970
![]() |
[35] |
J. Luan, Z. Yao, F. Zhao, X. Song, A novel method to solve supplier selection problem: Hybrid algorithm of genetic algorithm and ant colony optimization, Math. Comput. Simul., 156 (2018), 294–309. https://doi.org/10.1016/j.matcom.2018.08.011 doi: 10.1016/j.matcom.2018.08.011
![]() |
[36] | L. Tang, X. Zhang, Z. Li, Y. Zhang, A new hybrid task scheduling algorithm designed based on ACO and GA, J. Inf. Hiding Multim. Signal. Process., 9 (2018), 1585–1594. |
[37] |
J. P. B. Mapetu, Z. Chen, L. Kong, Low-time complexity and low-cost binary particle swarm optimization algorithm for task scheduling and load balancing in cloud computing, Appl. Intell., 49 (2019), 3308–3330. https://doi.org/10.1007/s10489-019-01448-x doi: 10.1007/s10489-019-01448-x
![]() |
[38] |
H. Kumar, N. K. Chauhan, P. K. Yadav, Hybrid genetic algorithm for task scheduling in distributed real-time system, Inter. J. Syst., Cont., Commun., 10 (2019), 32–52. https://doi.org/10.1504/IJSCC.2019.097417 doi: 10.1504/IJSCC.2019.097417
![]() |
[39] |
H. Kumar, I. Tyagi, Hybrid model for tasks scheduling in distributed real time system, J. Ambient Intell. Human Comput., 12 (2021), 2881–2903. https://doi.org/10.1007/s12652-020-02445-6 doi: 10.1007/s12652-020-02445-6
![]() |
[40] |
S. Devi, D. Garg, Hybrid genetic and particle swarm algorithm: redundancy allocation problem, Int. J. Syst. Assur. Eng. Manag., 11 (2020), 313–319. https://doi.org/10.1007/s13198-019-00858-x doi: 10.1007/s13198-019-00858-x
![]() |
[41] |
M. Agarwal, G. M. S. Srivastava, Opposition-based learning inspired particle swarm optimization (OPSO) scheme for task scheduling problem in cloud computing, J. Ambient Intell. Human. Comput., 12 (2020), 9855–9875. https://doi.org/10.1007/s12652-020-02730-4 doi: 10.1007/s12652-020-02730-4
![]() |
[42] |
H. Zhang, F. Liu, Y. Zhou, Z. Zhang, A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem, Inf. Sci., 539 (2020), 347–374. https://doi.org/10.1016/j.ins.2020.06.036 doi: 10.1016/j.ins.2020.06.036
![]() |
[43] |
N. K. Chauhan, I. Tyagi, H. Kumar, D. Sharma, Tasks scheduling through hybrid genetic algorithm in real‑time system on heterogeneous environment, SN Comput. Sci., 3 (2022), 75. https://doi.org/10.1007/s42979-021-00959-0 doi: 10.1007/s42979-021-00959-0
![]() |
[44] |
A. Amirteimoori, I. Mahdavi, M. Solimanpur, S. S. Ali, E. B. Tirkolaee, A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation, Comput. Ind. Eng., 173 (2022), 108672. https://doi.org/10.1016/j.cie.2022.108672 doi: 10.1016/j.cie.2022.108672
![]() |
[45] |
Karishma, H. Kumar, A new hybrid particle swarm optimization algorithm for optimal tasks scheduling in distributed computing system, Intell. Syst. Appl., 18 (2023), 200219. https://doi.org/10.1016/j.iswa.2023.200219 doi: 10.1016/j.iswa.2023.200219
![]() |
[46] |
G. Attiya, Y. Hamam, Task allocation for maximizing reliability of distributed systems: a simulating annealing approach, J. Parallel Distr. Com., 66 (2006), 1259–1266. https://doi.org/10.1016/j.jpdc.2006.06.006 doi: 10.1016/j.jpdc.2006.06.006
![]() |
[47] |
M. Jiang, J. Zhou, M. Hu, Fuzzy reliability analysis of disk array systems, 2007 Chinese Control Conference, 2007,314–317. https://doi.org/10.1109/CHICC.2006.4347012 doi: 10.1109/CHICC.2006.4347012
![]() |
[48] |
Q. M. Kang, H. He, H. M. Song, R. Deng, Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization, J. Syst. Soft., 83 (2010), 2165–2174. https://doi.org/10.1016/j.jss.2010.06.024 doi: 10.1016/j.jss.2010.06.024
![]() |
[49] | S. S. Donight, S. Khanmohammadi, A fuzzy reliability model for series-parallel system, J. Ind. Eng. Int., 7 (2011), 10–18. |
[50] |
K. Noori, K. Jenab, Fuzzy reliability-based traction control model for intelligent transportation systems, IEEE Trans. Syst. Man Cybern.: syst., 43 (2012), 229–234. https://doi.org/10.1109/TSMCA.2012.2204047 doi: 10.1109/TSMCA.2012.2204047
![]() |
[51] | L. Cederholm, N. Petterson, Distributed real time system survey, Sweden: Mälardalen University, 2009. |
[52] | J. Li, R. Guo, Z. Shao, The research of scheduling algorithm in real-time system, 2010 International Conference on Computer and Communication Technologies in Agriculture Engineering, 2010,333–336. https://doi.org/10.1109/CCTAE.2010.5544771 |
[53] |
Y. Li, A. M. K. Cheng, Transparent real-time task scheduling on temporal resource partitions, IEEE Trans. Comput., 65 (2015), 1646–1655. https://doi.org/10.1109/TC.2015.2449857 doi: 10.1109/TC.2015.2449857
![]() |
[54] | S. A. Narale, P. K. Butey, Throttled load balancing scheduling policy assist to reduce grand total cost and data center processing time in cloud environment using cloud analyst, 2018 Second International Conference on Inventive Communication and Computational Technologies (ICICCT), 2018, 1464–1467. https://doi.org/10.1109/ICICCT.2018.8473062 |
[55] |
M. Adhikari, S. Nandy, T. Amgoth, Meta heuristic-based task deployment mechanism for load balancing in IaaS cloud, J. Netw. Comput. Appl., 128 (2019), 64–77. https://doi.org/10.1016/j.jnca.2018.12.010 doi: 10.1016/j.jnca.2018.12.010
![]() |
[56] |
G. Li, Z. Wu, Ant colony optimization task scheduling algorithm for SWIM based on load balancing, Future Internet, 11 (2019), 90. https://doi.org/10.3390/fi11040090 doi: 10.3390/fi11040090
![]() |
[57] |
Z. Shao, D. Pi, W. Shao, Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment, Expert Syst. Appl., 145 (2020). https://doi.org/10.1016/j.eswa.2019.113147 doi: 10.1016/j.eswa.2019.113147
![]() |
[58] |
P. Hosseinioun, M. Kheirabadi, S. R. K. Tabbakh, R. Ghaemi, A new energy-aware tasks scheduling approach in fog computing using hybrid meta-heuristic algorithm, J. Parallel. Distr. Com., 143 (2020), 88–96. https://doi.org/10.1016/j.jpdc.2020.04.008 doi: 10.1016/j.jpdc.2020.04.008
![]() |
[59] |
S. Negi, M. M. S. Rauthan, K. S. Vaisla, N. Panwar, CMODLB: an efficient load balancing approach in cloud computing environment. J. Supercomp., 77 (2021), 8787–8839. https://doi.org/10.1007/s11227-020-03601-7 doi: 10.1007/s11227-020-03601-7
![]() |
[60] |
G. A. P. Princess, A. S. Radhamani, A hybrid meta-heuristic for optimal load balancing in cloud computing, J. Grid Comput., 19 (2021), 21. https://doi.org/10.1007/s10723-021-09560-4 doi: 10.1007/s10723-021-09560-4
![]() |
[61] |
S. M. Shatz, J. P. Wang, M. Goto, Task allocation for maximizing reliability of distributed computing system, IEEE Trans. Comput., 41 (1992), 1156–1168. https://doi.org/10.1109/12.165396 doi: 10.1109/12.165396
![]() |
[62] |
D. M. Abdelkader, F. Omara, Dynamic task scheduling algorithm with load balancing for heterogeneous computing system, Egypt. Inform. J., 13 (2012), 135–145. https://doi.org/10.1016/j.eij.2012.04.001 doi: 10.1016/j.eij.2012.04.001
![]() |
[63] |
H. Djigal, J. Feng, J. Lu, Task scheduling for heterogeneous computing using a predict cost matrix, ICPP Workshops '19: Workshop Proceedings of the 48th International Conference on Parallel Processing, 2019, 1–10. https://doi.org/10.1145/3339186.3339206 doi: 10.1145/3339186.3339206
![]() |
[64] | H. Kumar, M. P. Singh, P. K. Yadav, A tasks allocation model with fuzzy execution and fuzzy inter-tasks communication times in a distributed computing system, Int. J. Comput. Appl., 72 (2013), 24–31. |
[65] | M. Sharma, H. Kumar, D. Garg, An optimal task allocation model through clustering with inter-processor distances in heterogeneous distributed computing systems, Int. J. Soft Comput. Eng. (IJSCE), 2 (2012), 50–55. |
[66] | E. Ilavarasan, P. Thambidurai, R. Mahilmannan, High performance task scheduling algorithm for heterogeneous computing system, In: M. Hobbs, A. M. Goscinski, W. Zhou, Distributed and parallel computing. ICA3PP 2005, Lecture Notes in Computer Science, Springe, 3719 (2005), 193–203. https://doi.org/10.1007/11564621_22 |
[67] |
H. Kumar, I. Tyagi, A new hybrid optimization technique for scheduling of periodic and non-periodic tasks, Augment Hum. Res., 6 (2021), 11. https://doi.org/10.1007/s41133-021-00049-z doi: 10.1007/s41133-021-00049-z
![]() |
[68] |
H. Topcuoglu, S. Hariri, M. Y. Wu, Performance-effective and low complexity task scheduling for heterogeneous computing, IEEE Trans. Parallel Distr. Syst., 13 (2002), 260–274. https://doi.org/10.1109/71.993206 doi: 10.1109/71.993206
![]() |
[69] |
Y. Dai, X. Zhang, A synthesized heuristic task scheduling algorithm, Sci. World J., 2014 (2014), 465702. https://doi.org/10.1155/2014/465702 doi: 10.1155/2014/465702
![]() |
[70] |
P. K. Yadav, M. P. Singh, K. Sharma, Task allocation model for reliability and cost optimization in distributed computing system, Int. J. Model. Simul. Sci. Comput., 2 (2011), 131–149. https://doi.org/10.1142/S179396231100044X doi: 10.1142/S179396231100044X
![]() |
[71] |
M. I. Daoud, N. Kharma, A high performance algorithm for static task scheduling in heterogeneous distributed computing systems, J. Parallel Distr. Comput., 68 (2008), 399–409. https://doi.org/10.1016/j.jpdc.2007.05.015 doi: 10.1016/j.jpdc.2007.05.015
![]() |
[72] | A. Khandelwal, Optimal execution cost of distributed system: through clustering, Int. J. Eng. Sci. Tech., 3 (2011), 2320–2328. |
[73] | K. Govil, A. Kumar, A modified and efficient algorithm for static task assignment in distributed processing environment, Int. J. Comput. Appl., 23 (2011), 1–5. |
[74] | P. K. Yadav, P. P. Singh, P. Pradhan, A task allocation algorithm for optimum utilization of processor in heterogeneous distributed system, Int. J. Res. Rev. Eng. Sci. Tech., 2 (2013), 153–160. |
[75] |
M. Kafil, I. Ahmad, Optimal task assignment in heterogeneous distributed computing systems, IEEE Concurrency, 6 (1998), 42–50. https://doi.org/10.1109/4434.708255 doi: 10.1109/4434.708255
![]() |
[76] | A. Kumar, P. K. Yadav, Task management algorithm for distributed system, The 15th International Conference of International Academy of Physical Sciences, 2014. |
[77] |
V. M. Lo, Heuristic algorithms for task assignment in distributed system, IEEE Trans. Comput., 37 (1988), 1384–1397. https://doi.org/10.1109/12.8704 doi: 10.1109/12.8704
![]() |
[78] | U. Kaushal, A. Kumar, Improving the performance of DRTS by optimal allocation of multiple tasks under dynamic load sharing scheme, Int. J. Sci. Eng. Res., 4 (2013), 1316–1321. |
[79] |
Y. Kopiddakis, M. Lamari, V. Zissimopoulos, On the task assignment problem: two new heuristic algorithms, J. Parallel Dist. Comput., 42 (1997), 21–29. https://doi.org/10.1006/jpdc.1997.1311 doi: 10.1006/jpdc.1997.1311
![]() |
[80] |
M. Akbari, H. Rashidi, A multi objectives scheduling algorithm based on cuckoo optimization for task allocation problem at compile time in heterogeneous systems, Expert Syst. Appl., 60 (2016), 234–248. https://doi.org/10.1016/j.eswa.2016.05.014 doi: 10.1016/j.eswa.2016.05.014
![]() |
[81] | L. F. Bittencourt, R. Sakellariou, E. R. M. Madeira, DAG scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing, 2010, 27–34. https://doi.org/10.1109/PDP.2010.56 |
[82] | P. K. Yadav, M. P. Singh, A. Kumar, B. Agarwal, An efficient tasks scheduling model in distributed processing systems using ANN, Int. J. Circuits Syst., 1 (2011), 53–66. |
[83] | P. K. Yadav, P. Pradhan, P. P. Singh, A fuzzy clustering method to minimize the inter task communication effect for optimal utilization of processor's capacity in distributed real time systems, In: K. Deep, A. Nagar, M. Pant, J. Bansal, Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20–22, 2011, Advances in Intelligent and Soft Computing, Springer, 1 30 (2012), 159–168. https://doi.org/10.1007/978-81-322-0487-9_16 |
[84] |
B. Ucar, C. Aykanat, K. Kaya, M. Ikinci, Task assignment in heterogeneous computing systems, J. Parallel Dist. Comput., 66 (2006), 32–46. https://doi.org/10.1016/j.jpdc.2005.06.014 doi: 10.1016/j.jpdc.2005.06.014
![]() |
[85] |
R. Gupta, P. K. Yadav, Task allocation model for balance utilization of available resource in multiprocessor environment, J. Comput. Eng., 17 (2015), 94–99. https://doi.org/10.9790/0661-17419499 doi: 10.9790/0661-17419499
![]() |
[86] | A. A. Elsadek, B. E. Wells, A heuristic model for task allocation in heterogeneous distributed computing system, Int. J. Comput. Appl., 6 (1999), 1–36. |
1. | Peng E, Tingting Xu, Linhua Deng, Yulin Shan, Miao Wan, Weihong Zhou, Solutions of a class of higher order variable coefficient homogeneous differential equations, 2025, 20, 1556-1801, 213, 10.3934/nhm.2025011 |