Research Article
Reliability-Constrained Task Scheduling for DAG Applications in Mobile Edge Computing
Algorithm 1
Update strategy of the archive in RCMOCS.
1: Initialize I = False and i = 1 | 2: whiledo | 3: ifP1 [i] P0 [i] and P1 [i]’s reliability Rgiven (G) then | 4: I = True | 5: ifP0 [i] in archive A then | 6: Replace P0 [i] with P1 [i] | 7: else | 8: Add P1 [i] into archive A | 9: end if | 10: end if | 11: i++ | 12: end while | 13: ifI is True then | 14: Find all nondominated solutions in A | 15: if the number of solutions that satisfy the reliability constraint 0 then | 16: Keep solutions which satisfies the reliability constraint in A | 17: else | 18: Keep solutions with less violation of the reliability constraint in A | 19: end if | 20: if number of solutions in then | 21: Retain all solutions in A | 22: else | 23: Do crowding distance sorting and keep the top L solutions in A | 24: end if | 25: end if |
|