A Novel Resource Optimization Algorithm Based on Clustering and Improved Differential Evolution Strategy Under a Cloud Environment

Author(s):  
Zhou Zhou ◽  
Fangmin Li ◽  
Shuiqiao Yang

Resource optimization algorithm based on clustering and improved differential evolution strategy, as a new global optimized algorithm, has wide applications in language translation, language processing, document understanding, cloud computing, and edge computing due to high efficiency. With the development of deep learning technology and the rise of big data, the resource optimization algorithm encounters a series of challenges, such as the workload imbalance and low resource utilization. To address the preceding problems, this study proposes a novel resource optimization algorithm based on clustering and an improved differential evolution strategy (Multi-objective Task Scheduling Strategy (MTSS)). Three indexes, namely task completion time, execution cost, and workload, of virtual machines are selected and used to build the fitness function of the MTSS algorithm. At the same time, the preprocessing state is set up to cluster according to the resource and task characteristics to reduce the magnitude of their matching scale. Moreover, to solve the workload imbalance among different resource sets, local resource tasks are reallocated using the Q-value method in the MTSS strategy to achieve workload balance of global resources and improve the resource utilization rate. Experiments are carried out to evaluate the effectiveness of the proposed algorithm. Results show that the proposed algorithm outperforms other algorithms in terms of task completion time, execution cost, and workload balancing.


Author(s):  
V. Anand ◽  
K. Anuradha

In networks with lot of computation, load balancing gains increasing significance. To offer various resources, services and applications, the ultimate aim is to facilitate the sharing of services and resources on the network over the Internet. A key issue to be focused and addressed in networks with large amount of computation is load balancing. Load is the number of tasks‘t’ performed by a computation system. The load can be categorized as network load and CPU load. For an efficient load balancing strategy, the process of assigning the load between the nodes should enhance the resource utilization and minimize the computation time. This can be accomplished by a uniform distribution of load of to all the nodes. A Load balancing method should guarantee that, each node in a network performs almost equal amount of work pertinent to their capacity and availability of resources. Relying on task subtraction, this work has presented a pioneering algorithm termed as E-TS (Efficient-Task Subtraction). This algorithm has selected appropriate nodes for each task. The proposed algorithm has improved the utilization of computing resources and has preserved the neutrality in assigning the load to the nodes in the network.



2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Hongli Zhang ◽  
Panpan Li ◽  
Zhigang Zhou

The serious issue of energy consumption for high performance computing systems has attracted much attention. Performance and energy-saving have become important measures of a computing system. In the cloud computing environment, the systems usually allocate various resources (such as CPU, Memory, Storage, etc.) on multiple virtual machines (VMs) for executing tasks. Therefore, the problem of resource allocation for running VMs should have significant influence on both system performance and energy consumption. For different processor utilizations assigned to the VM, there exists the tradeoff between energy consumption and task completion time when a given task is executed by the VMs. Moreover, the hardware failure, software failure and restoration characteristics also have obvious influences on overall performance and energy. In this paper, a correlated model is built to analyze both performance and energy in the VM execution environment given the reliability restriction, and an optimization model is presented to derive the most effective solution of processor utilization for the VM. Then, the tradeoff between energy-saving and task completion time is studied and balanced when the VMs execute given tasks. Numerical examples are illustrated to build the performance-energy correlated model and evaluate the expected values of task completion time and consumed energy.





Author(s):  
Auður Anna Jónsdóttir ◽  
Ziho Kang ◽  
Tianchen Sun ◽  
Saptarshi Mandal ◽  
Ji-Eun Kim

Objective The goal of this study is to model the effect of language use and time pressure on English as a first language (EFL) and English as a second language (ESL) students by measuring their eye movements in an on-screen, self-directed learning environment. Background Online learning is becoming integrated into learners’ daily lives due to the flexibility in scheduling and location that it offers. However, in many cases, the online learners often have no interaction with one another or their instructors, making it difficult to determine how the learners are reading the materials and whether they are learning effectively. Furthermore, online learning may pose challenges to those who face language barriers or are under time pressure. Method The effects of two factors, language use (EFL vs. ESL) and time constraints (high vs. low time pressure), were investigated during the presentation of online materials. The effects were analyzed based on eye movement measures (eye fixation rate—the total number of eye fixations divided by the task duration and gaze entropy) and behavioral measures (correct rate and task completion time). Results The results show that the ESL students had higher eye fixation rates and longer task completion times than the EFL students. Moreover, high time pressure resulted in high fixation rates, short task completion time, low correct rates, and high gaze entropy. Conclusion and Application The results suggest the possibility of using unobtrusive eye movement measures to develop ways to better assist those who struggle with learning in the online environment.



Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1774
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen ◽  
Chia-Jui Hung

Recently, with the increase in network bandwidth, various cloud computing applications have become popular. A large number of network data packets will be generated in such a network. However, most existing network architectures cannot effectively handle big data, thereby necessitating an efficient mechanism to reduce task completion time when large amounts of data are processed in data center networks. Unfortunately, achieving the minimum task completion time in the Hadoop system is an NP-complete problem. Although many studies have proposed schemes for improving network performance, they have shortcomings that degrade their performance. For this reason, in this study, we propose a centralized solution, called the bandwidth-aware rescheduling (BARE) mechanism for software-defined network (SDN)-based data center networks. BARE improves network performance by employing a prefetching mechanism and a centralized network monitor to collect global information, sorting out the locality data process, splitting tasks, and executing a rescheduling mechanism with a scheduler to reduce task completion time. Finally, we used simulations to demonstrate our scheme’s effectiveness. Simulation results show that our scheme outperforms other existing schemes in terms of task completion time and the ratio of data locality.



Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 395
Author(s):  
Chien-Hsiung Chen ◽  
Miao Huang

This study investigated the impacts of different notification modalities used in low and high ambient sound environments for mobile phone interaction. Three different notification modalities—Shaking Visual, Shaking Visual + Vibration, and Vibration—were designed and experimentally tested by asking users to conduct a maze task. A total of 72 participants were invited to take part in the experiment through the convenience sampling method. The generated results indicated that (1) the notification modality affects participants’ task completion time, (2) the error rate pertinent to the number of notifications is positively related to the participants’ task completion time, and (3) the ambient sound level and notification modalities impact the overall experience of the participants. The main contributions of this study are twofold. First, it verifies that the multi-dimensional feature of a Shaking Visual + Vibration synesthesia notification design is implementable. Second, this study demonstrated that the synesthesia notification could be feasible for mobile notification, and it was more perceptible by the users.



2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Fanghai Gong

In recent years, cloud workflow task scheduling has always been an important research topic in the business world. Cloud workflow task scheduling means that the workflow tasks submitted by users are allocated to appropriate computing resources for execution, and the corresponding fees are paid in real time according to the usage of resources. For most ordinary users, they are mainly concerned with the two service quality indicators of workflow task completion time and execution cost. Therefore, how cloud service providers design a scheduling algorithm to optimize task completion time and cost is a very important issue. This paper proposes research on workflow scheduling based on mobile cloud computing machine learning, and this paper conducts research by using literature research methods, experimental analysis methods, and other methods. This article has deeply studied mobile cloud computing, machine learning, task scheduling, and other related theories, and a workflow task scheduling system model was established based on mobile cloud computing machine learning from different algorithms used in processing task completion time, task service costs, task scheduling, and resource usage The situation and the influence of different tasks on the experimental results are analyzed in many aspects. The algorithm in this paper speeds up the scheduling time by about 7% under a different number of tasks and reduces the scheduling cost by about 2% compared with other algorithms. The algorithm in this paper has been obviously optimized in time scheduling and task scheduling.



Sign in / Sign up

Export Citation Format

Share Document