Abstract
A simulation approach to the comparative analysis of different job scheduling methods with regard to CPU efficiency, the job throughput, and the job waiting time is presented. The job-processing simulation model is implemented in PL/1. In order to consider several possible dynamic situations for the job-scheduling methods, we simulated the job starting from its entry at the RJE (remote job entry) terminal until the job leaves the system, which includes an IBM 370/158 and AMDAHL 470 V/7. In particular, a Fourier series is used to predict the required CPU time for the job and to assign dynamically the internal priority for CPU scheduling. A detailed summary of conclusions that can be drawn from the simulation is 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.
