Consider a system with two processors where one processor is b times faster than

Question

Consider a system with two processors where one processor is b times faster than the other, i.e. if a job takes k units on the slower processor, it will take k/bunits on the faster processor. Prove that if w(L) is the computation time for a set of jobs with priority list L, and wo is the optimal computation time, then w(L)/wo ? b + 1/(b+1).   Assume that when both the processors become available simultaneously, the faster processor gets the next job first. Hint: (Estimate the time for idle periods on the two processors separately.)

Explanation / Answer

w(L)=1

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.