CSC 7103 20091006

CSC 7103 20091006 - CSC 7103 10/6/2009 Page 1 of 3 Midterm...

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

View Full Document Right Arrow Icon
CSC 7103 10/6/2009 Page 1 of 3 Midterm will be on 10/15/2009. Midterm will not include spanning tree algorithms. It will include the ring, and complete topology questions on leader election and all algorithms on mutual exclusion. Load balancing What is the optimal location for a task? Consider having M processors P 1 to P M and N jobs J 1 …J N . We are interested in dynamic/online algorithms. In online algorithms, jobs come in a particular sequence, and it must decide where the jobs go. Online algorithms are generally compared to the best offline algorithm; because the online jobs are made on the fly where offline algorithms can analyze all the data before making a decision. Competitive ratio = max load algorithm(σ) / max load opt(σ) Figure 1 – algorithm example r j = load imposed by the j th job/task r j • < r j (1), r j (2), …, r j (m)> l Now suppose we have M processors/machines and N jobs. We know that on each machine we have a load between l and L (i.e. l <= l’ <= L). Figure 2 – load diagram
Background image of page 1

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

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

This note was uploaded on 01/25/2010 for the course CSC 7103 taught by Professor Kannan,r during the Fall '08 term at LSU.

Page1 / 3

CSC 7103 20091006 - CSC 7103 10/6/2009 Page 1 of 3 Midterm...

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

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