Danlami Gabi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Danlami Gabi has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Abdul Samad Ismail
School of Computing, Universiti Teknologi Malaysia
7 shared publicationsAnazida Zainal
6 shared publicationsZalmiyah Zakaria
6 shared publications- Ajith Abraham
Bennett University
3 shared publications - Zalmiyah Zakaria
Universiti Teknologi Malaysia, Johor
3 shared publications - Abdul Samad Ismail
Department of Computer Science, School of Computing, Universiti Teknologi Malaysia, Johor, Malaysia
2 shared publications
Latest Publications
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 162299-162310
Enhanced Task Scheduling and Resource Allocation in Edge-Cloud Continuum Using Modified Flower Pollination Algorithm
The edge-cloud continuum integrates edge computing and cloud computing to optimize resource use and improve performance by bringing computation closer to data sources while leveraging vast cloud resources. Efficient resource allocation within this continuum is crucial for optimizing performance and minimizing delays. This paper proposes a novel approach to resource allocation using a modified Flower Pollination Algorithm (FPA). By incorporating dynamic switch probability, inertia weight for Levy flight balancing, and enhancing the initial solution using a chaotic map, the modified FPA enhances exploration and exploitation capabilities. Additionally, a network model is introduced to monitor network performance metrics, and a task dependency model ensures tasks are executed based on their dependencies. Experimental results demonstrate that the proposed approach significantly reduces delay and improves resource utilization compared to existing methods. This work provides a comprehensive framework for addressing the challenges.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 162299-162310
Open AccessEnhanced Task Scheduling and Resource Allocation in Edge-Cloud Continuum Using Modified Flower Pollination Algorithm
The edge-cloud continuum integrates edge computing and cloud computing to optimize resource use and improve performance by bringing computation closer to data sources while leveraging vast cloud resources. Efficient resource allocation within this continuum is crucial for optimizing performance and minimizing delays. This paper proposes a novel approach to resource allocation using a modified Flower Pollination Algorithm (FPA). By incorporating dynamic switch probability, inertia weight for Levy flight balancing, and enhancing the initial solution using a chaotic map, the modified FPA enhances exploration and exploitation capabilities. Additionally, a network model is introduced to monitor network performance metrics, and a task dependency model ensures tasks are executed based on their dependencies. Experimental results demonstrate that the proposed approach significantly reduces delay and improves resource utilization compared to existing methods. This work provides a comprehensive framework for addressing the challenges.
- Open Access
- 25 August 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (17) , 8516
Multi-Objective Hybrid Flower Pollination Resource Consolidation Scheme for Large Cloud Data Centres
Cloud Computing has rapidly emerged as a successful paradigm for providing Information and Communication Technology (ICT) infrastructure. Resource allocation is used to execute user applications in the form of requests for consolidated resources in order to minimize energy consumption and violation of the Service Level Agreement (SLA) for large-scale data centers resource utilization. The energy consumption is usually caused due to local entrapment and violation of SLA during resource assigning and execution. Several researchers have proposed solutions to reduce local entrapments and violations of SLA, to minimize the energy consumption of the entire data center. However, strategies employed in their solutions face entrapment in either local searches or at the global search level with a certain level of SLA violation. In this light, a Multi-Objective Hybrid Flower Pollination Resource Consolidation (MOH-FPRC) scheme for efficient and optimal resource consolidation of data center resources is put forward. The Local Neighborhood Search (LNS) algorithm has been employed for addressing entrapment at the local search level, while the prominent flower pollination algorithm is used to solve the problem of entrapment at the global search level. This, in turn, reduces the energy consumption of the data centers. In addition, clustering strategies have been introduced with a robust migration mechanism to minimize the violation of SLA while also satisfying minimum energy consumption. The simulation results using the MultiRecCloudSim simulator have shown that our proposed MOH-FPRC demonstrates an improved performance on the data center energy consumption, resource utilization, and SLA violation with a 20.5% decrease, 23.9% increase, and 13.5% reduction, respectively, as compared with the benchmarked algorithms. The proposed scheme has proven its efficiency in minimizing energy consumption while at the same time improving the data center resource allocation with minimum SLA violations.
- 25 August 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (17) , 8516
Open AccessMulti-Objective Hybrid Flower Pollination Resource Consolidation Scheme for Large Cloud Data Centres
Cloud Computing has rapidly emerged as a successful paradigm for providing Information and Communication Technology (ICT) infrastructure. Resource allocation is used to execute user applications in the form of requests for consolidated resources in order to minimize energy consumption and violation of the Service Level Agreement (SLA) for large-scale data centers resource utilization. The energy consumption is usually caused due to local entrapment and violation of SLA during resource assigning and execution. Several researchers have proposed solutions to reduce local entrapments and violations of SLA, to minimize the energy consumption of the entire data center. However, strategies employed in their solutions face entrapment in either local searches or at the global search level with a certain level of SLA violation. In this light, a Multi-Objective Hybrid Flower Pollination Resource Consolidation (MOH-FPRC) scheme for efficient and optimal resource consolidation of data center resources is put forward. The Local Neighborhood Search (LNS) algorithm has been employed for addressing entrapment at the local search level, while the prominent flower pollination algorithm is used to solve the problem of entrapment at the global search level. This, in turn, reduces the energy consumption of the data centers. In addition, clustering strategies have been introduced with a robust migration mechanism to minimize the violation of SLA while also satisfying minimum energy consumption. The simulation results using the MultiRecCloudSim simulator have shown that our proposed MOH-FPRC demonstrates an improved performance on the data center energy consumption, resource utilization, and SLA violation with a 20.5% decrease, 23.9% increase, and 13.5% reduction, respectively, as compared with the benchmarked algorithms. The proposed scheme has proven its efficiency in minimizing energy consumption while at the same time improving the data center resource allocation with minimum SLA violations.
- Open Access
- 21 April 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (16) , 14085-14105
Dynamic scheduling of heterogeneous resources across mobile edge-cloud continuum using fruit fly-based simulated annealing optimization scheme
Achieving sustainable profit advantage, cost reduction and resource utilization are always a bottleneck for resource providers, especially when trying to meet the computing needs of resource hungry applications in mobile edge-cloud (MEC) continuum. Recent research uses metaheuristic techniques to allocate resources to large-scale applications in MECs. However, some challenges attributed to the metaheuristic techniques include entrapment at the local optima caused by premature convergence and imbalance between the local and global searches. These may affect resource allocation in MECs if continually implemented. To address these concerns and ensure efficient resource allocation in MECs, we propose a fruit fly-based simulated annealing optimization scheme (FSAOS) to serve as a potential solution. In the proposed scheme, the simulated annealing is incorporated to balance between the global and local search and to overcome its premature convergence. We also introduce a trade-off factor to allow application owners to select the best service quality that will minimize their execution cost. Implementation of the FSAOS is carried out on EdgeCloudSim Simulator tool. Simulation results show that the FSAOS can schedule resources effectively based on tasks requirement by returning minimum makespan and execution costs, and achieve better resource utilization compared to the conventional fruit fly optimization algorithm and particle swarm optimization. To further unveil how efficient the FSAOSs, a statistical analysis based on 95% confidential interval is carried out. Numerical results show that FSAOS outperforms the benchmark schemes by achieving higher confidence level. This is an indication that the proposed FSAOS can provide efficient resource allocation in MECs while meeting customers’ aspirations as well as that of the resource providers.
- 21 April 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (16) , 14085-14105
Open AccessDynamic scheduling of heterogeneous resources across mobile edge-cloud continuum using fruit fly-based simulated annealing optimization scheme
Achieving sustainable profit advantage, cost reduction and resource utilization are always a bottleneck for resource providers, especially when trying to meet the computing needs of resource hungry applications in mobile edge-cloud (MEC) continuum. Recent research uses metaheuristic techniques to allocate resources to large-scale applications in MECs. However, some challenges attributed to the metaheuristic techniques include entrapment at the local optima caused by premature convergence and imbalance between the local and global searches. These may affect resource allocation in MECs if continually implemented. To address these concerns and ensure efficient resource allocation in MECs, we propose a fruit fly-based simulated annealing optimization scheme (FSAOS) to serve as a potential solution. In the proposed scheme, the simulated annealing is incorporated to balance between the global and local search and to overcome its premature convergence. We also introduce a trade-off factor to allow application owners to select the best service quality that will minimize their execution cost. Implementation of the FSAOS is carried out on EdgeCloudSim Simulator tool. Simulation results show that the FSAOS can schedule resources effectively based on tasks requirement by returning minimum makespan and execution costs, and achieve better resource utilization compared to the conventional fruit fly optimization algorithm and particle swarm optimization. To further unveil how efficient the FSAOSs, a statistical analysis based on 95% confidential interval is carried out. Numerical results show that FSAOS outperforms the benchmark schemes by achieving higher confidence level. This is an indication that the proposed FSAOS can provide efficient resource allocation in MECs while meeting customers’ aspirations as well as that of the resource providers.
- Open Access
- 17 March 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 32 (18) , 14817-14838
Cloud customers service selection scheme based on improved conventional cat swarm optimization
With growing demand on resources situated at the cloud datacenters, the need for customers’ resource selection techniques becomes paramount in dealing with the concerns of resource inefficiency. Techniques such as metaheuristics are promising than the heuristics, most especially when handling large scheduling request. However, addressing certain limitations attributed to the metaheuristic such as slow convergence speed and imbalance between its local and global search could enable it become even more promising for customers service selection. In this work, we propose a cloud customers service selection scheme called Dynamic Multi-Objective Orthogonal Taguchi-Cat (DMOOTC). In the proposed scheme, avoidance of local entrapment is achieved by not only increasing its convergence speed, but balancing between its local and global search through the incorporation of Taguchi orthogonal approach. To enable the scheme to meet customers’ expectations, Pareto dominant strategy is incorporated providing better options for customers in selecting their service preferences. The implementation of our proposed scheme with that of the benchmarked schemes is carried out on CloudSim simulator tool. With two scheduling scenarios under consideration, simulation results show for the first scenario, our proposed DMOOTC scheme provides better service choices with minimum total execution time and cost (with up to 42.87%, 35.47%, 25.49% and 38.62%, 35.32%, 25.56% reduction) and achieves 21.64%, 18.97% and 13.19% improvement for the second scenario in terms of execution time compared to that of the benchmarked schemes. Similarly, statistical results based on 95% confidence interval for the whole scheduling scheme also show that our proposed scheme can be much more reliable than the benchmarked scheme. This is an indication that the proposed DMOOTC can meet customers’ expectations while providing guaranteed performance of the whole cloud computing environment.
- 17 March 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 32 (18) , 14817-14838
Open AccessCloud customers service selection scheme based on improved conventional cat swarm optimization
With growing demand on resources situated at the cloud datacenters, the need for customers’ resource selection techniques becomes paramount in dealing with the concerns of resource inefficiency. Techniques such as metaheuristics are promising than the heuristics, most especially when handling large scheduling request. However, addressing certain limitations attributed to the metaheuristic such as slow convergence speed and imbalance between its local and global search could enable it become even more promising for customers service selection. In this work, we propose a cloud customers service selection scheme called Dynamic Multi-Objective Orthogonal Taguchi-Cat (DMOOTC). In the proposed scheme, avoidance of local entrapment is achieved by not only increasing its convergence speed, but balancing between its local and global search through the incorporation of Taguchi orthogonal approach. To enable the scheme to meet customers’ expectations, Pareto dominant strategy is incorporated providing better options for customers in selecting their service preferences. The implementation of our proposed scheme with that of the benchmarked schemes is carried out on CloudSim simulator tool. With two scheduling scenarios under consideration, simulation results show for the first scenario, our proposed DMOOTC scheme provides better service choices with minimum total execution time and cost (with up to 42.87%, 35.47%, 25.49% and 38.62%, 35.32%, 25.56% reduction) and achieves 21.64%, 18.97% and 13.19% improvement for the second scenario in terms of execution time compared to that of the benchmarked schemes. Similarly, statistical results based on 95% confidence interval for the whole scheduling scheme also show that our proposed scheme can be much more reliable than the benchmarked scheme. This is an indication that the proposed DMOOTC can meet customers’ expectations while providing guaranteed performance of the whole cloud computing environment.
- Open Access
- 22 June 2019
- Published by Association for Computing Machinery (ACM)
- p. 16-20
Minimized Makespan Based Improved Cat Swarm Optimization for Efficient Task Scheduling in Cloud Datacenter
- 22 June 2019
- Published by Association for Computing Machinery (ACM)
- p. 16-20
Open AccessMinimized Makespan Based Improved Cat Swarm Optimization for Efficient Task Scheduling in Cloud Datacenter
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Intelligent Systems Technologies and Applications
- Vol. 18 (5) , 448
Quality of service task scheduling algorithm for time-cost trade off scheduling problem in cloud computing environment
In cloud computing environment, managing trade-offs between time and cost when executing large-scale tasks to guarantee customers minimum running time and cost of computation is not always feasible. Metaheuristics scheduling algorithms are considered as potential solutions but however, exhibit local trapping and imbalance between its global and local search. In this study, a multi-objective task scheduling model is first developed upon which a dynamic multi-objective orthogonal Taguchi-based cat swarm optimisation (dMOOTC) task scheduling algorithm is proposed to solve the model. In the developed dMOOTC algorithm, the Taguchi orthogonal approach and Pareto-optimisation strategy are used to reduced local trapping and balances between the global and local search which possibly increases its speed of convergence. Thirty independent simulation runs were conducted on CloudSim simulator tool. The results of the simulation showed that the dMOOTC scheduling algorithm showed a remarkable performance in minimising the time and cost compared to the benchmarked algorithms.
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Intelligent Systems Technologies and Applications
- Vol. 18 (5) , 448
Quality of service task scheduling algorithm for time-cost trade off scheduling problem in cloud computing environment
In cloud computing environment, managing trade-offs between time and cost when executing large-scale tasks to guarantee customers minimum running time and cost of computation is not always feasible. Metaheuristics scheduling algorithms are considered as potential solutions but however, exhibit local trapping and imbalance between its global and local search. In this study, a multi-objective task scheduling model is first developed upon which a dynamic multi-objective orthogonal Taguchi-based cat swarm optimisation (dMOOTC) task scheduling algorithm is proposed to solve the model. In the developed dMOOTC algorithm, the Taguchi orthogonal approach and Pareto-optimisation strategy are used to reduced local trapping and balances between the global and local search which possibly increases its speed of convergence. Thirty independent simulation runs were conducted on CloudSim simulator tool. The results of the simulation showed that the dMOOTC scheduling algorithm showed a remarkable performance in minimising the time and cost compared to the benchmarked algorithms.
- Open Access
- 1 June 2017
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 7 (3) , 1489
Solving Task Scheduling Problem in Cloud Computing Environment Using Orthogonal Taguchi-Cat Algorithm
In cloud computing datacenter, task execution delay is no longer accidental. In recent times, a number of artificial intelligence scheduling techniques are proposed and applied to reduce task execution delay. In this study, we proposed an algorithm called Orthogonal Taguchi Based-Cat Swarm Optimization (OTB-CSO) to minimize total task execution time. In our proposed algorithm Taguchi Orthogonal approach was incorporated at CSO tracing mode for best task mapping on VMs with minimum execution time. The proposed algorithm was implemented on CloudSim tool and evaluated based on makespan metric. Experimental results showed for 20VMs used, proposed OTB-CSO was able to minimize makespan of total tasks scheduled across VMs with 42.86%, 34.57% and 2.58% improvement over Minimum and Maximum Job First (Min-Max), Particle Swarm Optimization with Linear Descending Inertia Weight (PSO-LDIW) and Hybrid Particle Swarm Optimization with Simulated Annealing (HPSO-SA) algorithms. Results obtained showed OTB-CSO is effective to optimize task scheduling and improve overall cloud computing performance with better system utilization.
- 1 June 2017
- Published by Institute of Advanced Engineering and Science in International Journal of Electrical and Computer Engineering (IJECE)
- Vol. 7 (3) , 1489
Open AccessSolving Task Scheduling Problem in Cloud Computing Environment Using Orthogonal Taguchi-Cat Algorithm
In cloud computing datacenter, task execution delay is no longer accidental. In recent times, a number of artificial intelligence scheduling techniques are proposed and applied to reduce task execution delay. In this study, we proposed an algorithm called Orthogonal Taguchi Based-Cat Swarm Optimization (OTB-CSO) to minimize total task execution time. In our proposed algorithm Taguchi Orthogonal approach was incorporated at CSO tracing mode for best task mapping on VMs with minimum execution time. The proposed algorithm was implemented on CloudSim tool and evaluated based on makespan metric. Experimental results showed for 20VMs used, proposed OTB-CSO was able to minimize makespan of total tasks scheduled across VMs with 42.86%, 34.57% and 2.58% improvement over Minimum and Maximum Job First (Min-Max), Particle Swarm Optimization with Linear Descending Inertia Weight (PSO-LDIW) and Hybrid Particle Swarm Optimization with Simulated Annealing (HPSO-SA) algorithms. Results obtained showed OTB-CSO is effective to optimize task scheduling and improve overall cloud computing performance with better system utilization.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Scalability-Aware scheduling optimization algorithm for multi-objective cloud task scheduling problem
This paper put forward a novel scalability-aware scheduling optimization algorithm called Cloud Scalable Multi-Objective Cat Swarm Optimization Based Simulated Annealing (CSM-CSOSA) for solving task scheduling optimization problem in cloud computing environment. The novelty of the algorithm is based on the improvement of its local search procedure using improved simulated annealing optimization approach. The goal is to provide a solution that can adapt the dynamic changing cloud tasks and resources while minimizing the amount of time and cost of processing task in order to meet cloud consumers' QoS expectations. In order to determine the performance of our proposed task scheduling algorithm. A task scheduling model based on execution time and execution cost objectives is presented. Implementation of the algorithm is carried out using CloudSim tool and evaluated based on metrics of execution time, execution cost, and scalability. Comparison with similar task scheduling algorithms like Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Scheduling Based on Ant Colony Optimization (MOSACO) and Multi-Objective Particle Swarm Optimization (MOPSO) is carried out. The results obtained show our proposed algorithm has achieved a remarkable performance in term of minimizing task execution time, execution cost and returned better scalability performance. The proposed algorithm is therefore recommended for large task scheduling for cloud computing environment.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Scalability-Aware scheduling optimization algorithm for multi-objective cloud task scheduling problem
This paper put forward a novel scalability-aware scheduling optimization algorithm called Cloud Scalable Multi-Objective Cat Swarm Optimization Based Simulated Annealing (CSM-CSOSA) for solving task scheduling optimization problem in cloud computing environment. The novelty of the algorithm is based on the improvement of its local search procedure using improved simulated annealing optimization approach. The goal is to provide a solution that can adapt the dynamic changing cloud tasks and resources while minimizing the amount of time and cost of processing task in order to meet cloud consumers' QoS expectations. In order to determine the performance of our proposed task scheduling algorithm. A task scheduling model based on execution time and execution cost objectives is presented. Implementation of the algorithm is carried out using CloudSim tool and evaluated based on metrics of execution time, execution cost, and scalability. Comparison with similar task scheduling algorithms like Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Scheduling Based on Ant Colony Optimization (MOSACO) and Multi-Objective Particle Swarm Optimization (MOPSO) is carried out. The results obtained show our proposed algorithm has achieved a remarkable performance in term of minimizing task execution time, execution cost and returned better scalability performance. The proposed algorithm is therefore recommended for large task scheduling for cloud computing environment.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1007-1012
Cloud scalable multi-objective task scheduling algorithm for cloud computing using cat swarm optimization and simulated annealing
In cloud computing, customers-desired Quality of Service (QoS) expectations are quite superficial due to lack of scalable task scheduling solutions that can adjust to long-time changes. Researchers in the literature have put forward several task scheduling algorithms to account for customers' QoS expectations. Unfortunately, most of these algorithms need improvements to ensure the provisioning of better consumers' QoS expectation. In this study, a Multi-Objective QoS model to address customers' expectation based on execution time and execution cost criteria is presented. A Cloud Scalable Multi-Objective Cat Swarm Optimization (CSO) based Simulated Annealing (SA) (CSM-CSOSA) algorithm is then proposed to solve the model. In this method, the Taguchi Orthogonal approach is used to enhanced the SA and incorporated into the local search of the proposed algorithm for enhancing it exploration capability. Implementation of the algorithm is carried out on CloudSim tool and evaluated using one dataset (Normal distributed) and one Parallel Workload (High-Performance Computing Center North(HPC2N)). Quantitative analysis of the algorithm performance is taken based on metrics of execution time, execution cost, QoS and percentage improvement. Result obtained is compared with that of Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Ant Colony (MOSACO) and Multi-Objective Particle Swarm Optimization (MOPSO), where proposed method is able to return substantial performance with improved QoS.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1007-1012
Cloud scalable multi-objective task scheduling algorithm for cloud computing using cat swarm optimization and simulated annealing
In cloud computing, customers-desired Quality of Service (QoS) expectations are quite superficial due to lack of scalable task scheduling solutions that can adjust to long-time changes. Researchers in the literature have put forward several task scheduling algorithms to account for customers' QoS expectations. Unfortunately, most of these algorithms need improvements to ensure the provisioning of better consumers' QoS expectation. In this study, a Multi-Objective QoS model to address customers' expectation based on execution time and execution cost criteria is presented. A Cloud Scalable Multi-Objective Cat Swarm Optimization (CSO) based Simulated Annealing (SA) (CSM-CSOSA) algorithm is then proposed to solve the model. In this method, the Taguchi Orthogonal approach is used to enhanced the SA and incorporated into the local search of the proposed algorithm for enhancing it exploration capability. Implementation of the algorithm is carried out on CloudSim tool and evaluated using one dataset (Normal distributed) and one Parallel Workload (High-Performance Computing Center North(HPC2N)). Quantitative analysis of the algorithm performance is taken based on metrics of execution time, execution cost, QoS and percentage improvement. Result obtained is compared with that of Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Ant Colony (MOSACO) and Multi-Objective Particle Swarm Optimization (MOPSO), where proposed method is able to return substantial performance with improved QoS.