CSC 7103 20090929

CSC 7103 20090929 - CSC 7103 9/29/2009 Page 1 of 2 Midterm...

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

View Full Document Right Arrow Icon
CSC 7103 9/29/2009 Page 1 of 2 Midterm will be on 10/13/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. Leader election/mutual exclusion Leader election is more efficient / has less messages sent than mutual exclusion. Look at problems at the end of chapter 4 (page 146) and the example problems given out. Process scheduling What about execution time as a problem – how do we know how long it will take a process to run? Communication overhead How do we know which processes are related/communicating/synchronizing? Location & performance transparency and Task/data migration are the two most important because they dictate where the task will run and how the information will get there. Dynamic algorithms make no decisions including future data, they only consider what is happening at that time. An example of this is round robin. Real-time systems know what processes are created when and how many of them.
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 / 2

CSC 7103 20090929 - CSC 7103 9/29/2009 Page 1 of 2 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