Research Article
Task Balanced Workflow Scheduling Technique considering Task Processing Rate in Spot Market
Algorithm 1
Workflow scheduling algorithm.
| (1) Boolean S_flag = false // a flag representing occurrence of a task execution | | (2) while (search user’s job) do | | (3) if (require job execution by the user) then | | (4) take the cost and total execution time by the user; | | (5) S_flag = true; | | (6) end if | | (7) if (S_flag) then | | (8) invoke initial_workflow ( ); // thread function | | (9) while (task execution does not finish) do | | (10) if (meet the recalculation point by instance) then | | (11) invoke recalculation_workflow ( ); // thread function | | (12) end if | | (13) end while | | (14) end if | | (15) end while |
|