Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for galvin
0
votes
1
answer
1
Abraham Silberschatz, Greg Gagne, Peter B. Galvin - Operating System Concepts-Wiley (2018), PART TWO PROCESS MANAGEMENT, Chapter 5 CPU Scheduling, Pg. 202.
Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...
Nam14
514
views
Nam14
asked
Apr 5, 2023
Operating System
operating-system
process-synchronization
galvin
+
–
1
votes
2
answers
2
Galvin Edition 9 Exercise 8 Question 12 (Page No. 391)
Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is an example of such allocated memory. What is required to support dynamic memory allocation in the following schemes ? $a$. Contiguous memory allocation $b$. Pure segmentation $c$. Pure paging
Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is an example of such allo...
akash.dinkar12
3.0k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
+
–
0
votes
1
answer
3
Galvin Edition 9 Exercise 10 Question 11 (Page No. 498-499)
Suppose that a disk drive has $5,000$ cylinders, numbered $0$ to $4,999$. The drive is currently serving a request at cylinder $2,150$, and the previous request was at cylinder $1,805$. The queue of pending requests, in $FIFO$ ... disk-scheduling algorithms ? $a. FCFS$ $b. SSTF$ $c. SCAN$ $d. LOOK$ $e. C-SCAN$ $f. C-LOOK$
Suppose that a disk drive has $5,000$ cylinders, numbered $0$ to $4,999$. The drive is currently serving a request at cylinder $2,150$, and the previous request was at cy...
akash.dinkar12
626
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
1
answer
4
Galvin Edition 9 Exercise 8 Question 20 (Page No. 392)
Assuming a $1$ $KB$ page size, what are the page numbers and offsets for the following address references (provided as decimal numbers): $a. 3085$ $b. 42095$ $c. 215201$ $d. 650000$ $e. 2000001$
Assuming a $1$ $KB$ page size, what are the page numbers and offsets for the following address references (provided as decimal numbers):$a. 3085$$b. 42095$$c. 215201$$d. ...
akash.dinkar12
1.7k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
+
–
0
votes
2
answers
5
Galvin Edition 9 Exercise 8 Question 3 (Page No. 390)
Why are page sizes always powers of 2 ?
Why are page sizes always powers of 2 ?
akash.dinkar12
240
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
1
votes
1
answer
6
Galvin Edition 9 Exercise 3 Question 1 (Page No. 149)
#include <sys/types.h> #include <stdio.h> #include <unistd.h> int value = 5; int main() { pid t pid; pid = fork(); if (pid == 0) { /* child process */ value += 15; return 0; } else if (pid > 0) { /* ... ;PARENT: value = %d",value); /* LINE A */ return 0; } } Explain what the output will be at LINE A in this program.
#include <sys/types.h #include <stdio.h #include <unistd.h int value = 5; int main() { pid t pid; pid = fork(); if (pid == 0) { /* child process */ value += 15; return 0;...
akash.dinkar12
935
views
akash.dinkar12
asked
Mar 19, 2019
Operating System
galvin
operating-system
process
programming
fork-system-call
+
–
1
votes
1
answer
7
Galvin Edition 9 Exercise 8 Question 27 (Page No. 393)
Explain why sharing a reentrant module is easier when segmentation is used than when pure paging is used.
Explain why sharing a reentrant module is easier when segmentation is used than when pure paging is used.
akash.dinkar12
796
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
1
answer
8
Galvin Edition 9 Exercise 1 Question 21 (Page No. 51)
Some computer systems do not provide a privileged mode of operation in hardware. Is it possible to construct a secure operating system for these computer systems ? Give arguments both that it is and that it is not possible.
Some computer systems do not provide a privileged mode of operation in hardware. Is it possible to construct a secure operating system for these computer systems ? Give a...
akash.dinkar12
985
views
akash.dinkar12
asked
Mar 19, 2019
Operating System
galvin
operating-system
descriptive
+
–
0
votes
2
answers
9
Galvin Edition 9 Exercise 7 Question 17 (Page No. 343)
Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free.
Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is dea...
akash.dinkar12
4.3k
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
10
Galvin Edition 9 Exercise 7 Question 22 (Page No. 343)
Consider the following snapshot of a system: $Allocation$ $Max$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $P_0$ $3$ $0$ $1$ $4$ $5$ $1$ $1$ $7$ $P_1$ $2$ $2$ $1$ $0$ $3$ $2$ $1$ $1$ $P_2$ $3$ $1$ $2$ $1$ $3$ ... processes may complete.Otherwise, illustrate why the state is unsafe. $a$. $Available$ $=$ $(0, 3, 0, 1)$ $b$. $Available$ $=$ $(1, 0, 0, 2)$
Consider the following snapshot of a system: $Allocation$ $Max$ $A$ $B...
akash.dinkar12
5.3k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
11
Galvin Edition 9 Exercise 4 Question 2 (Page No. 191)
What are two differences between user-level threads and kernel-level threads ? Under what circumstances is one type better than the other ?
What are two differences between user-level threads and kernel-level threads ? Under what circumstances is one type better than the other ?
akash.dinkar12
4.1k
views
akash.dinkar12
asked
Mar 19, 2019
Operating System
galvin
operating-system
threads
descriptive
+
–
1
votes
1
answer
12
Galvin Edition 9 Exercise 7 Question 23 (Page No. 344)
Consider the following snapshot of a system: $Allocation$ $Max$ $Available$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $P_0$ $2$ $0$ $0$ $1$ $4$ $2$ $1$ $2$ $3$ $3$ $2$ $1$ $P_1$ $3$ $1$ ... $c$. If a request from process $P_4$ arrives for $(0, 0, 2, 0)$, can the request be granted immediately?
Consider the following snapshot of a system: $Allocation$ $Max$ ...
akash.dinkar12
2.4k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
13
Galvin Edition 9 Exercise 9 Question 34 (Page No. 455)
Consider the parameter$\triangle$ used to define the working-set window in the working-set model. When $\triangle$ is set to a small value, what is the effect on the page-fault frequency and the number of active (non suspended) processes currently executing in the system ? What is the effect when $\triangle$ is set to a very high value ?
Consider the parameter$\triangle$ used to define the working-set window in the working-set model. When $\triangle$ is set to a small value, what is the effect on the page...
akash.dinkar12
1.2k
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
virtual-memory
descriptive
+
–
0
votes
3
answers
14
Galvin Edition 9 Exercise 4 Question 15 (Page No. 193)
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? b. How many unique threads are created?
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 ...
akash.dinkar12
897
views
akash.dinkar12
asked
Mar 19, 2019
Operating System
galvin
operating-system
threads
programming
+
–
0
votes
1
answer
15
Galvin Edition 9 Exercise 5 Question 6 (Page No. 243)
Illustrate how a binary semaphore can be used to implement mutual exclusion among n processes.
Illustrate how a binary semaphore can be used to implement mutual exclusion among n processes.
akash.dinkar12
3.2k
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
process-synchronization
descriptive
+
–
1
votes
1
answer
16
Galvin Edition 9 Exercise 8 Question 21 (Page No. 392)
The BTV operating system has a $21-bit$ virtual address, yet on certain embedded devices, it has only a $16-bit$ physical address. It also has a $2-KB$ page size. How many entries are there in each of the following ? $a$. A conventional, single-level page table $b$. An inverted page table
The BTV operating system has a $21-bit$ virtual address, yet on certain embedded devices, it has only a $16-bit$ physical address. It also has a $2-KB$ page size. How man...
akash.dinkar12
2.2k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
+
–
0
votes
1
answer
17
Galvin Edition 9 Exercise 7 Question 3 (Page No. 340)
Consider the following snapshot of a system: $Allocation$ $Max$ $Available$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $P_0$ $0$ $0$ $1$ $2$ $0$ $0$ $1$ $2$ $1$ $5$ $2$ $0$ $P_1$ $1$ $0$ $0$ ... $Need$ ? b. Is the system in a safe state ? c. If a request from process $P_1$ arrives for $(0,4,2,0)$, can the request be granted immediately ?
Consider the following snapshot of a system: $Allocation$ $Max$ $Available$ ...
akash.dinkar12
2.2k
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
18
Galvin Edition 9 Exercise 9 Question 14 (Page No. 452)
Assume that a program has just referenced an address in virtual memory. Describe a scenario in which each of the following can occur. (If no such scenario can occur, explain why.) • $TLB$ miss with no page fault • $TLB$ miss and page fault • $TLB$ hit and no page fault • $TLB$ hit and page fault
Assume that a program has just referenced an address in virtual memory. Describe a scenario in which each of the following can occur. (If no such scenario can occur, expl...
akash.dinkar12
2.4k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
virtual-memory
translation-lookaside-buffer
descriptive
+
–
0
votes
1
answer
19
Galvin Edition 9 Exercise 4 Question 11 (Page No. 192)
Is it possible to have concurrency but not parallelism ? Explain.
Is it possible to have concurrency but not parallelism ? Explain.
akash.dinkar12
515
views
akash.dinkar12
asked
Mar 19, 2019
Operating System
galvin
operating-system
threads
descriptive
+
–
1
votes
1
answer
20
Galvin Edition 9 Exercise 8 Question 25 (Page No. 393)
Consider a paging system with the page table stored in memory. a. If a memory reference takes 50 nanoseconds, how long does a paged memory reference take ? b. If we add $TLBs$, and 75 percent of all page-table references are found ... time ? (Assume that finding a page-table entry in the $TLBs$ takes 2 nanoseconds, if the entry is present.)
Consider a paging system with the page table stored in memory.a. If a memory reference takes 50 nanoseconds, how long does a paged memory reference take ?b. If we add $TL...
akash.dinkar12
655
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register