ch5 - CSC7103 Advanced Operating Systems Louisiana State...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC7103 Advanced Operating Systems Louisiana State University Rajgopal Kannan
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Rajgopal Kannan 1. The effect of communication overhead 2. The effect of underlying architecture 3. Dynamic behavior of the system 4. Resource utilization 5. Turnaround time 6. Location and performance transparency 7. Task and data migration
Background image of page 2
Rajgopal Kannan 1. Static or off-line 2. Dynamic or on-line 3. Real-time
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Rajgopal Kannan 1. Precedence graph 2. Communication graph 3. Disjoint process model 4. Statistical load modeling
Background image of page 4
Rajgopal Kannan 1. Communication system model 2. Processor pool model 3. Isolated workstation model 4. Migration workstation model
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Rajgopal Kannan 1. Speedup 2. Resource utilization 3. Makespan or completion time 4. Load sharing and load balancing
Background image of page 6
Rajgopal Kannan λ λ Turnaround time=1/( μ-λ29 μ μ
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Rajgopal Kannan Turnaround time = μ/((μ-λ29(μ+λ2929 2 λ μ μ
Background image of page 8
Rajgopal Kannan The general problem is NP-complete. 1. Stone’s algorithm (2 heterogeneous processors, arbitrary communication process graph). 2. Bokhari’s algorithm ( n homogeneous processors, linear communication process graph, linear communication system)
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Louisiana State University Rajgopal Kannan Assumptions: 1. Two heterogeneous processors. Therefore, the execution cost of each process depends on the processor. Further, the execution cost for each process is known for both processors. 2. Communication cost between each pair of processes is known. 3. Interprocess communication incurs negligible cost if both the processes are in the same processor.
Background image of page 10
Louisiana State University Rajgopal Kannan Objective Function: Stone’s Algorithm minimizes the total execution and communication cost by properly allocating the processors among the processes. Let, G =(V,E) =(V,E) be the communication process model. Let A and B be two processors. Let wA(u) and wB(u) be the cost of executing process u on processors A and B respectively. Let, c(u,v) be the cost of interprocess communication between processes u and v if they are allocated different processors. Further, S be the set of processes to be executed on processor A and V-S V-S be the set of process to be executed on processor B. Stone’s algorithm computes S such that the
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 23

ch5 - CSC7103 Advanced Operating Systems Louisiana State...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online