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

Example of pointers, #include "stdafx.h" #include iostream using name...

#include "stdafx.h" #include iostream using namespace std; int _tmain(int argc, _TCHAR* argv[]) {             int NumbHold[5];             int * ptrNumb;

What are pre-processor directives, What are pre-processor directives? -...

What are pre-processor directives? - Pre-processor directives are placed at the beginning of a C program. They begin with # symbol. - This is the place, where library files

Describe how can i allocate/unallocate an array of things?, A: Use p = new ...

A: Use p = new T[n] and delete[] p:   Fred* p = new Fred[100]; ... delete[] p; Any time you allocate an array of objects through new (generally with the [n] in the n

C program to add two complex numbers , Aim: To implement a program to add ...

Aim: To implement a program to add two complex numbers using constructors. Code:                       class complex {             int real;             int img;

Lowest cost entry, code for solving optimal solution for matrix

code for solving optimal solution for matrix

Program to make another type of mask, Write a function that has int paramet...

Write a function that has int parameter n, makes another type of mask having n bit 1's from the left most bit and 32- n bit 0's next. The mask is called netmask in this seminar, an

Padovan string, #questio#A Padovan string P(n) for a natural number n is de...

#questio#A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string

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