A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids
In service-orientated grids (SOG) environments, grid workflow schedulers play a critical role in providing quality-of-service (QoS) satisfaction for various end users (EUs) with diverse QoS objectives and optimization requirements. The EU requirements are not only many and conflicting, but also invo...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/60691/1/A%20particle%20swarm%20optimization%20and%20min%E2%80%93max%C2%AD-based%20workflow%20scheduling%20algorithm%20with%20QoS%20satisfaction%20for%20service-%C2%ADoriented%20grids.pdf |
| _version_ | 1796977350605275136 |
|---|---|
| author | Ambursa, Faruku Umar Latip, Rohaya Abdullah, Azizol K. Subramaniam, Shamala |
| author_facet | Ambursa, Faruku Umar Latip, Rohaya Abdullah, Azizol K. Subramaniam, Shamala |
| author_sort | Ambursa, Faruku Umar |
| collection | UPM |
| description | In service-orientated grids (SOG) environments, grid workflow schedulers play a critical role in providing quality-of-service (QoS) satisfaction for various end users (EUs) with diverse QoS objectives and optimization requirements. The EU requirements are not only many and conflicting, but also involve constraints of various degrees—loose, moderate or tight. However, most of the existing scheduling approaches violate EU constraints in tight situations and suffer inferior QoS optimization results. In this paper, a constraints-aware multi-QoS workflow scheduling strategy is proposed based on particle swarm optimization (PSO) and a proposed look-ahead heuristic (LAPSO) to improve performance in such situations. The algorithm selects the best scheduling solutions based on the proposed constraint-handling strategy. It hybridises PSO with a novel look-ahead mechanism based on a min–max heuristic, which deterministically improves the quality of the best solutions. Extensive simulation experiments have been carried out to evaluate the performance of the proposed approach. The simulation results show that the LAPSO algorithm guarantees satisfaction (0% violation) of the EU constraints even in tight situations. It also outperforms the comparison algorithm, with about 30% increase, in terms of cumulative QoS satisfaction of optimization requirements. In addition, the new scheme significantly reduces the CPU time by about 75% compared to the benchmark algorithm. |
| first_indexed | 2024-03-06T09:38:46Z |
| format | Article |
| id | upm.eprints-60691 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T09:38:46Z |
| publishDate | 2017 |
| publisher | Springer |
| record_format | dspace |
| spelling | upm.eprints-606912019-11-05T06:50:42Z http://psasir.upm.edu.my/id/eprint/60691/ A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids Ambursa, Faruku Umar Latip, Rohaya Abdullah, Azizol K. Subramaniam, Shamala In service-orientated grids (SOG) environments, grid workflow schedulers play a critical role in providing quality-of-service (QoS) satisfaction for various end users (EUs) with diverse QoS objectives and optimization requirements. The EU requirements are not only many and conflicting, but also involve constraints of various degrees—loose, moderate or tight. However, most of the existing scheduling approaches violate EU constraints in tight situations and suffer inferior QoS optimization results. In this paper, a constraints-aware multi-QoS workflow scheduling strategy is proposed based on particle swarm optimization (PSO) and a proposed look-ahead heuristic (LAPSO) to improve performance in such situations. The algorithm selects the best scheduling solutions based on the proposed constraint-handling strategy. It hybridises PSO with a novel look-ahead mechanism based on a min–max heuristic, which deterministically improves the quality of the best solutions. Extensive simulation experiments have been carried out to evaluate the performance of the proposed approach. The simulation results show that the LAPSO algorithm guarantees satisfaction (0% violation) of the EU constraints even in tight situations. It also outperforms the comparison algorithm, with about 30% increase, in terms of cumulative QoS satisfaction of optimization requirements. In addition, the new scheme significantly reduces the CPU time by about 75% compared to the benchmark algorithm. Springer 2017-05 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/60691/1/A%20particle%20swarm%20optimization%20and%20min%E2%80%93max%C2%AD-based%20workflow%20scheduling%20algorithm%20with%20QoS%20satisfaction%20for%20service-%C2%ADoriented%20grids.pdf Ambursa, Faruku Umar and Latip, Rohaya and Abdullah, Azizol and K. Subramaniam, Shamala (2017) A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids. The Journal of Supercomputing, 73 (5). pp. 2018-2051. ISSN 0920-8542; ESSN: 1573-0484 10.1007/s11227-016-1901-x |
| spellingShingle | Ambursa, Faruku Umar Latip, Rohaya Abdullah, Azizol K. Subramaniam, Shamala A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids |
| title | A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids |
| title_full | A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids |
| title_fullStr | A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids |
| title_full_unstemmed | A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids |
| title_short | A particle swarm optimization and min-max-based workflow scheduling algorithm with QoS satisfaction for service-oriented grids |
| title_sort | particle swarm optimization and min max based workflow scheduling algorithm with qos satisfaction for service oriented grids |
| url | http://psasir.upm.edu.my/id/eprint/60691/1/A%20particle%20swarm%20optimization%20and%20min%E2%80%93max%C2%AD-based%20workflow%20scheduling%20algorithm%20with%20QoS%20satisfaction%20for%20service-%C2%ADoriented%20grids.pdf |
| work_keys_str_mv | AT ambursafarukuumar aparticleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT latiprohaya aparticleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT abdullahazizol aparticleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT ksubramaniamshamala aparticleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT ambursafarukuumar particleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT latiprohaya particleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT abdullahazizol particleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids AT ksubramaniamshamala particleswarmoptimizationandminmaxbasedworkflowschedulingalgorithmwithqossatisfactionforserviceorientedgrids |