Search for question
Question

What's the difference between user

space and kernel space? Where would a

command line interface (shell) reside and

why?


Most Viewed Questions Of Operating System

This question is about space allocation method for files on a magnetic hard drive. a. Contiguous allocation is a way of allocate blocks to files. However, it can suffer from over or under estimation. Describe one problem that each will cause. . Another way of allocation is to used linked blocks. The slides suggest using FAT (file allocation table) to improve the performance. How can FAT improve the performance?


5. (16 points) Consider deadlock avoidance with single resources. Assuming we have 4 process P1,P2, P3, P4. and 4 resources r1, r2, r3, r4. Consider all| 4 processes are writers (i.e. no resource scan be shared among processes). Suppose the processes are to acquire and release the release the resources in the following order (and assume the OS has the complete knowledge of the schedule beforehand) – we only show the first 8 requests. We also assume the following: if a request is denied, the process immediately quits and release all resources it is holding/waiting (if any). if a process have to wait for a resource (if another process is holding it), the avoidance algorithm can still grant the request and allow that process to wait all waiting queues for each resources are FIFO a.Draw the resource allocation graph before the first request is made b. Will the third request (P3 request r3) be granted? Explain your answer using the resource allocation graph. c. Is there any request after that one that will be denied? If so, show the first request that will be denied and explain why using the resource allocation graph. If not, show the request allocation graph at the of the 8-th request.


Consider the following code segment:     pid_t pid;     pid = fork();     if (pid == 0) { /* child process */         fork();         thread create( . . .);     }     fork();   a. How many unique processes are created? Explain.  b. How many unique threads are created? Explain.


This assignment includes two closely related (and reasonably short) papers, a landmark paper from Peter Denning describing working set theory and a paper from Carr and Hennessy on virtual memory management. Note that Hennessy is the other co-author of our Computer Architecture text. As usual, provide a summary and your reaction for each paper. Please refer back to the first couple of assignments and announcements for reaction expectations, this is a separate section of your report that is just as important as the summary. Peter Denning, "The Working Set Model for Program Behavior", Communications of the ACM, 1968. Richard Carr and John Hennessy, "WSClock -- A Simple and Effective Algorithm for Virtual Memory Management", Proceedings of the Symposium on Operating Systems Principles, 1981.


  Can a multithreaded solution using multiple user-level threads with one kernel thread achieve better performance on a multiprocessor system than on a single processor system? Explain. Assume this process is the only one running on the system.


Q2. Consider a logical address space of 256 pages with a 4-KB page size, mapped onto a physical memory of 64 frames. a) How many bits are required in the logical address? b) How many bits are required in the physical address?


Problem 1.4 Background: Excel uses specific syntax to represent functions (such as those shown below) into an Excel workbook sheet. Problem: Input the below expressions into the indicated calculation tables and substitute x for the the values: -1, 0, 3, and A. What are the outputs from excel, are there any errors? If so, what do they mean? Cite any reference used. Example: f(x) = x + 1 Expression 1. f(x) = 2*+15 Expression 2. f(x) = x! Expression 3. f(x) = e-5x Expression 4. f(x) = log5 (x - 2)


Problem 1.2 Answer the below survey questions about your experience and computer for this class. A. What kind of computer will you be using primarily for this class? (laptop, desktop, computer lab) B. What is the operating system on your computer? C. Will you be able to bring your laptop to class on Mondays/Wednesdays? D. Do you have experience using Excel? E. Do you have experience using Python? F. If so, briefly describe the scope of your experience with Python. G. Do you have experience using VBA? H. If so, briefly describe the scope of your experience with VBA.


Part 2 is a variant of the classic reader-writer problem. Part 1's specification does not require strict alternating of writers and readers. As a result, some updates of the writers may be missed by readers. And some contents may be read more than once. Part 2's setup, on the other hand, will result in strict alternating between writers and reader. In Part 2, we assume that we will have many writers, and one reader. The one reader reads from the shared string and prints the contents to the standard output. Several writers write to the same shared string. Only one writer can write to the string at any time. And once any writer writes, the reader should display it before other writers change the contents. In some sense, the reader is like a display server that displays the contents of the buffer.


Problem 1.3 Office hours will be offered every week with both the professor and the TAs. These will be scheduled avoiding student class conflicts to the degree possible. Go to the below when2meet link. Sign in using an arbitrary but unique 5 digit number as your name. Select the times that are not in conflict with your other classes or other regularly scheduled obligations. https://www.when2meet.com/?18345682-IYhV4 Indicate the number you used below. What was your number on When2Meet?