Job Scheduling. Need Help. Given Inputs create an output that organizes when it will terminate. 
how uue veunesuaygwarch Zum anywhere on carti 1. OBJECTIVE This assignment will introduce you to job scheduling. 2. SPECIFICATIONS Until the mid-seventies, most computers performed batch processing. There were fed batches of jobs to be processed in sequence You are to simulate the execution of a such batch of jobs by an old computer with a single core, a disk drive, a print spooler and enough memory to hold MPL jobs at the same time, with MPL representing the multi- programming level of the system. Each job will be described by its job id followed by a deterministic sequence of deterministic resource requests. These resources requests will consist of core requests (CORE), disk requests (DISK) and print spooler requests (PRINT). Your input will be a sequence of pairs as in: MPL 2 // memory can hold 2 jobs JOB 1 // new job CORE 100 // request CORE for 100ms DISK // no wait access CORE // request CORE for 30ms DISK // request DISK for 7ms CORE // request CORE for 20ms PRINT 1000 // print spooler request CORE // request CORE for 30ms JOB 3 // next job CORE 30 // request CORE for 30ms The Spooler Queue: Your program should have a single spooler queue holding all jobs waiting for the print spooler and manage it in strict first come first served (FCFS) order. Program Organization: Your program should read its input file name though input redirection as in: ./a.out
> code >> parameter; Recall that both scanf and cin return zero when the end of the input is reached. Last updated on Thursday, February 18, 2021. how uue veunesuaygwarch Zum anywhere on carti 1. OBJECTIVE This assignment will introduce you to job scheduling. 2. SPECIFICATIONS Until the mid-seventies, most computers performed batch processing. There were fed batches of jobs to be processed in sequence You are to simulate the execution of a such batch of jobs by an old computer with a single core, a disk drive, a print spooler and enough memory to hold MPL jobs at the same time, with MPL representing the multi- programming level of the system. Each job will be described by its job id followed by a deterministic sequence of deterministic resource requests. These resources requests will consist of core requests (CORE), disk requests (DISK) and print spooler requests (PRINT). Your input will be a sequence of pairs as in: MPL 2 // memory can hold 2 jobs JOB 1 // new job CORE 100 // request CORE for 100ms DISK // no wait access CORE // request CORE for 30ms DISK // request DISK for 7ms CORE // request CORE for 20ms PRINT 1000 // print spooler request CORE // request CORE for 30ms JOB 3 // next job CORE 30 // request CORE for 30ms The Spooler Queue: Your program should have a single spooler queue holding all jobs waiting for the print spooler and manage it in strict first come first served (FCFS) order. Program Organization: Your program should read its input file name though input redirection as in: ./a.out > code >> parameter; Recall that both scanf and cin return zero when the end of the input is reached. Last updated on Thursday, February 18, 2021
