This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: First part will be definitions definitions of concepts and design issues surrounding those concepts. This will be ~3040% of the total of the exam. Multicasting sequence type problem (similar to first sample problem) Leader election is important (12 problems). Dont forget Dr. Bushs talk. Synchronous and Asynchronous algorithms are important. Distributed mutual exclusion Raymonds Algorithm (or the advanced version path compression) Scheduling problem We may be asked to competitive factor given machines and jobs. Stones algorithm Questions like what is the difference between leader election and mutual exclusion. Look at sample problems!!! Misc Slowfit is not the same as greedy. Slowfit gets a list of candidates and we choose the lowest index. Greedy just chooses the smallest sum of load. Provide answer to A,B,C of Sample problem 3 by 10/20/09 for 5 bonus points. CSC 7103 10/13/2009 Page 2 of 2...
View
Full
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.
 Fall '08
 Kannan,R
 Algorithms, Operating Systems

Click to edit the document details