Table provides the details of three processes that are executed in a uniprocessor system that supports...

Transcribed Image Text:

Table provides the details of three processes that are executed in a uniprocessor system that supports multithreading. Process P1 has two threads while processes P2 and P3 have one thread each. Time slicing is exploited to carrying out the scheduling. It takes 7 time units to complete a system call. You can assume that dispatching is effortless. The event request made by thread P1-T1 at time unit 1 is for the readiness of the result obtained after executing thread P1-T2 for 2 time units. Process-thread Required time unit System call made Time of arrival P1-T1 Event request @1 0 P1-T2 0.01 P2-T1 P3-T1 3 5 5 8 System call @2 0.02 0.03 (a) Threads are handled as user-level threads in the system. For each process, 4 time units are allocated each time. In the slots allocated to a particular process, for each thread of the process, 1 time unit is allocated each time. Derive the timing diagram that shows how different processes and threads change their states. (b) Threads are handled as kernel-level threads in the system. For each kernel-level thread, 4 time units are allocated each time. Derive the timing diagram that shows how different processes and threads change their states. Table provides the details of three processes that are executed in a uniprocessor system that supports multithreading. Process P1 has two threads while processes P2 and P3 have one thread each. Time slicing is exploited to carrying out the scheduling. It takes 7 time units to complete a system call. You can assume that dispatching is effortless. The event request made by thread P1-T1 at time unit 1 is for the readiness of the result obtained after executing thread P1-T2 for 2 time units. Process-thread Required time unit System call made Time of arrival P1-T1 Event request @1 0 P1-T2 0.01 P2-T1 P3-T1 3 5 5 8 System call @2 0.02 0.03 (a) Threads are handled as user-level threads in the system. For each process, 4 time units are allocated each time. In the slots allocated to a particular process, for each thread of the process, 1 time unit is allocated each time. Derive the timing diagram that shows how different processes and threads change their states. (b) Threads are handled as kernel-level threads in the system. For each kernel-level thread, 4 time units are allocated each time. Derive the timing diagram that shows how different processes and threads change their states.

Answer rating: 100% (QA)

The given table provides the details of three processes that are executed in a uniprocessor system that supports multithreading Process P1 has two threads while processes P2 and P3 have one thread eac... View the full answer