scholarly journals List Scheduling Algorithm Based on Virtual Scheduling Length Table in Heterogeneous Computing System

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Naqin Zhou ◽  
Xiaowen Liao ◽  
Fufang Li ◽  
Yuanyong Feng ◽  
Liangchen Liu

Edge computing needs the close cooperation of cloud computing to better meet various needs. Therefore, ensuring the efficient implementation of applications in cloud computing is not only related to the development of cloud computing itself but also affects the promotion of edge computing. However, resource management and task scheduling strategy are important factors affecting the efficient implementation of applications. Therefore, aiming at the task scheduling problem in cloud computing environment, this paper proposes a new list scheduling algorithm, namely, based on a virtual scheduling length (BVSL) table algorithm. The algorithm first constructs the predicted remaining length table based on the prescheduling results, then constructs a virtual scheduling length table based on the predicted remaining length table, the current task execution cost, and the actual start time of the task, and calculates the task priority based on the virtual scheduling length table to make the overall path the longest task is scheduled first, thus effectively shorten the scheduling length. Finally, the processor is selected for the task based on the predicted remaining length table. The selected processor may not be the earliest for the current task, but it can shorten the finish time of the task in the next phase and reduce the scheduling length. To verify the effectiveness of the scheduling method, experiments were carried out from two aspects: randomly generated graphs and real-world application graphs. Experimental results show that the BVSL algorithm outperforms the latest Improved Predict Priority Task Scheduling (IPPTS) and RE-18 scheduling methods in terms of makespan, scheduling length ratio, speedup, and the number of occurrences of better quality of schedules while maintaining the same time complexity.

Author(s):  
Hui Xie ◽  
Li Wei ◽  
Dong Liu ◽  
Luda Wang

Task scheduling problem of heterogeneous computing system (HCS), which with increasing popularity, nowadays has become a research hotspot in this domain. The task scheduling problem of HCS, which can be described essentially as assigning tasks to the proper processor for executing, has been shown to be NP-complete. However, the existing scheduling algorithm suffers from an inherent limitation of lacking global view. Here, we reported a novel task scheduling algorithm based on Multi-Logistic Regression theory (called MLRS) in heterogeneous computing environment. First, we collected the best scheduling plans as the historical training set, and then a scheduling model was established by which we could predict the following schedule action. Through the analysis of experimental results, it is interpreted that the proposed algorithm has better optimization effect and robustness.


2014 ◽  
Vol 915-916 ◽  
pp. 1382-1385 ◽  
Author(s):  
Bai Lin Pan ◽  
Yan Ping Wang ◽  
Han Xi Li ◽  
Jie Qian

With the enlargement of the scope of cloud computing application, the number of users and types also increases accordingly, the special demand for cloud computing resources has also improved. Cloud computing task scheduling and resource allocation are key technologies, mainly responsible for assigning user jobs to the appropriate resources to perform. But the existing scheduling algorithm is not fully consider the user demand for resources is different, and not well provided for different users to meet the requirements of its resources. As the demand for quality of service based on cloud computing and cloud computing original scheduling algorithm, the computing power scheduling algorithm is proposed based on the QoS constraints to research the cloud computing task scheduling and resource allocation problems, improving the overall efficiency of cloud computing system.


Author(s):  
Suvendu Chandan Nayak ◽  
Sasmita Parida ◽  
Chitaranjan Tripathy ◽  
Prasant Kumar Pattnaik

In this article, the authors propose a novel backfilling-based task scheduling algorithm to schedule deadline-based tasks. The existing backfilling algorithm has some performance issues in comparison with the number of task scheduling in OpenNebula cloud platform. A lease could not be scheduled if it is not sorted with respect to its start time. In backfilling, a lease is selected in First Come First Serve (FCFS) to be backfilled from the queue in which some ideal resources can be found out and allocated to other leases. However, the scheduling performance is not better if there are similar types of leases to backfill. It requires a decision maker to resolve conflicts. The proposed approach schedules the number of tasks without any decision maker. An additional queue and the current time of the system is implemented to improve the scheduling performance. It performs quite satisfactorily in terms of number of a leases scheduling, and resource utilization. The performance result is compared with the existing backfilling algorithms.


2014 ◽  
Vol 513-517 ◽  
pp. 2398-2402
Author(s):  
Dian Hong Wu

Embedded system has been widely used in the network, server, etc., and it has a good application prospect with the development of Internet of things. In the embedded heterogeneous computing system, task scheduling is the key to deciding the system performance. For multi-task scheduling, the current scheduling algorithm is mostly based on task duplication, without a full consideration of the correlation between the predecessor task and its subsequent tasks. Based on modeling the multi-frame task scheduling problem in the heterogeneous embedded system, this paper analyzes the availability of tasks through the design of genetic algorithm, so as to verify the algorithm's feasibility, which is of important guiding significance for the multi-task scheduling in the embedded heterogeneous computing system.


Author(s):  
Zhou Wu ◽  
Jun Xiong

With the characteristics of low cost, high availability, and scalability, cloud computing has become a high demand platform in the field of information technology. Due to the dynamic and diversity of cloud computing system, the task and resource scheduling has become a challenging issue. This paper proposes a novel task scheduling algorithm of cloud computing based on particle swarm optimization. Firstly, the resource scheduling problem in cloud computing system is modeled, and the objective function of the task execution time is formulated. Then, the modified particle swarm optimization algorithm is introduced to schedule applications' tasks and enhance load balancing. It uses Copula function to explore the relation of the random parameters random numbers and defines the local attractor to avoid the fitness function to be trapped into local optimum. The simulation results show that the proposed resource scheduling and allocation model can effectively improve the resource utilization of cloud computing and greatly reduce the completion time of tasks.


Sign in / Sign up

Export Citation Format

Share Document