Abstract
A system with N processors and R job classes subject to a preemptive priority scheduling discipline is considered. Exact analysis is presented for the case R = 2, under Markovian assumptions. That analysis suggests a method for obtaining approximate solutions for arbitrary R. The implementation of the methods is discussed and numerical results for some special cases are given.
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.