Task scheduling with precedence constraints to minimize the total completion time

1995 ◽  
Vol 26 (11) ◽  
pp. 2203-2217 ◽  
Author(s):  
JOU-MING CHANG ◽  
CHIUN-CHIEH HSU
Author(s):  
Bassim Ali Oumran, Rowayda AAdel Muhbani Bassim Ali Oumran, Rowayda AAdel Muhbani

Scheduling of associated tasks in heterogeneous systems is very important to reduce the total completion time as heterogeneity and coherence introduce more complexity. Several studies have focused on studying task scheduling in homogeneous systems and some studies have been limited to scheduling in heterogeneous systems. In this paper, a new algorithm was created and a simulation of the proposed algorithm was designed and tested using a random schema generator. This algorithm showed better results than its predecessors in terms of schedule length ratio relative to heterogeneity factor and Communication to Computation Ratio factor.


2013 ◽  
Vol 303-306 ◽  
pp. 2429-2432 ◽  
Author(s):  
Guan Wang ◽  
Hai Cun Yu

Task schedule algorithms directly related to the speed and quality of schedule. Min-Min algorithm always completes the shortest total completion time task first, and has the characteristic of simple and shortest completion time. This paper research scheduling algorithm based on Min—Min algorithm. The result shows that the proposed algorithm is efficient in the cloud computing environment.


Sign in / Sign up

Export Citation Format

Share Document