Consider an environment in which there is a one-to-one mapping between user-level threads and kernel-level threads that allows one or more threads within a process to issue blocking system calls while other threads continue to run. Explain why this model can make multithreaded programs run faster than their single-threaded counterparts on a uniprocessor computer.

Question

Noel York

Computers & Technology

Yesterday, 22:41

Consider an environment in which there is a one-to-one mapping between user-level threads and kernel-level threads that allows one or more threads within a process to issue blocking system calls while other threads continue to run. Explain why this model can make multithreaded programs run faster than their single-threaded counterparts on a uniprocessor computer.

+1

Answers (1)

Know the Answer?

Copper · Answer 1

According to the situation mentioned in the question about the model that can make the multi threaded execution faster as compared with the single threaded counterparts programs because multi-threaded programs have the capability to execute simultaneously in multiple processes.

In this type of system, the blocking system cannot block the complete execution because kernel thread is present for every user thread. So, if one kernel thread gets blocked, others will still keep running.

Whereas, for uni-processor system, the program has to wait for the input - output operation completion for most of the time. Thus, multi-threaded program can execute faster than uni-processor.