Abstract
The problem to sehedule n independent tasks nonpreemptively on m processors with the objective of minimizing the finishing time is considered. For the case of m=2, an approximate algorithm which has a worst-case performance ratio 1 +€ and runs in time 0 (nlogn) is proposed. For general m, by restricting the number of task types to k, a polynomial time (in n, m) exact algorithm is presented. ) that the times are given in integral multiples of a unit time. The unrelated processors system which we treat is a generalization of the identical proc- essors sys tern where \l . . is cons tant wi th respect to j i. e. is equal to r; ~J ~ (execution requirement of task T i ) and of the uniform processors system where by using the notion of processor's speed(s.) \l .. is expressed as r.ls .. In ) ~J ~ ) the case, processor's speed may vary according to the task being executed. Rather, it models the heterogeneous multiprocessor system where respectively specialized processors can execute the each type of tasks more efficiently than others.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
