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 ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.

Explain the Network protocols There are a wide variety of network protocols to choose from traditionally client - server developers were required to choose a communications pro

Q. What is the major difficulty that a programmer should overcome in writing an operating system for a real-time environment? Answer: The major difficulty is keeping the oper

what topic i choose for os research proposal

Define Latency plus seek time The total time to arrange a disk drive mechanism for a block of data to be read from is its Latency plus seeks time

The CTO is still impressed with your work. He just came back from a technology exposition where he heard about computer clusters. All he knows is that they are the big thing for bu

Linked allocation With linked allocation, every file is a linked list of disk blocks; the disk blocks might be scattered anywhere on the disk. The directory has a pointer to th

Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers

What does the last four digits '0010' of the above dump represent? What action will the Destination node takes when it receives this packet? The last four digits '0010' denotes

When do we write a page from physical memory back to the disk? In general, caches have two broad types of writing policies. One approach is a write-through cache. In this case,