Abstract
In 1972, Liu claimed that for any task systems to be scheduled on $m\geqq 1$ identical processors, the ratio of the optimal nonpreemptive schedule length versus the optimal preemptive schedule length is bounded above by $2m/( m + 1 )$. Furthermore, Liu showed that the bound is the best possible by giving a task system achieving the ratio. His upper bound proof was later found to be incorrect, and his claim has since remained a conjecture. In this paper, it is shown that Liu’s bound is valid for the unit execution time (UET) and tree-structured task systems. For two processors, it is shown that some other classes of task systems satisfy the 4/3 bound. Other results comparing the lengths of optimal list, nonpreemptive schedules, and preemptive schedules are also given.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
