COSC 3360-Operating System Fundamentals Assignment #1: Process Scheduling Due Friday, February 16 2018 at 11:59:59 pm Program organization: Your program should read its input file name though input redirection as in: This assignment will introduce you to CORE /a.out input.txt Your program should have one process table with one entry per process containing a process sequence number, the process class, its process arrival time and its current state 2. SPECIFICATIONS You are to simulate the execution of processes by a (RUNNING, READY or BLOCKED). Since you are to focus on the scheduling actions taken tablet with a large memory, one display, a muiti-core processing unit, and one solid-state drive. Each process by the system you are simulating, your program will only will be described by its start time followed by a have to intervene whenever I. A process is loaded into memory, 2. A process completes a computational step All times should be simulated Each time a process starts or terminates your program These resources requests will include core requests (CORE), SSD requests (SSD) and input requests INPUT). Your input will be a sequence of pairs as in NCORES 2 / number of cores NEW 120ee // new process CORE 180 I/ request cORE for 100 ms INPUT 580e I/ request INPUT for 5800 T CORE 88 Irequest CORE for 88 ms SSD 1 I/ request SSD for 1 ms CORE 38 I/ request CORE for 38 ms yur simulator should print a summary report listing: SSD 1 I request SSD for 1 ms CORE 28 Irequest CORE for 28 ms NEW 12040 // new process should print: I. The current simulated time in milliseconds, 2. The sequence number of the process that terminates and the states of all other active processes When all the processes in your input stream have completed The number of processes that have completed The total number of SSD accesses, The average duration of a SSD access (including the waiting time in the SSD queue). The processing unit utilization, that is, the average number of busy cores (between zero and NCORES), The SSD utilization, that is, the fraction of time that device was busy (between zero and one). 2- 3. All times will be expressed in milliseconds. Processor Management: Your program should have a single ready queue. That queue should be a FIFO queue and keep all processes ordered according to their queue arrival time in strict first-come first-served order SSD Management: SSD access times are much shorter than disk access times with write requests taking less than a millisecond and read requests taking much less To get full credit, your program should start by a block of than that. As a result, write request timings will be comments containing your name, the course number, the due rounded up to one millisecond and read requests timing date and a very short description of the assignment. Each 4 5. 3, IMPORTANT will be rounded down to zero ms. SSD scheduling will class, method or function should start by a very brief be strictly first-come first-served (FCFS) description of the task it performs. To simplify your life, we will also assume that: 1 There is no contention for main memory, 2. Context switch times can be neglected, and 3. User think times and other delays, like This document was created on Tuesday, January 23 2018 overlapping windows, are included in the input COSC 3360-Operating System Fundamentals Assignment #1: Process Scheduling Due Friday, February 16 2018 at 11:59:59 pm Program organization: Your program should read its input file name though input redirection as in: This assignment will introduce you to CORE /a.out input.txt Your program should have one process table with one entry per process containing a process sequence number, the process class, its process arrival time and its current state 2. SPECIFICATIONS You are to simulate the execution of processes by a (RUNNING, READY or BLOCKED). Since you are to focus on the scheduling actions taken tablet with a large memory, one display, a muiti-core processing unit, and one solid-state drive. Each process by the system you are simulating, your program will only will be described by its start time followed by a have to intervene whenever I. A process is loaded into memory, 2. A process completes a computational step All times should be simulated Each time a process starts or terminates your program These resources requests will include core requests (CORE), SSD requests (SSD) and input requests INPUT). Your input will be a sequence of pairs as in NCORES 2 / number of cores NEW 120ee // new process CORE 180 I/ request cORE for 100 ms INPUT 580e I/ request INPUT for 5800 T CORE 88 Irequest CORE for 88 ms SSD 1 I/ request SSD for 1 ms CORE 38 I/ request CORE for 38 ms yur simulator should print a summary report listing: SSD 1 I request SSD for 1 ms CORE 28 Irequest CORE for 28 ms NEW 12040 // new process should print: I. The current simulated time in milliseconds, 2. The sequence number of the process that terminates and the states of all other active processes When all the processes in your input stream have completed The number of processes that have completed The total number of SSD accesses, The average duration of a SSD access (including the waiting time in the SSD queue). The processing unit utilization, that is, the average number of busy cores (between zero and NCORES), The SSD utilization, that is, the fraction of time that device was busy (between zero and one). 2- 3. All times will be expressed in milliseconds. Processor Management: Your program should have a single ready queue. That queue should be a FIFO queue and keep all processes ordered according to their queue arrival time in strict first-come first-served order SSD Management: SSD access times are much shorter than disk access times with write requests taking less than a millisecond and read requests taking much less To get full credit, your program should start by a block of than that. As a result, write request timings will be comments containing your name, the course number, the due rounded up to one millisecond and read requests timing date and a very short description of the assignment. Each 4 5. 3, IMPORTANT will be rounded down to zero ms. SSD scheduling will class, method or function should start by a very brief be strictly first-come first-served (FCFS) description of the task it performs. To simplify your life, we will also assume that: 1 There is no contention for main memory, 2. Context switch times can be neglected, and 3. User think times and other delays, like This document was created on Tuesday, January 23 2018 overlapping windows, are included in the input