Suppose in a distributed system R = {r1, r2, · · · , rk} processes are distributed over a linear array of N processors. The data is stored on a disk at the N + 1st processor. For every process there is cost Cp(j) of running process p on j. And a communication cost Dp(j) of getting data for the process p. Suppose the processes are to be scheduled with the restriction that if ri , rj , j ≥ i is assigned to processor qk and ql , respectively, then l ≥ k. Design and analyze an algorithm to minimize the total cost