Question

In the discussion of ULTs versus KLTs, it was pointed out that a disadvantage of ULTs...

In the discussion of ULTs versus KLTs, it was pointed out that a disadvantage of ULTs is that when a ULT executes a system call, not only is that thread blocked, but also all of the threads within the process are blocked. Why is that so?

0 0
Add a comment Improve this question Transcribed image text
✔ Recommended Answer
Answer #1

Yes, We have observed in the discussion of ULTs versus KLTs, that it was pointed out that a disadvantage of ULTs is that when a ULT executes a system call, not only is that thread blocked, but also all of the threads within the process are blocked.

Because

The user process functions separately from Kernel processes.
It is a kind of thread structure process, So it is not visible to the OS/kernel, which schedules on the basis of processes.

Here According to me the book says that:

" The kernel continues to schedule the process as a unit and assigns a single execution state like the thread will be in (Ready, Running, Blocked, etc.) to that process "

If unfortunately one thread is blocked, then the whole process is going to get blocked and parallely all threads in that process are going to get blocked.

Add a comment
Know the answer?
Add Answer to:
In the discussion of ULTs versus KLTs, it was pointed out that a disadvantage of ULTs...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Similar Homework Help Questions
  • QUESTION 19 Explain Many-to-many thread mapping techniques and write-down advantage and disadvantage. QUESTION 20 Convoy effect...

    QUESTION 19 Explain Many-to-many thread mapping techniques and write-down advantage and disadvantage. QUESTION 20 Convoy effect is condition when long processes are scheduled to be after the short processes. True False 1 points    QUESTION 21 Threads can share files and stacks True False 1 points    QUESTION 22 A process in the waiting queue can start running immediately after it receives the response from IO devices. True False 1 points    QUESTION 23 A computer cannot understand source code...

  • TRUE-FALSE     Basic synchronization principles and multithreading 1. Java user threads can implement both busy-waiting and no-busy-waiting...

    TRUE-FALSE     Basic synchronization principles and multithreading 1. Java user threads can implement both busy-waiting and no-busy-waiting policy. 2. Priority inversion avoids deadlocks. 3. Spinlock mutex can be used as an adaptive mutex. 4. Java RTE can be blocked for Input/Output operation. 5. Interrupted user thread, which executes a method in a monitor, must be rolled back to undo any changes it performed. 6. The synchronization primitive by disabling interrupts can be used by an application program. 7. Bounded-waiting requirement is...

  • (after a Stallings problem) Assume at time 5, no system resources are being used except the...

    (after a Stallings problem) Assume at time 5, no system resources are being used except the processor and memory. Given this, consider this sequence of events: at time = 5: P1 executes a command to read from disk unit 3; at time = 15: P5’s time slice expires; at time = 18: P7 executes a command to write to disk unit 3; at time = 20: P3 executes a command to read from disk unit 2; at time = 24:...

  • The figure shows an approximate plot of stress versus strain for a spider-web thread, out to...

    The figure shows an approximate plot of stress versus strain for a spider-web thread, out to the point of breaking at a strain of 2.25. The vertical axis scale is set by a = 0.130 GN/m2,b = 0.500 GN/m2, and c = 0.720 GN/m2. Assume that the thread has an initial length of 0.840 cm, an initial cross-sectional area of 4.00 × 10-12 m2, and (during stretching) a constant volume. The strain on the thread is the ratio of the...

  • Please show also the work. Thank you. (after a Stallings problem) Assume at time 5, no...

    Please show also the work. Thank you. (after a Stallings problem) Assume at time 5, no system resources are being used except the processor and memory. Given this, consider this sequence of events: at time = 5: P1 executes a command to read from disk unit 3; at time = 15: P5's time slice expires; at time = 18: P7 executes a command to write to disk unit 3; at time = 20: P3 executes a command to read from...

  • Question III This question carries 20% of the marks for this assignment. Given the following mix...

    Question III This question carries 20% of the marks for this assignment. Given the following mix of tasks, task lengths and arrival times, compute the completion [5 marks and response time time from the arrival to the finish time) (5 marks for each task, along with the average response time for the FIFO. RR and SJF algorithms. Assume a time slice of 10 milliseconds and that all times are in milliseconds. You are kindly asked to provide the Gantt Chart...

  • detail for solution Dr. Oz then pointed out the part that "really caught my attention." "They...

    detail for solution Dr. Oz then pointed out the part that "really caught my attention." "They did CT scans of the chest in all the patients. All the patients had pneumonia when they started. Over the course of the five-day treatment with the hydroxychloroquine and 55 percent of the control population where they just got the normal therapy there was resolve and resolution of the pneumonia in 81 percent of the patients on the hydroxychloroquine, there was improvement in the...

  • In this assignment, you will implement a Memory Management System(MMS). Using C Programming Language..... MAKE SURE...

    In this assignment, you will implement a Memory Management System(MMS). Using C Programming Language..... MAKE SURE YOU USE C PROGRAMMING Your MMS will handle all requests of allocation of memory space by different users (one thread per user) …. HINT(You will use Pthreads and Semaphores). Your MMS will provide the user with an interface for making memory requests and also for freeing up memory that is no longer needed by the user. One of the jobs of your memory management...

  • operating system engineering , please read the question and solve on the given skeleton code ....

    operating system engineering , please read the question and solve on the given skeleton code . Write a multi-threaded program with Semaphores as counters and pthread_mutex_t mutex to solve the producer-consumer problem: A bounded buffer is simply a global integer array of size N (2) which can be accessed by multiple threads. • Create two types of threads - Producer (2) and Consumer (2). Producers will write to the buffer, and the consumers will read the buffer. In this scenario,...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT