hello people
Suppose a task consists of n subtasks, Ji each of which has computation time Ci, i=1,...,n. This task requests service at time T and has absolute deadline D. Summarize a formula to compute the latest deadline for completing each subtask such that the deadline of the entire task can be satisfied.
what i was able to come up with is this
Arrival time = T
Absolute deadline = D
hence computational time = D - T
so far task J ( which has j1.....jn)
D1 = T + C1 and D2 = T + D2 and so on..
summarizing them i get Dn = summation Ci + T
but am not sure if what i have arrived at is the latest dealine for each sub task
any sort of help would be really apppreciated
thankz