CSci 430 Spring 2019 Objectives: Explore the Process state models from an implementation point of view. Practice using basic queue data types and implementing in C. Use C/C++ data structures to implement a process control block and round robin scheduling queues. Learn about Process switching and multiprogramming concepts. Description: In this assignment you will simulate a Three-State process model (ready, running and blocked) and a simple process control block structure as dis- cussed in Chapter 3. Your program will read input and directives from a le. The input describes a time sequence of events that occur. These are the full set of events you will simulate: 1 Event Description cpu The processor executes for 1 time step the currently running process new A new process is created and put at tail of the ready queue done The currently running process has nished wait X The currently running process has done an I/O operation and is waiting on event X event X Event X has occurred, the process waiting on that event should be made ready. The input le will simply be a list of events that occur in the system, in the order they are to occur. For example: —– simulation-01.sim ——– new cpu cpu cpu new cpu cpu cpu cpu wait 1 cpu cpu event 1 cpu cpu done cpu cpu cpu cpu exit ———————————- Your task is to read in the events, and simulate the creation and execution of processes in the system as they move through the various three-states of their process life cycle. You need to: 2 Dene a simple process control block (PCB) to hold information about all processes currently running in your system. The PCB can be a simple C struct or a C++ class. At a minimum you need to have a eld for the process identier and the process state (Ready, Running or Blocked). You need to also keep track of the time step that the process entered the system, and the number of steps the process has been running. Minimal credit will be given to programs that at least handle new events and create a process in a simulated PCB. You probably need a list or an array to hold the current processes that have been created and are being managed by your simulated system. You will need a ready queue of some kind. You should use a C++ Standard Template Library (STL) container to manage your ready queue. You will need to implement a simple dispatcher function. Whenever a cpu event occurs, and no process is currently running, you should select the next Ready process from the head of your ready queue and start it running on the processor. You need to also implement a simple time slicing mechanism. The time slice value to use will be passed into your program when it is started. At the end of a cpu cycle, you should check if the currently running process has executed for its full time quantum. In that case, the currently running process should timeout, and be returned to the end of the Ready queue. new events should cause a new process to be created (including creating its PCB and lling it in). New processes should be placed on the tail of the ready queue after being created. You should assign each new process a process identier. The process identier should be a simple integer value, and you should start numbering processes from 1. For a done event, if a process is currently running it should then be released. It should be removed from the CPU, and not placed back on the ready or blocked queue. If a done occurs when the CPU is idle, then nothing will happen as a result of this event. A wait event simulates the currently running process performing some I/O operation. If a wait occurs, the currently running process should become blocked and put on the blocked queue. You also need an entry in the PCB so you know what event the process is waiting for. The 3 wait event is followed by an integer number, which is an indication of the type of event the process has requested. Likewise the event directive simulates the nishing of some I/O oper- ation. When …

Looking for solution of this Assignment?


We deliver quality original papers

Our experts write quality original papers using academic databases.  

Free revisions

We offer our clients multiple free revisions just to ensure you get what you want.

Discounted prices

All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount

100% originality

We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity

On-time delivery

We will deliver your paper on time even on short notice or  short deadline, overnight essay or even an urgent essay