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

What is token in programming languages, T o k e n :  Tokens  are  s...

T o k e n :  Tokens  are  small  entities  in  a  program.    Example: identifiers,  keywords,  constants, operators, strings, etc.  These tokens are used almost in same wa

Implement binary heap in c++?, A:BinaryHeap.h ------------ #ifndef BI...

A:BinaryHeap.h ------------ #ifndef BINARY_HEAP_H_ #define BINARY_HEAP_H_ #include "dsexceptions.h" #include "vector.h" // BinaryHeap class // CONSTRUCTION: wi

C program for exchange first & last character, Normal 0 false ...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Illustrate bit fields with structures, C language lets us do this in a stru...

C language lets us do this in a structure definition by putting: bit length after the variable that is. struct packed_struct { unsigned int f1:1; unsigned int f2:1; unsigned

Maze, How would I make a maze in C++? I would prefer to use the recursion m...

How would I make a maze in C++? I would prefer to use the recursion maze generation algorithm if possible, thanks!

Implementing Dynamic Binding for RPC, i didnt no how to write and how to im...

i didnt no how to write and how to implement and the programming can be done in C and execution should be done in UNIX

Artificial block, What if I cannot wrap the local in an artificial block? n...

What if I cannot wrap the local in an artificial block? need help on Artificial Block in c++.

Basic Programming Constructs, Write a program to print all the factors of a...

Write a program to print all the factors of a positive integer A

MCQ, in a multilist organisation

in a multilist organisation

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