Task scheduling algorithmAlgorithm time complexityThe purpose of this paper is to implement parallel test in the single processor auto test system and to improve the test efficiency with a lower test cost. The main factor that impacts the test efficiency of test system is the performance of the ...
An improved game-theoretic algorithm with polynomial time complexity was proposed, transforming the task-offloading challenge into a game that dynamically updates the offloading strategies and identifies the Nash equilibrium of the system to determine the optimal offloader strategy. Simulation experiments ...
Depending on the algorithm used, a scheduling problem can be solved in seconds, hours, or even years. The time required to execute an algorithm is used to assess its performance. The algorithm’s execution time is proportional to its input as a function of complexity time. Several time comple...
The first one answers the decision problem and gives a feasible schedule if there exists one. It is an optimal algorithm with time complexity of O(m). The second one finds an optimal schedule in O(m+m 0 log m 0 +m 02 Gamma n 2 ) time using the first algorithm. It... 展开 ...
The produced schedule is judged based on the performance criterion to be optimized, while the scheduling algorithm is evaluated based on its time complexity. For example, if we try to optimize the completion time of a program, the less the completion time, the better the schedule will be. ...
Wu, D.: Cloud computing task scheduling policy based on improved particle swarm optimization. In: 2018 International Conference on Virtual Reality and Intelligent Systems (ICVRIS). IEEE (2018) Li, J., et al.: Task scheduling algorithm for heterogeneous real-time systems based on deadline constrai...
The obtained results show that the proposed algorithm provides an efficient balance between the cost and performance of task execution compared to other algorithms, such as Dynamic Level Scheduling (DLS) algorithm [115], and Heterogeneous Earliest-Finish-Time (HEFT) algorithm [116]. However, this ...
Empty CellMinimize the task completion time [94] A heuristic algorithm Integer programmingMaximizing the total revenue [48] Convex optimization and branch and bound are used to solve the MIP problem Reduce latency [46] Dynamic Task Offloading and Scheduling (DTOS) Minimize the energy consumption at...
The bulk synchronous task scheduling problem (BSSP) is known as an effective task scheduling problem for distributed-memory machines, but the time complexity of BSSP is unknown. This paper presents a proof of NP- completeness of BSSP even in the case of unit time tasks and positive integer con...
we present two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time, which are called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm...