Scheduling Parallel Intrusion Detecting Applications on Hybrid Clouds

Algorithm 2

FTA.

Input: a task sequence

Output: makespan

1: Set , , ;

2: Set and for each time slot ;

3: for (each task in ) do

4: Set and ;

5: while () do

6: Set ;

7: for (each time slot ) do

8: if ( OR ) then

9: Set and break;

10: end if

11: end for

12: if () then

13: Calculate ;

14: break;

15: else

16: Set ;

17: if ( AND ) then  

The acceleration mechanism using Theorem 1 is utilized

18: Set and break;

19: end if

20: end if

21: end while

22: Calculate ;

23: if ( AND ) then

24: Set and ;

25: else

26: Set ;

27: for (each time slot ) do

28: Update ;

29: Update ;

30: end for

31: end if

32: end for

33: return  ;