B. Gomathi¹, S. T. Suganthi^2,*, Karthikeyan Krishnasamy³, J. Bhuvana⁴

CMC-Computers, Materials & Continua, Vol.69, No.3, pp. 3693-3710, 2021, DOI:10.32604/cmc.2021.018159 - 24 August 2021

Abstract Enterprises have extensively taken on cloud computing environment since it provides on-demand virtualized cloud application resources. The scheduling of the cloud tasks is a well-recognized NP-hard problem. The Task scheduling problem is convoluted while convincing different objectives, which are dispute in nature. In this paper, Multi-Objective Improved Monarch Butterfly Optimization (MOIMBO) algorithm is applied to solve multi-objective task scheduling problems in the cloud in preparation for Pareto optimal solutions. Three different dispute objectives, such as makespan, reliability, and resource utilization, are deliberated for task scheduling problems.The Epsilon-fuzzy dominance sort method is utilized in the multi-objective More >

Zhihong Liu¹, Shuo Zhang^2,*, Yaping Liu², Xiangke Wang¹, Dong Yin¹

CMES-Computer Modeling in Engineering & Sciences, Vol.126, No.2, pp. 771-790, 2021, DOI:10.32604/cmes.2021.013244 - 21 January 2021

Abstract MapReduce is a widely used programming model for large-scale data processing. However, it still suffers from the skew problem, which refers to the case in which load is imbalanced among tasks. This problem can cause a small number of tasks to consume much more time than other tasks, thereby prolonging the total job completion time. Existing solutions to this problem commonly predict the loads of tasks and then rebalance the load among them. However, solutions of this kind often incur high performance overhead due to the load prediction and rebalancing. Moreover, existing solutions target the… More >

Amit Chhabra^{1, *}, Gurvinder Singh², Karanjeet Singh Kahlon²

CMC-Computers, Materials & Continua, Vol.64, No.2, pp. 813-834, 2020, DOI:10.32604/cmc.2020.010934 - 10 June 2020

Abstract Cloud computing infrastructure has been evolving as a cost-effective platform for providing computational resources in the form of high-performance computing as a service (HPCaaS) to users for executing HPC applications. However, the broader use of the Cloud services, the rapid increase in the size, and the capacity of Cloud data centers bring a remarkable rise in energy consumption leading to a significant rise in the system provider expenses and carbon emissions in the environment. Besides this, users have become more demanding in terms of Quality-of-service (QoS) expectations in terms of execution time, budget cost, utilization,… More >

Vaibhav Pandey^∗, Poonam Saini^†

Computer Systems Science and Engineering, Vol.34, No.6, pp. 357-376, 2019, DOI:10.32604/csse.2019.34.357

Abstract The cloud computing paradigm facilitates a finite pool of on-demand virtualized resources on a pay-per-use basis. For large-scale heterogeneous distributed systems like a cloud, scheduling is an essential component of resource management at the application layer as well as at the virtualization layer in order to deliver the optimal Quality of Services (QoS). The cloud scheduling, in general, is an NP-hard problem due to large solution space, thus, it is difficult to find an optimal solution within a reasonable time. In application layer scheduling, the tasks are mapped to logical resources (i.e., virtual machines), aiming… More >

Sardar Khaliq uz Zaman¹, Tahir Maqsood¹, Mazhar Ali¹, Kashif Bilal¹, Sajjad A. Madani¹, Atta ur Rehman Khan^2,*

Computer Systems Science and Engineering, Vol.34, No.2, pp. 79-90, 2019, DOI:10.32604/csse.2019.34.079

Abstract Optimal task allocation in Large-Scale Computing Systems (LSCSs) that endeavors to balance the load across limited computing resources is considered an NP-hard problem. MinMin algorithm is one of the most widely used heuristic for scheduling tasks on limited computing resources. The MinMin minimizes makespan compared to other algorithms, such as Heterogeneous Earliest Finish Time (HEFT), duplication based algorithms, and clustering algorithms. However, MinMin results in unbalanced utilization of resources especially when majority of tasks have lower computational requirements. In this work we consider a computational model where each machine has certain bounded capacity to execute… More >

Morteza Okhovvat, Mohammad Reza Kangavari^*

Computer Systems Science and Engineering, Vol.34, No.1, pp. 13-21, 2019, DOI:10.32604/csse.2019.34.013

Abstract Existing works on scheduling in Wireless Sensor Actor Networks (WSANs) are mostly concerned with energy savings and ignore time constraints and thus increase the make-span of the network. Moreover, these algorithms usually do not consider balance of workloads on the actor nodes and hence, sometimes some of the actors are busy when some others are idle. These problem causes the actors are not utilized properly and the actors’ lifetime is reduced. In this paper we take both time awareness and balance of workloads on the actor in WSANs into account and propose a convex optimization… More >

Tongmao Ma^1,2, Shanchen Pang¹, Weiguang Zhang¹, Shaohua Hao¹

Intelligent Automation & Soft Computing, Vol.25, No.3, pp. 605-613, 2019, DOI:10.31209/2019.100000115

Abstract In cloud computing, task scheduling is a challenging problem in cloud data center, and there are many different kinds of task scheduling strategies. A good scheduling strategy can bring good effectiveness, where plenty of parameters should be regulated to achieve acceptable performance of cloud computing platform. In this work, combined elitist strategy, three parameters values oriented genetic algorithms are proposed. Specifically, a model built by Generalized Stochastic Petri Nets (GSPN) is introduced to describe the process of scheduling in cloud datacenter, and then the workflow of the algorithms is showed. After that, the effectiveness of More >