Abstract: The concept of limited preemption is introduced, where a task can be preempted, but can not be moved from one processor to another. For optimal makespan scheduling on two processors, the worst case ratio of the makespan with no preemption to that with limited preemption is shown to be 4/3, while the worst case ratio of the makespan with limited preemption to that with unlimited preemption is 4/3 as well.
Publication Year: 1998
Publication Date: 1998-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot