Performance of job scheduling strategies, Operating System

Performance of Job Scheduling  Strategies

In this project you will investigate the performance of Job Scheduling strategies, Memory Allocation strategies and a CPU Scheduling strategy used by a hypothetical operating system (HOS).  The computer system that runs this HOS has four identical processors so that four ready processes can execute truly in parallel. The HOS uses multiprogramming to multiplex the four processors amongst all the memory-resident jobs. The physical memory space is divided into several segments of varying sizes and the allocation strategy uses contiguous allocation of memory space to the waiting processes. Each user program runs in a single segment.  Any unused space of an allocated segment is considered wasted.

Memory space requirement and CPU time requirement of all the jobs will be randomly generated: this data essentially constitutes the "Job Queue" or "Input Queue". The HOS allocates memory to as many jobs as possible based on the scheduling and allocation strategies. It then starts their execution.  These jobs remain in memory until completion (no preemption.). When one or more jobs finish, the HOS brings in additional jobs from the job queue based on the same scheduling and allocation strategies.

The following information will be needed to run the simulation:

1. You will need to identify and keep current the following information on each job:

a. Job identification number
b. Memory request (in MB)
c. Execution time request
d. Memory assigned (segment number)
e. Execution time remaining (initially same as item c.)
f.  Job status: Waiting, Ready, Running, & Finished

2. You will need to maintain the following information on memory:

a. Segment number
b. Size in kilobytes (MB)
c. Whether the segment is in use or not
d.  Wasted space (MB)

3. The physical memory of size 256 megabytes is partitioned into seven memory blocks as indicated in the table below.

Fixed-Size Memory Segments

Segment Number

Size in MB

0

1

2

3

4

5

6

32

48

24

16

64

32

24

 

Posted Date: 2/14/2013 6:57:20 AM | Location : United States







Related Discussions:- Performance of job scheduling strategies, Assignment Help, Ask Question on Performance of job scheduling strategies, Get Answer, Expert's Help, Performance of job scheduling strategies Discussions

Write discussion on Performance of job scheduling strategies
Your posts are moderated
Related Questions
Define rotational latency and disk bandwidth. Rotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk head. The disk bandwidth is

Assume there are only 4 page frames in the physical memory, for the following reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2, 8. a) What i

define semaphore. how can we use semaphore to deal with n-process critical section problem.

Major page fault: If the page is not loaded in memory at the time the fault is stated, then it is named major or hard page fault. The handler in the machine requires to search a

what is segmentation as it refers to operating system

Write a note on the usage of semaphores. Semaphore is a synchronization tool and it is a variable having integer values. It is accessed only by two standard atomic operations w

What is Belady's anomaly When plotting on a graph the page faults versus the number of available frames. We notice that the number of faults for four frames is greater than th

When the Page fault frequency in an operating system is reduced Locality of reference is appropriate to the process

What is bounded buffer