Implementation of algorithms for process management
Course:- Operating System
Reference No.:- EM13206

Assignment Help
Expertsmind Rated 4.9 / 5 based on 47215 reviews.
Review Site
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.


- 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

Ask Question & Get Answers from Experts
Browse some more (Operating System) Materials
From the e-Activity, evaluate the ease of use and efficiency of using both Windows and Unix file management systems. Of the two file management systems, determine the one th
Discuss and explain the statement: "Global communication has developed to such a degree that the true operating system is the net itself, where the individual operating system
A transmission system operates at sixteen MHz. The power output is 1 W and .1 Watt is needed at the receiver. The receiver is located one hundred meters from the transmitter.
Given a 4-way set associative cache unit with a 6-bit offset and a 12-bit index for a 32-bit address space with a LRU write-back policy, determine the nominal and actual size
Write a brief history (500-600 words) of Linux. In your answer, you should describe how it came about, how its development has continued, and describe the major events since
Assume that the passwords were eight characters long but that the salt length was increased to 24 bits. Again, the salts (and the corresponding algorithms) are known to all
COP4610: Introduction to Operating Systems Project: Priority-based Scheduler for Xv6. In this assignment, you will learn how to implement a priority-based scheduler for xv6.
An interesting emerging market is using Internet phone and a corporation's high speed LAN to replace same corporation's PBX. Create a page report on the issue.