Shafi’i Muhammad Abdulhamid

Symbiotic Organism Search optimization based task scheduling in cloud computing environment

Efficient task scheduling is one of the major steps for effectively harnessing the potential of cloud computing. In cloud computing, a number of tasks may need to be scheduled on different virtual machines in order to minimize makespan and increase system utilization. Task scheduling problem is NP-complete, hence finding an exact solution is intractable especially for large task sizes. This paper presents a Discrete Symbiotic Organism Search (DSOS) algorithm for optimal scheduling of tasks on cloud resources. Symbiotic Organism Search (SOS) is a newly developed metaheuristic optimization technique for solving numerical optimization problems. SOS mimics the symbiotic relationships (mutualism, commensalism, and parasitism) exhibited by organisms in an ecosystem. Simulation results revealed that DSOS outperforms Particle Swarm Optimization (PSO) which is one of the most popular heuristic optimization techniques used for task scheduling problems. DSOS converges faster when the search gets larger which makes it suitable for large-scale scheduling problems. Analysis of the proposed method conducted using t -test showed that DSOS performance is significantly better than that of PSO particularly for large search space. Discrete Symbiotic Organism Search algorithm for task scheduling is proposed.The proposed algorithm has better ability to exploit best solution regions than PSO.The proposed method has global ability in terms of exploring optimal solution points.The proposed algorithm performs significantly better than PSO for large search spaces.

Resource scheduling for infrastructure as a service (IaaS) in cloud computing

Resource scheduling assigns the precise and accurate task to CPU, network, and storage. The aim behind this is the extreme usage of resources. However, well organized scheduling is needed for both cloud providers and cloud users. This paper is a chronological study of recent issues of resource scheduling in IaaS cloud computing environment. In our study, we investigate resource scheduling schemes and algorithms used by different researchers and categorize these approaches on the basis of problems addressed, schemes and the parameters used in evaluating different approaches. Based on various studies considered in this survey, we perceive that different schemes and algorithms did not consider some essential parameters and enhancement is requisite to improve the performance of the existing schemes. Furthermore, this study will trigger new and innovative methods of handling the problems of resource scheduling in the cloud and will help researchers in understanding the existing methodologies for the future adaptation and enhancements. Presents a review of resource scheduling techniques in IaaS cloud.Classify techniques on the basis of problems addressed and schemes used.Analyzes the parameters used to evaluate techniques used in several studies.Suggests future research areas in cloud computing, regards to resource scheduling.

Recent advancements in resource allocation techniques for cloud computing environment: a systematic review

There are two actors in cloud computing environment cloud providers and cloud users. On one hand cloud providers hold enormous computing resources in the cloud large data centers that rent the resources out to the cloud users on a pay-per-use basis to maximize the profit by achieving high resource utilization. On the other hand cloud users who have applications with loads variation and lease the resources from the providers they run their applications within minimum expenses. One of the most critical issues of cloud computing is resource management in infrastructure as a service (IaaS). Resource management related problems include resource allocation, resource adaptation, resource brokering, resource discovery, resource mapping, resource modeling, resource provisioning and resource scheduling. In this review we investigated resource allocation schemes and algorithms used by different researchers and categorized these approaches according to the problems addressed schemes and the parameters used in evaluating different approaches. Based on different studies considered, it is observed that different schemes did not consider some important parameters and enhancement is required to improve the performance of the existing schemes. This review contributes to the existing body of research and will help the researchers to gain more insight into resource allocation techniques for IaaS in cloud computing in the future.

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques.

A survey of league championship algorithm: Prospects and challenges

The League Championship Algorithm (LCA) is sport-inspired optimization algorithm that was introduced by Ali Husseinzadeh Kashan in the year 2009. It has since drawn enormous interest among the researchers because of its potential efficiency in solving many optimization problems and real-world applications. The LCA has also shown great potentials in solving non-deterministic polynomial time (NP-complete) problems. This survey presents a brief synopsis of the LCA literatures in peer-reviewed journals, conferences and book chapters. These research articles are then categorized according to indexing in the major academic databases (Web of Science, Scopus, IEEE Xplore and the Google Scholar). The analysis was also done to explore the prospects and the challenges of the algorithm and its acceptability among researchers. This systematic categorization can be used as a basis for future studies.

Grid-based search technique for massive academic publications

The numerical size of academic publications that are being published in recent years had grown rapidly. Accessing and searching massive academic publications that are distributed over several locations need large amount of computing resources to increase the system performance. Therefore, many grid-based search techniques were proposed to provide flexible methods for searching the distributed extensive data. This paper proposes search technique that is capable of searching the extensive publications by utilizing grid computing technology. The search technique is implemented as interconnected grid services to offer a mechanism to access different data locations. The experimental result shows that the grid-based search technique has enhanced the performance of the search.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.

A Review on Mobile SMS Spam Filtering Techniques

Under short messaging service (SMS) spam is understood the unsolicited or undesired messages received on mobile phones. These SMS spams constitute a veritable nuisance to the mobile subscribers. This marketing practice also worries service providers in view of the fact that it upsets their clients or even causes them lose subscribers. By way of mitigating this practice, researchers have proposed several solutions for the detection and filtering of SMS spams. In this paper, we present a review of the currently available methods, challenges, and future research directions on spam detection techniques, filtering, and mitigation of mobile SMS spams. The existing research literature is critically reviewed and analyzed. The most popular techniques for SMS spam detection, filtering, and mitigation are compared, including the used data sets, their findings, and limitations, and the future research directions are discussed. This review is designed to assist expert researchers to identify open areas that need further improvement.

A checkpointed league championship algorithm-based cloud scheduling scheme with secure fault tolerance responsiveness

In its simplest structure, cloud computing technology is a massive collection of connected servers residing in a datacenter and continuously changing to provide services to users on-demand through a front-end interface. The failure of task during execution is no more an accident but a frequent attribute of scheduling systems in a large-scale distributed environment. Recently, some computational intelligence techniques have been mostly utilized to decipher the problems of scheduling in the cloud environment, but only a few emphasis on the issue of fault tolerance. This research paper puts forward a Checkpointed League Championship Algorithm (CPLCA) scheduling scheme to be used in the cloud computing system. It is a fault-tolerance aware task scheduling mechanisms using the checkpointing strategy in addition to tasks migration against unexpected independent task execution failure. The simulation results show that, the proposed CPLCA scheme produces an improvement of 41%, 33% and 23% as compared with the Ant Colony Optimization (ACO), Genetic Algorithm (GA) and the basic league championship algorithm (LCA) respectively as parametrically measured using the total average makespan of the schemes. Considering the total average response time of the schemes, the CPLCA scheme produces an improvement of 54%, 57% and 30% as compared with ACO, GA and LCA respectively. It also turns out significant failure decrease in jobs execution as measured in terms of failure metrics and performance improvement rate. From the results obtained, CPLCA provides an improvement in both tasks scheduling performance and failure awareness that is more appropriate for scheduling in the cloud computing model.

Hybrid gradient descent cuckoo search (HGDCS) algorithm for resource scheduling in IaaS cloud computing environment

Resource scheduling is a procedure for the distribution of resources over time to perform a required task and a decision making process in cloud computing. Optimal resource scheduling is a great challenge and considered to be an NP-hard problem due to the fluctuating demand of cloud users and dynamic nature of resources. In this paper, we formulate a new hybrid gradient descent cuckoo search (HGDCS) algorithm based on gradient descent (GD) approach and cuckoo search (CS) algorithm for optimizing and resolving the problems related to resource scheduling in Infrastructure as a Service (IaaS) cloud computing. This work compares the makespan, throughput, load balancing and performance improvement rate of existing meta-heuristic algorithms with proposed HGDCS algorithm applicable for cloud computing. In comparison with existing meta-heuristic algorithms, proposed HGDCS algorithm performs well for almost in both cases (Case-I and Case-II) with all selected datasets and workload archives. HGDCS algorithm is comparatively and statistically more effective than ACO, ABC, GA, LCA, PSO, SA and original CS algorithms in term of problem solving ability in accordance with results obtained from simulation and statistical analysis.