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

Padovan string, example of padovan string program

example of padovan string program

Padovan string, write a C program for padovan string for a natural number

write a C program for padovan string for a natural number

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

.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.

C program for string operations, Aim: To implement a program for following...

Aim: To implement a program for following string operations: Length of String. String Concatenation. Substring (provide start index and length) Find character a

Minimization and karnaugh maps, There are formal ways of reducing Boolean e...

There are formal ways of reducing Boolean expressions in order to minimize the logic circuit. The two elementary ways of minimization are using Boolean expressions/De Morgan Theore

What''s the deal along with operator overloading?, A: It let you to provide...

A: It let you to provide an intuitive interface to users of your class, as well as makes it possible for templates to equally work well with classes and built-in/intrinsic types.

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