Register
Webpage for Operating System

Recent questions tagged operating-system

0 votes
0 answers
902
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
907
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
910
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
911
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
919
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
920
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
1 votes
0 answers
924
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 10 (Page No. 174)
In the text it was stated that the model of Fig. $2-11(a)$ was not suited to a file server using a cache in memory. Why not? Could each process have its own cache?
In the text it was stated that the model of Fig. $2-11(a)$ was not suited to a file server using a cache in memory. Why not? Could each process have its own cache?
User Avatar
1 votes
2 answers
926
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 8 (Page No. 174)
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. What will be the CPU utilization?
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. ...
User Avatar
0 votes
1 answer
929
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 5 (Page No. 174)
A computer system has enough room to hold five programs in its main memory. These programs are idle waiting for I/O half the time. What fraction of the CPU time is wasted?
A computer system has enough room to hold five programs in its main memory. These programs are idle waiting for I/O half the time. What fraction of the CPU time is wasted...
User Avatar
2 votes
1 answer
930
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 4 (Page No. 174)
When an interrupt or a system call transfers control to the operating system, a kernel stack area separate from the stack of the interrupted process is generally used. Why?
When an interrupt or a system call transfers control to the operating system, a kernel stack area separate from the stack of the interrupted process is generally used. Wh...
User Avatar
Page: