computer security and operating system, C/C++ Programming

Assignment Help:
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) [ 30 % ]
Produce a
owchart for the algorithm
Task 2) [ 30 % ]
Implement the algorithm in a programming language that you are familiar with (e.g.
C or C++).
Task 3) [ 20 % ]
? 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 com-
parison 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.).
1? 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) [ 20 % ]
Write 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

Related Discussions:- computer security and operating system

Explain reference oddities, Reference Oddities A reference variable can...

Reference Oddities A reference variable can demote to any integer variable, be it in an array or a member variable from structure or class. Reference variables can demote to co

Luminous jewels polishing necklace, 1.jewels can only be removed for polish...

1.jewels can only be removed for polishing from either end of the necklace. 2.cost of polishing=sitting number*colour value of jewels.

Single string programme, write a programme that allows a user to enter 5 di...

write a programme that allows a user to enter 5 distinct words and returns them as a single string

Inheitance, ambiguity in multiple inheritance

ambiguity in multiple inheritance

Programming assignment, Introduction. In this assignment you are required t...

Introduction. In this assignment you are required to simulate a maze traversal using so called recursive backtracking (the algorithm is given below). The grid of #s and 0s in the f

Change to palindrome, A palindrome is a string that reads the same from the...

A palindrome is a string that reads the same from the both the ends. Given a string S convert it to a palindrome by doing character replacement. Your takes is to convert S to palin

Explain about the expressions in c language, Explain about the Expressions ...

Explain about the Expressions in c Language? An expression is the combination of constants, variables and operators arranged as per the syntax of the language. Some of the illu

Areaundercurve, Write a program to find the area under the curve y = f(x) b...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd