Explain what is thrashing in the context of memory

Assignment Help Operating System
Reference no: EM132797430

THEORICAL PAPER

Rules and regulations:
• Hand written documents will not be accepted
• Paper submitted only in MS word format
• Plagiarism should be less than 15 %
• Formatting line spacing 1.5, Times and new Roman, paragraph justify
• Duplicate paper will be cancelled
• Last submit Date and Time

Answer the following questions.
Q.No.1. (05)
• Does timesharing differ from multiprogramming? If so, How?
• Why API, s needs to be used rather than system calls?
• How Trashing is differing from the Cascading?
• Illustrate with an example about OS a resource Manager.
• Define the time slicing how time slicing affects the working of overall system?
• What does the CPU do when there are no user programs to run?

Q.No.2. (05)
Consider the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds) and priorities. For example, process P1 arrives 11 milliseconds after the start of the system; process has priority (8, 6, 2, 5, 1).

Process

Arrival Time (ms)

Processing Time (ms)

Priority

P1

11

7

8

P2

8

1

6

P3

7

2

2

P4

4

3

5

P5

5

1

1


Find the average turnaround time, completion time, Response time and the average waiting time in the scheduler queue in milliseconds for this set of processes running on a system using each of the scheduling algorithms listed below? Show your work to get any or full points. Draw the Gant Chart and also write down the process execution state.
• Priority Algorithm (Non-Preemptive)
Note: each algorithm explains separately and Priority Colum just for Priority Scheduling Algorithm

Q.No.3. (05)
Consider the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds). For example, process P1 arrives 9 milliseconds after the start of the system;

Process

Arrival Time (ms)

Processing Time (ms)

P1

9

13

P2

5

16

P3

6

9

P4

7

4

P5

1

3

P6

10

9

Find the average turnaround time, completion time, Response time and the average waiting time in the scheduler queue in milliseconds for this set of processes running on a system using each of the scheduling algorithms listed below? Show your work to get any or full points.Draw the Gant Chart and also write down the process execution state.
1. Round Robin scheduling algorithm (quantum = 2 millisecond).

Q.No.4.
Consider the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds). For example, process P1 arrives 4 milliseconds after the start of the system;

Process

Arrival Time (ms)

Processing Time (ms)

P1

4

3

P2

5

6

P3

3

9

P4

2

4

P5

1

3

Find the average turnaround time, completion time, Response time and the average waiting time in the scheduler queue in milliseconds for this set of processes running on a system using each of the scheduling algorithms listed below? Show your work to get any or full points. Draw the Gant Chart and also write down the process execution state.
• Shortest Job First (preemptive).

Q.No.5

Suppose there is 2 copies of resource A, 3 copies of resource B and 3 copies of resource Suppose further that process 1 holds one unit of resources B and C and is waiting for a unit of A; that process 2 is holding a unit of A and waiting on a unit of B; and that process 3 is holding one unit of A, two unit of B and one unit of C. draw the resource allocation graph. Is the system is in deadlock state? Why or why not?

Q.No.6.

Explain what is thrashing in the context of memory. Propose a technique to reduce thrashing. Some computer system uses a virtual memory scheme with the following characteristics:
Type: Hierarchical Forward Mapped
Virtual Memory Address Width: 45 bits Page Size: 16K
Page Table Entry Size: 8 Bytes
Bits of Physical Frame Number in Page Table Entry: 40

Answer the following questions.

Q.No.1.
The description above is for binary semaphore which can take only two values 0 and 1 andensure the mutual exclusion. There is one other type of semaphore called counting semaphore which can take values greater than one.

Now suppose there is a resource whose number of instances is 4. Now we initialize S = 4 and rest is same as for binary semaphore. Whenever process wants that resource it calls P or wait function and when it is done it calls V or signal function. If the value of S becomes zero then a process has to wait until S becomes positive. For example, suppose there are 4 process P1, P2, P3, P4 and they all call wait operation on S (initialized with 4). If another process P5 wants the resource then it should wait until one of the four processes calls signal function and value of semaphore becomes positive. Show the working how the process enters into critical section and also show the working of process block state.

Q.No.2.
Considering a system with five processes P0 through P4 and three resources of type A, B, C. Resource type A has 10 instances, B has 5 instances and type C has 7 instances. Suppose at time t0 following snapshot of the system has been taken:

200_figure.jpg

Show the working of Process execution and also write down the process execution state.

Q.No.3.

203_figure1.jpg

Suppose there is 2 copies of resource A, 3 copies of resource B and 3 copies of resource Suppose further that process 1 holds one unit of resources B and C and is waiting for a unit of A; that process 2 is holding a unit of A and waiting on a unit of B; and that process 3 is holding one unit of A, two unit of B and one unit of C. draw the resource allocation graph and also convert into the table. Show the working of Process execution and also write down the process execution state. . Is the system is in deadlock state? Why or why not?

Q.No.4.

Consider we have Six processes P0, P1, . . . P5 and three resources A, B, and C. Is theExecuting the following processes in the safe state? Show the working.

1762_figure2.jpg

Reference no: EM132797430

Questions Cloud

Explain the superannuation fund will exercise the option : By entering into this option strategy, explain whether the superannuation fund will exercise the option if the spot price is above the exercise price.
What the premium and exercise price represent : If an investor believes the share price will increase to $15 over the next 3 months, how can the investor use a call option to benefit from their belief?
What is the balance in the income summary account : The owner's withdrawals account has a balance of $2,600. What is the balance in the income summary account after all closing entries are completed?
How much cash will marigold receive during may from customer : How much cash will Marigold receive during May from customers? Customer amounts on account are collected 65% in the month of sale and 35% in the following month
Explain what is thrashing in the context of memory : Draw the Gant Chart and also write down the process execution state and Explain what is thrashing in the context of memory. Propose a technique to reduce thrash
What is the consolidated total for equipment : During 2018, Strong bought inventory for $112,000 and sold it to Pride for $140,000. What is the consolidated total for equipment (net) at December
How much should be distributed to nora upon liquidation : Olga has personal assets of P1,500 that may, if necessary, be used to meet partnership obligations. How much should be distributed to Nora upon liquidation
What is cost average revenue and cost per unit : What is cost average revenue and cost per unit and what is the net average earning for each cabinet? Profits before Admin expenses 163000
What is the discounted pay back period of the project : What is the discounted pay back period of the project? You have been hired as a consultant for Pristine Urban-Tech Zither, Inc. (PUTZ)

Reviews

Write a Review

Operating System Questions & Answers

  Implementation of algorithms for process management

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.

  Develop a user mode command interpreter

Develop a user mode command interpreter which support list-short.

  Memory allocation in operating system

Analysis and implementation of algorithms for memory allocation in operating system, Explain First- t and best- t methods are used in memory allocation in operating systems.

  Stand alone child process

Forking the child process

  Write a multi-threaded program

Write a multi-threaded program to solve producer and consumer problem

  Marginal and average cost curves

n a competitive market place (pure competition) is it possible to continually sell your product at a price above the average cost of production.

  Simulating operating systems scheduling

Simulate the long-term scheduler, the short-term scheduler and the I/O scheduler of the computer using the First-Come-First-Serve algorithm.

  Issues with trusted platform module

Research paper discussing the issues with Trusted Platform Module (TPM)

  Threads

Explain a complication that concurrent processing adds to an operating system.

  Design and programming

Use the semaphore methods to control the concurrency of the solution

  Virtual machines

Virtual machines supported by a host operating system

  Discuss an application that benefits barrier synchronization

Discuss an application that would benefit from the use of barrier synchronization

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