+1-415-670-9189
info@expertsmind.com
Implementation of algorithms for process management
Course:- Operating System
Reference No.:- EM13206




Assignment Help
Assignment Help >> Operating System

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst. Shortest remaining time rst algorithm (SRT) is used in real-time process management in operating systems.

Hints:

- You need to assume a list of processes that have di erent length (For the purpose of demonstration, the length may need to set to very large. You can generate the pro- cesses either manually or using random functions within your chosen programming language)

- You need to arrange the processes become ready at di erent times for the SRT algorithm.

- You need to construct a READY Queue to hold both newly arrived and the sent- back processes in the case of the SRT algorithm.

You are required to

Task 1) Produce a flowchart for the algorithm

Task 2) Implement the algorithm in a programming language that you are familiar with (e.g.C or C++).

Task 3) Run your program with three cases (each having at least ve processes) for the two algorithms.

- Each case should be run for both algorithms in order for you to make a comparison of the average turnaround time.? Record your input and output for each of the three runs (It would be preferred to display your results on computer screen.).

- Inputs should include case speci c information such as the arival time of the process and the number of CPU cycles the process takes to run to completion.

The single important output is the average turnaround time for case speci c inputs (although a repesentation of the order of processes may be useful for debugging).

Task 4)

A brief report covering your diagrams, source code, input and output for each run of your program, and a short conclusion of the algorithm including a comparison of the average turnaround times for the cases tested for the two algorithms. Also make comment on preemptive and nonpreemptive algorithms.




Put your comment
 
Minimize


Ask Question & Get Answers from Experts
Browse some more (Operating System) Materials
As was stated before, the corporation X is going to expand its data system. To do this, it is going to choose and buy new hardware and software and retrain workers.
Think about a simple telephone network consisting of two end offices and one intermediate switch with a 1-MHz full-duplex trunk in each end office and the intermediate switch.
CS314 Operating Systems Assignment Four: More IPC Problems. Write a program that synchronizes the threads such that deadlock does not occur and no little rascal starves. The
Create a system life cycle chart, utilizing Microsoft Word, Microsoft PowerPoint, or Microsoft Visio. The chart must include detailed descriptions of the activities performed
CIS375- GUIs play an important role on how an end-user interacts with an operating system. Describe an instance where you did not have an intuitive experience with a GUI.
Consider a computer system with 48-bit logical address and 4-KB page size. System supports up to 1 GB of physical memory. Illustrate how many entries are there in each of th
If each process uses a different value for d in the Lamport's clock and vector clock equations, will the logical clocks and vector clocks schemes satisfy the total order relat
The manual for a popular operating system points out that the number of concurrent users on the system can be increased if the users are sharing programs, such as editors, m