Register

Recent questions tagged process-and-threads

272
views
1 answers
0 votes
ISRO 2024
Which of the following multithreading model is followed in Linux OS?One User Thread mapping to One Kernel ThreadMany User Threads mapping to One Kernel ... mapping to Many Kernel ThreadsMany User Threads mapping to Many Kernel Threads
User Avatar
328
views
1 answers
0 votes
Test Series
$\text{ Anyone please explain : }$
User Avatar
433
views
1 answers
1 votes
DRDO CSE 2022 Paper 2 | Question: 5
The figure shown below indicates a thread's movement between $3$ states (i.e., run, ready, and blocked). Explain what causes each arrow? Say $\text{N/A}$ if it doesn't happen.
User Avatar
870
views
0 answers
1 votes
Fork System Call and Threads | OS | MSQ
MSQ Consider the following statements, which one of the following is/are TRUEIn fork() system call, child process inherits all the open file descriptors of ... of the parent process User level threads shares the code segment of the process
User Avatar
614
views
1 answers
3 votes
Made easy test series
Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are ... .D)P is in ready state and a thread of P is in running state..
User Avatar
976
views
2 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 23
Which two are valid constructions for Thread?Thread(Runnable r, String name)Thread()Thread(int priority)Thread(Runnable r, ThreadGroup g)Thread(Runnable r, int priority) $1$ and $3$2$ and $4$1$ and $2$2$ and $5$
User Avatar
380
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 65 (Page No. 180)
Implement a program to count the frequency of words in a text file. The text file is partitioned into $N$ segments. Each segment is processed by ... it computes the consolidated word-frequency data based on the individual threads' output.
User Avatar
389
views
0 answers
1 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 64 (Page No. 179 - 180)
The objective of this exercise is to implement a multithreaded solution to find if a given number is a perfect number. $N$ is a perfect number if the sum of all ... by restricting the numbers searched from $1$ to the square root of $N.)$
User Avatar
342
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 63 (Page No. 179)
A process can be put into a round-robin queue more than once to give it a higher priority. Running multiple instances of a program each working on a different ... processes, you should be able to grab a bigger share of the CPU this way.
User Avatar
740
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 62 (Page No. 179)
Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard ... one number every minute because the I/O could affect the race conditions.
User Avatar
236
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 61 (Page No. 179)
Rewrite the program of Fig. $2-23$ to handle more than two processes.
User Avatar
816
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 60 (Page No. 179)
Suppose that a university wants to show off how politically correct it is by applying the U.S. Supreme Court's Separate but equal is ... woman_leaves, man_leaves. You may use whatever counters and synchronization techniques you like.
User Avatar
366
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 59 (Page No. 179)
Solve the dining philosophers problem using monitors instead of semaphores.
User Avatar
375
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 58 (Page No. 179)
Assume that you have an operating system that provides semaphores. Implement a message system. Write the procedures for sending and receiving messages.
User Avatar
209
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 57 (Page No. 178 - 179)
Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding $1$ to it, and then appending it to the file. Run ... to prevent the race.(Hint: use ln file file.lock to lock the data file.)
User Avatar
321
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 56 (Page No. 178)
The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different ... to access the database, and what happens when a process is finished.
User Avatar
200
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 55 (Page No. 178)
Consider the procedure put forks in Fig. $2-47$. Suppose that the variable $state[i]$ was set to THINKING after the two calls to test, rather than before. How would this change affect the solution?
User Avatar
197
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 54 (Page No. 178)
In the solution to the dining philosophers problem (Fig. $2-47$), why is the state variable set to HUNGRY in the procedure take_forks?
User Avatar
619
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 53 (Page No. 178)
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.
User Avatar
1.4k
views
1 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 52 (Page No. 178)
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each frame requiring $20$ msec of CPU time. Is this system schedulable?
User Avatar
567
views
0 answers
1 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 51 (Page No. 178)
In the dining philosophers problem, let the following protocol be used: An even-numbered philosopher always picks up his left fork before picking up his ... picking up his left fork. Will this protocol guarantee deadlock-free operation?
User Avatar
3.0k
views
2 answers
1 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 50 (Page No. 178)
A soft real-time system has four periodic events with periods of $50, 100, 200,$ and $250$ ... , respectively. What is the largest value of $x$ for which the system is schedulable?
User Avatar
2.3k
views
1 answers
1 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 49 (Page No. 178)
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the prediction of the next time?
User Avatar
321
views
0 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 48 (Page No. 178)
For the above problem, can another video stream be added and have the system still be schedulable?
User Avatar
Page: