Abstract
The effects of task routing and resequencing on system and program performance of a multiprocessor system are studied using simulation techniques. A closed queueing network model is considered. It consists of the CPU and the I/O channel. The CPU consists of four homogeneous and independent processors each serving its own queue. Resequencing of jobs after CPU service ensures that jobs leave the CPU on a first-in-first-out basis. We examine the performance of four task routing strategies in conjunction with the subsequent resequencing of jobs for various coefficients of variation of processor service times (exponential and Branching Erlang distributions) and for different degrees of multiprogramming.
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.
