1 / 17

Lecture #15 Distributed Algorithms (III)

Lecture #15 Distributed Algorithms (III). CS492 Special Topics in Computer Science: Distributed Algorithms and Systems. Admin Stuff. Next week Team #1 at 9:00am on Tue Team #2 at 9:45am on Tue Team #3 at ??? on Tue Team #4 at ??? on Tue Additional meeting on demand on Fri 10am-3pm

plato-slater
Download Presentation

Lecture #15 Distributed Algorithms (III)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture #15Distributed Algorithms (III) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems

  2. Admin Stuff • Next week • Team #1 at 9:00am on Tue • Team #2 at 9:45am on Tue • Team #3 at ??? on Tue • Team #4 at ??? on Tue • Additional meeting on demand on Fri 10am-3pm • Expected deliverables • Steady progress from last week • Concrete execution plan

  3. HS Algorithm (informal)

  4. Key Idea Trajectories of successive tokens originating at process i in teh HS algorithm

  5. What additional states/msgs?

  6. States in HS Algorithm

  7. Messages in HS Algorithm

  8. Transitions in HS Algorithms

  9. Complexity Analysis p34 bottom

  10. What if we don’t use comparison? • The TimeSlice algorithm • ring size n is known • unidirectional communication • idea: elect the process with minimum UID • “non-arrival” very meaningful • time complexity? • message complexity?

  11. What if ring size is unknown? While keeping message complexity of O(n) Can we do it? How about time complexity? VariableSpeeds algorithms

  12. Summary of Performance

  13. Now the question is: Is O (n log n) the lower bound for comparison-based algorithms?

  14. Lemmas

  15. Theorems

  16. Next question is: What is the lower bound for non-comparison-based algorithms? Is it possible to show that this can only happen at the cost of large time complexity?

  17. More Theorems

More Related