Register

Recent questions tagged descriptive

0 votes
1 answer
903
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 41 (Page No. 177)
Can a measure of whether a process is likely to be CPU bound or I/O bound be determined by analyzing source code? How can this be determined at run time?
Can a measure of whether a process is likely to be CPU bound or I/O bound be determined by analyzing source code? How can this be determined at run time?
User Avatar
5 votes
8 answers
905
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 39 (Page No. 177)
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); } How many child processes are created upon execution of this program?
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); }How many child processes are created upon execution of this program?
User Avatar
0 votes
0 answers
912
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 32 (Page No. 176)
Show how counting semaphores (i.e., semaphores that can hold an arbitrary value) can be implemented using only binary semaphores and ordinary machine instructions.
Show how counting semaphores (i.e., semaphores that can hold an arbitrary value) can be implemented using only binary semaphores and ordinary machine instructions.
User Avatar
0 votes
1 answer
917
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 27 (Page No. 175)
In a system with threads, is there one stack per thread or one stack per process when user-level threads are used? What about when kernel-level threads are used? Explain.
In a system with threads, is there one stack per thread or one stack per process when user-level threads are used? What about when kernel-level threads are used? Explain....
User Avatar
0 votes
0 answers
920
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 24 (Page No. 175)
Does Peterson’s solution to the mutual-exclusion problem shown in Fig. $2-24$ work when process scheduling is preemptive? How about when it is nonpreemptive?
Does Peterson’s solution to the mutual-exclusion problem shown in Fig. $2-24$ work when process scheduling is preemptive? How about when it is nonpreemptive?
User Avatar
0 votes
0 answers
921
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 23 (Page No. 175)
Does the busy waiting solution using the turn variable (Fig. $2-23$) work when the two processes are running on a shared-memory multiprocessor, that is, two CPUs sharing a common memory?
Does the busy waiting solution using the turn variable (Fig. $2-23$) work when the two processes are running on a shared-memory multiprocessor, that is, two CPUs sharing ...
User Avatar
0 votes
1 answer
929
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 15 (Page No. 175)
Why would a thread ever voluntarily give up the CPU by calling thread yield? After all, since there is no periodic clock interrupt, it may never get the CPU back.
Why would a thread ever voluntarily give up the CPU by calling thread yield? After all, since there is no periodic clock interrupt, it may never get the CPU back.
User Avatar
0 votes
2 answers
930
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 14 (Page No. 175)
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.
User Avatar
Page: