+1-415-670-9189
info@expertsmind.com
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.

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
Saguaro Federal has mainframes for all of its banks and businesses. Should the corporations use the Ethernet or Token Ring protocol? Describe your choice. Discuss why is this
Describe how you would use a negative feedback loop to manage your bank balance.Describe how you would do so with a positive feedback loop. Explain which you would prefer and
Using the internet as a source, compile a list of three known vulnerabilities for SQL Server on Windows operating systems and three vulnerabilities for Oracle on Unix.
Suppose we are using Lamport's hash, and Bob's system crashes before receiving Alice's reply to a message. Further suppose an intruder, Trudy, can eavesdrop and detect that
s computer calculate the following: (a) What is the L2 read miss penalty? (b) What is the L1 read miss penalty? (c) What is the read penalty (L1 and L2 cache)? (d) Assume 33%
Analyze the security features of Linux, Macintosh, and Windows operating systems, and decide which you believe is the most susceptible to hackers based on hacking techniques a
How many RAM chips are necessary? How many RAM chips are needed for each memory word? How many address bits are needed for each RAM chip? How many address bits are needed for
Explain the process used to preserve the verifiable integrity of digital evidence. How does this ensure that data is preserved unmodified? How can an analyst show that the o