Scribd
Upload
28 views

2018 Spring OS Assignment # 3 MP & MTH

This document contains an assignment on process concepts and threading models consisting of 5 questions: 1. Explain solutions to problems in a textbook. 2. Define why threads are called light weight processes. 3. Describe the many-to-many threading model and its use for multicore processors. 4. Discuss the advantages of using kernel-level thread pools. 5. Explain the different thread cancellation models. It also includes 4 subquestions about process scheduling and dispatch tables: calculating priority, time quanta, execution timelines, and overhead.

Uploaded by

Humza Zahid
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
28 views

2018 Spring OS Assignment # 3 MP & MTH

This document contains an assignment on process concepts and threading models consisting of 5 questions: 1. Explain solutions to problems in a textbook. 2. Define why threads are called light weight processes. 3. Describe the many-to-many threading model and its use for multicore processors. 4. Discuss the advantages of using kernel-level thread pools. 5. Explain the different thread cancellation models. It also includes 4 subquestions about process scheduling and dispatch tables: calculating priority, time quanta, execution timelines, and overhead.

Uploaded by

Humza Zahid
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment # 3 Process Concepts Chapter 3&4

Submission Date: 19 March 2018

Q. 1. Attempt Q 4.4 and 4.5 of Silberscahtz


Q. 2. Explain why the threads are called Light weight process
Q. 3. Explain the use of Many to Many multithreading model and its use for Multicore
processors
Q. 4. What is the advantage of using kernel level thread pools
Q. 5. Explain the thread cancellation models
Assume a process runs as under:
Initial Priority = 15; 1TQ is allowed when the process is in run state
0.5TQ – 0.7TQ -- 2TQ -- .6TQ -- 8TQ – .7TQ – 1TQ
a) Use the Solaris dispatch table to determine Priority and Time quantum in
milliseconds at each scheduling instance. Show the process execution on
time line assuming software overhead = 0. Calculate the Total Process
Time, Execution and the overhead time.
b) Calculate total time of execution for part (a) if dispatch latency and
scheduling algorithm overhead is 0.25TQ at each instance. Also show on a
time line.
c) Use the Windows XP dispatch table for Normal Class process to
determine Priority at each scheduling instance assuming time Quantum =
40ms. Show the process execution on time line assuming software
overhead = 0. Calculate the Total Process Time, Execution and the
overhead time.
d) Calculate total time of execution for part (c) if dispatch latency and
scheduling algorithm overhead is 0.25TQ at each instance. Also show on a
time line.

You might also like