retagged by
1,339 views
0 votes
0 votes

The time taken to switch between user and kernel modes of execution be $t1$ while the time taken to switch between two processes be $t2$. Which of the following is TRUE?

  1. $t1>t2$
  2. $t1=t2$
  3. $t1<t2$
  4. nothing can be said about the relation between $t1$ and $t2$
retagged by

2 Answers

0 votes
0 votes
→ A context switch (also sometimes referred to as a process switch or a task switch) is the switching of the CPU (central processing unit) from one processor thread to another.
→ Context switches can occur only in kernel mode. Kernel mode is a privileged mode of the CPU in which only the kernel runs and which provides access to all memory locations and all other system resource
→ Other programs, including applications, initially operate in user mode, but they can run portions of the kernel code via system calls
→ The existence of these two modes in Unix-like operating systems means that a similar, but simpler, operation is necessary when a system call causes the CPU to shift to kernel mode. This is referred to as a mode switch rather than a context switch, because it does not change the current process.
→ Context switch between the processes involves mode switch also.
Answer:

Related questions

0 votes
0 votes
4 answers
1
admin asked Mar 30, 2020
2,460 views
Consider the following four processes with their corresponding arrival time and burst time:$$\begin{array} \text{Process}&\text{Arrival time}&\text{Burst time(in ms)}\\ \...
1 votes
1 votes
2 answers
2
admin asked Mar 30, 2020
3,201 views
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory?Reference bitDirty bitTag ...
0 votes
0 votes
3 answers
3
admin asked Mar 30, 2020
1,126 views
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlockCan never occurHas to occurMay occurNone of the options
0 votes
0 votes
2 answers
4
admin asked Mar 30, 2020
1,920 views
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are$9$...