Problem 1: Discuss the differences between the OS Startup Procedure and the Bootstrap Procedure. In class we discussed "OS Start Up" and "The OS Boot-strap Procedure". Write a half-page or at most one-page typed essay that talks about the following points: (a) list all the steps in the OS startup procedure, (b) list all the steps in the bootstrap procedure, (c) why is it advantages to separate the "turning on of the computer" into these two different procedures, (d) identify a service that is launched at bootstrap and a service that is launched at OS startup, and discuss how these 'kinds" of services are fundamentally different from one another?
Problem 2: Answer the following questions given this scenario:
Assume an operating system manages a CPU with 2 cores. Core alpha is used for "regular" processes, while core beta is used for "real-time processes. The OS uses kernel threads. Five kernel threads are used by alpha and one dedicated kernel thread is used by beta. Each executing process has a PCB and the PCB has a flag indicating whether it is a real-time process or not. There are 10 processes running at this moment. Two of the ten processes are real-time.
(a) Draw the architecture of the ready queue and populate it with the 10 processes (p0, p1, p9 - assume p8 and p9 are real-time).
(b) Describe, in a paragraph, how the kernel threads are shared with the processes.
(c) What problem do you expect, given this scenario, for the real-time processes?
(d) What thread model is being used in this case study?
Problem 3: Assume we have the following situation: a ready queue is populated with 5 processes (p0,p1,p2,p3,p4). Process p0 is running. Process p1 is at the head of the queue and process p4 is at the tail of the queue, and the processes are all ordered, at the beginning, numerically. Process p0 is just about to start running. This is a time sharing OS where each process can use the CPU for a full quanta before it is returned round-robin to the ready queue. Assume there is no wait list. Assume there are no other interrupts or events effecting this case study. Assume all processes need to run for 5 quanta. Assume 100 quanta occurs in 1 second.
Answer the following questions:
(a) What is the throughput?
(b) What is the turnaround time (measured in quanta)?
(c) What is the wait time (measured in quanta)?
(d) Using Little's formula and assuming that new processes arrive on a regular basis after each 10 quanta, is this ready queue stable?
Problem 4: In a virtual memory system, computing the real address from a virtual address needs to happen as quickly as possible, while at the same time respecting security issues. Given all the "Page Addressing' slides we looked at in this course, answer the following questions:
(a) Draw a flowchart (not a circuit diagram) that demonstrates how to convert a virtual address into a real address taking care of the following: protecting the OS code from pointer references, protecting other programs from pointer references from other processes, while NOT using a paging memory model.
(b) Repeat (a) but WITH a paging memory model.
(c) Draw the page addressing hardware that completely describes (b).
NOTE: In all your answers optimality is important.
Problem 5: Assume a hard disk is formatted to store files in blocks. Assume it has a File Allocation Table that implements iNodes. Assume it has a bit string that implements free space.
Answer the following questions:
(a) Assume the free space bit string became corrupted. How can we rebuild it given this case study?
(b) If each block stores 10 bytes and we have a 100 byte file. Compare the run-time, using the number of times we need to access a block as our measure, between iNode file storage method and linked block storage method, if we want to get to the 90th byte
(c) What is the maximum size of a file in bytes, given each block can store 10 bytes and the iNode has 3 direct block pointers, 1 single indirect block pointer, and 1 double indirect block pointer. Each indirect block has 3 direct block pointers.
All the tutors of our OS Startup Procedure and Bootstrap Procedure Assignment Help service didn't bother with the complexity of the academic tasks and provide the best possible solutions that no one in the industry can provide.
Tags: OS Startup Procedure and Bootstrap Procedure Assignment Help, OS Startup Procedure and Bootstrap Procedure Homework Help, OS Startup Procedure and Bootstrap Procedure Coursework, OS Startup Procedure and Bootstrap Procedure Solved Assignments