Abstract
In firm real time environments in which tasks must complete by their deadlines if they are to be of any value to the system, it is known that no uniprocessor online scheduling algorithm can guarantee to perform particularly well under conditions of overload as compared to clairvoyant algorithms. The article explores the issue of designing online scheduling algorithms that use multiple processors to compensate for their lack of clairvoyance. In particular, it is shown that given enough processors, online scheduling algorithms can be designed with performance guarantees arbitrarily close to that of optimal clairvoyant uniprocessor scheduling algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.