Ask Question, Ask an Expert

+1-415-315-9853

info@mywordsolution.com

Ask Operating System Expert

Basic problems:

1) Assume we have 3 processes running at the same time as shown in the following table. Each resource only has one instance.

i) Show a possible situation of resource allocation which results in deadlock. Use a resource allocation graph to show the scenario.

ii) To prevent the possibility of any deadlock, you might alter the order of getting resource requests of some process. Describe how and why. You could also use a resource allocation graph to  justify the answer.

     P1                                        P2                                      P3
while (1) {                               while (1) {                           While (1)
          get(A);                           get(D);                                get(C);
          get(B);                            get(E);                                get(F);
          get(C);                            get(B);                               get(D);
          // critical region                 // critical region                  // critical region
          // use A, B, C                     // use D, E, B                     // use C, F, D
          release(A);                           release(D);                        release(C);
          release(B);                         release(E);                         release(F);
          release(C);  }                       release(B);    }                  release(D);}

2) Consider the following snapshot of the system, answer the following problems using the banker's algorithm:

i) What is the content of the matrix Need? Is the system in a safe state?

ii) If a request from Process P1 arrives for (0,4,2,0), can the request be granted immediately?

(Please show the middle steps besides final answer)

Process    Allocation ABCD    Max ABCD    Available ABCD

P0              0 0 1 2              0 0 1 2         1 5 2 0

P1              1 0 0 0              1 7 5 0

P2              1 3 5 4              2 3 5 6

P3              0 6 3 2              0 6 5 2

P4              0 0 1 4               0 6 5 6

3) Compare contiguous-memory allocation with pure paging in the following aspects:

i) In support of dynamic memory allocation: most systems allow programs to allocate more memory to its address space during execution.  Heap and stack are exs of such allocated memory.

ii) External fragmentation and internal fragmentation.

iii) Ability to share code across processes.

4) Consider a computer system with a 32-bit logical address and 4KB page size. The system supports up to 512MB of physical memory. How many entries are there in a conventional single-level page table? How many entries are there in an inverted page table? What are the page numbers and offsets for the following address references: a) 30000, b) 256, c) 0xbcf034

5) Consider the following C program where M, N, K are predefined constants. Suppose int is 4 bytes. Assume this program is run on a machine with 4KB page size and 32 TLB entries. Firstly, TLB is empty. FIFO is used as the replacement algorithm for TLB. 
int X[N];
for (int k = 0; k < K; k++)
   for (int i = 0; i < N; i += M) 
       X[i] = random(); //generate some random number

a) If K is 1, what values of M and N will cause a TLB miss for every access of array X. describe why.

b) If K is a very large number, what values of M and N will cause TLB miss for every access of array X. describe why. 

6) Assume a logical address space is 1KB, and the page-size is 16 bytes. Suppose no page is in the main memory for this process at first and the pure demand paging is used. present free frame list is {2,5,8,1,…}.  The first frame in the free frame list would be used whenever needed. Assume TLB has two entries. Both TLB and page table are empty initially. FIFO is used as TLB replacement algorithm. Assume the following logical address is accessed in order: 0x3d,0x30,0xe5,0x7d, 0x33, 0xef. For each of the following address access:

i) State the physical address which is mapped to it.

ii) Assume it takes 10 ns to access TLB, and 100ns to access memory, and 8ms to handle page fault. How long time it takes to access this address?
(Please show the intermediate steps besides final answer)

7) Suppose 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 is minimum number of page faults for the optimal page replacement strategy? Please show how the page is placed and how page faults occur.

b) How many page faults occur using LRU? Please show how the page is placed and how page faults occur.

8) Consider a demand-paging system with the following time-measured utilizations:   CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this mean? How to improve CPU utilization (Think about both hardware solutions and software solutions). Describe why.  List at least 3 possible solutions.

Operating System, Computer Science

  • Category:- Operating System
  • Reference No.:- M91143

Have any Question? 


Related Questions in Operating System

Operating system assignmentpart onetopic- operating system

Operating System Assignment Part One Topic- Operating system support for mobile computing Submission Rquirements Project Proposal 1 page 1- Pages - 8 to 10 2- Power point slides 3-The project description document which e ...

Questionwhen designing a kernel with rudimentary

Question: When designing a kernel with rudimentary functionality, what are the required services? Justify your answer and provide an example. provide atleast 15 lines. do the best. need reference which is good.

Foundations of informationsthere are so many operating

Foundations of Informations There are so many operating systems available in the market that it's difficult to decide which one is the best. Search the Internet for information on the following operating systems, and dra ...

Operating systems assignmentwe have just 3 processes p1 p2

Operating Systems Assignment We have just 3 processes, P1, P2 and P3, and they arrive at 1, 15 and 23 milliseconds respectively, and they each have two CPU Burst as follows (there are no I/O Bursts). P1: 10 3 P2: 5 12 P3 ...

Programming assignment lab schedulerdispatcheryou are to

Programming Assignment Lab: Scheduler/Dispatcher You are to implement a Scheduler in C, C++ and submit the source code, which we will compile and run. Both are to be delivered to the TA as source code through NYU Classes ...

Questionin the context of the os design discussions there

Question: In the context of the OS design discussions there is a dependence on the goal of the system and the environment. This is a very important aspect of any systems design. One can argue for or against a function, b ...

Question what is operating research and its application and

Question: What is operating research and its application and scope of operating research

Assignmentinstructions please answer all questions in your

Assignment Instructions: Please answer all questions in your own words Part I: Questions 1. In terms of porting UNIX, what part of the UNIX OS requires modification? why? 2. As a system administrator, how do you deal wit ...

Problemnbspdescriptionflash back to flash forward see

Problem  Description: Flash Back to Flash Forward (see Chapter 1 Practice Exercise 1.2 and the OS in DevOps Discussion Area) While having a discussion with your OS DevOps team, you are approached with the situation: our ...

This research paper will focus on issues and concerns with

This research paper will focus on issues and concerns with Patch Management. With the advent of many types of software and systems, patch management is major nightmare. Patching the system may cause the system to crash, ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen