
90 Advances in Mobile Cloud Computing Systems
subdeadline of the PCP. By partial critical path analysis, the general
topology can be decomposed into a set of paths, each of which is a
linear chain case.
The earliest start time (EST) can be computed iteratively,
that is,
EST(v
0
)=0
EST(v
i
)= max
v
j
∈P(v
i
)
{EST(v
j
)+MET(v
j
)+CT(v
j
,v
i
,π
j
,π
i
)},(2.45)
where
P(v
i
) is the set of parent tasks of v
i
MET(v
j
) is the minimum execution time of task j
CT(v
j
,v
i
,π
j
,π
i
) is the communication time between task j and
task i
Second, for each of the paths, we adopt the one-climb policy to
schedule the execution of the tasks. The strategy is to minimize the
energy consumption under the ...