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
Vyvtvtn8

Q.  When virtual memory is executed in a computing system there are convinced costs associated with the technique and certain benefits. List the costs as well as the benefits. Is i

How can an index file be used to speed up the access in direct-access files? Have an index in memory; the index gives the key and the disk location of its corresponding record.

The term ‘page traffic’ explains   Page traffic’ explains the movement of pages in and out of memory.

In modern operating systems, applications do not directly access the physical memory. Instead, they use so-called virtual memory, where each virtual address is translated to a phys

Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th

Q. In what circumstances is a token-passing network more effectual than an Ethernet network? Answer: A token ring is extremely effective under high sustained load as no colli


Basic concepts When a process is to be changed in, the pager guesses which pages will be used before the process is changed out again. Instead of swapping in a entire process,

What are the methods for handling deadlocks? The deadlock problem can be dealt with in one of the three ways: a. Use a protocol to prevent or avoid deadlocks, ensuring that