Muhammad Shafie Abd Latiff

Muhammad Shafie Abd Latiff

Auto-generated profile, based on publicly available information

Muhammad Shafie Abd Latiff

Faculty of Computing, Universiti Teknologi Malaysia, Skudai, Johor, Malaysia

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 March 2020 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
NRNadim Rana
Nadim Rana
MLMuhammad Shafie Abd Latiff
Muhammad Shafie Abd Latiff
SAShafi'i Muhammad Abdulhamid
Shafi'i Muhammad Abdulhamid
Haruna ChiromaHaruna Chiroma
Haruna Chiroma

1 June 2016 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
SMSyed Hamid Hussain Madni
Syed Hamid Hussain Madni
MLMuhammad Shafie Abd Latiff
Muhammad Shafie Abd Latiff
YCYahaya Coulibaly
Yahaya Coulibaly
SAShafi'i Muhammad Abdulhamid
Shafi'i Muhammad Abdulhamid

3 May 2017 in PLOS ONE
Verified
Journal Article
Open access
PDF file
SMSyed Hamid Hussain Madni
Syed Hamid Hussain Madni
MLMuhammad Shafie Abd Latiff
Muhammad Shafie Abd Latiff
MAMohammed Abdullahi
Mohammed Abdullahi
SAShafi'i Muhammad Abdulhamid
Shafi'i Muhammad Abdulhamid
MUMohammed Joda Usman
Mohammed Joda Usman
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.

16 July 2016 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
SAShafi'i Muhammad Abdulhamid
Shafi'i Muhammad Abdulhamid
MLMuhammad Shafie Abd Latiff
Muhammad Shafie Abd Latiff
SMSyed Hamid Hussain Madni
Syed Hamid Hussain Madni
MAMohammed Abdullahi
Mohammed Abdullahi

6 July 2016 in PLOS ONE
Verified
Journal Article
Open access
PDF file
SAShafi'i Muhammad Abdulhamid
Shafi'i Muhammad Abdulhamid
MLMuhammad Shafie Abd Latiff
Muhammad Shafie Abd Latiff
GAGaddafi Abdul-Salaam
Gaddafi Abdul-Salaam
SMSyed Hamid Hussain Madni
Syed Hamid Hussain Madni
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.

16 January 2016 in Indian Journal of Science and Technology
Verified
Journal Article
Open access
PDF file
SMSyed Hamid Hussain Madni
Syed Hamid Hussain Madni
MLMuhammad Shafie Abd Latiff
Muhammad Shafie Abd Latiff
YCYahaya Coulibaly
Yahaya Coulibaly
SAShafi'i Muhammad Abdulhamid
Shafi'i Muhammad Abdulhamid
An Appraisal of Meta-Heuristic Resource Allocation Techniques for IaaS Cloud