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
Some people write custom memory allocators to meet their speci?c needs. Although this is not needed for most of the applications, it is also not uncommon. The goal, of course, is t

Producer-Consumer Problem Using Semaphores The Solution to producer-consumer problem use three semaphores namely- full, empty and mutex. The semaphore 'full' is utilized for

Q. An operating system sustains a paged virtual memory using a central processor with a cycle time of 1 microsecond. It costs an additional one microsecond to access a page other

Q. Describe the concept of transaction atomicity? Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the

Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio

Can you please explain in easy words how input output protection works

Q. How is the NTFS namespace planned? Explain. Answer: The NTFS namespace is prearranged as a hierarchy of directories where every directory uses a B+ tree data structure to

Write a note about Directory structure with examples. The FreeBSD directory hierarchy is basic to obtaining an overall understanding of the system. The most significan

The idea of reference counting is to maintain, for every object, the total number of references to that object, i.e. the number of "incoming" pointers. Whenever the number of refer

There is a very small amount of networking background required for Project 2. In Project 2, we want our computer (or our "host") to request information over the Internet from a rem