(Specially for M.Tech. IInd Sem)
1. Issues in Cooperating processes (Tel 1.1.6)
2. Central V/s Distributed Algo (Tel 1.3.1)
3. LCR (3.3 pg 476) **
4. LCR solves leader election (3.3)
5. Variable speed is better than time slice (3.5)
6. Synch GHS (pg 67) **
7. Random Attack Algorithm ***
8. Coordinate Attack Problem ***** (5.1,5.2)
9. Aggrement Problem (pg 177) **
10. opt Flood set (pg 105) *
11. EIG stop Algorithm (pg 110) *
12. 2 v/s 3 phase commit (7.3.2-7.3.3)
13. blocking commit (pg 182)
14. Tournament Algo (pg 289) *
15. Mutual Exclusion (ch-10) *
16. Burns ME algo (pg 294)
17. Ticket ME algo (pg 313) *
18. Wait free termination (pg 378)
19. RMW Aggreement algo (12.3) *
20. Transformation (ch-17)
21. SR Sim algo (arbitrary failure) (pg 583)
22. Failure Detector (21.4) *****
23. Synch network problem (pg 52)
24. Types of failure (2.2)
25. leader election problem (pg 52) *
26. min weight spanning tree (pg 63)
27. sequential BFS algo (pg 58)
28. Flood min algo (pg 163)
29. stopping failure model (6.2) *
30. flood set algo (pg 103)
31. stoping and bynzatine agreement algorithm (ch-6)
32. EIG algo (6.3.2)
33. Consensus Problem (6.1)(pg 373)
34. 2 phase lockout free mutual exclusion algo (pg 278) *
35. shared memory system (pg 237)
36. Trival ME algo (pg 310)
37. Peterson leader election algo (asynchronous) (pg 482)
38. Shared ---> Network model (problems)(17.1) *
39. k-agreement algo (asynchronous) (pg 161) (pg 681)
40. Simple ShVar Sim algo (pg 566)
41. Fault tolerence *****
42. busy waiting
43. HS algo (pg 476) (pg 31) *
44. belsnes single message communication (Tel)
45. 3 message conversation
46. non comparison based algo (synchronous) (pg 35) *
47. opt flood set v/s flood set algo (pg 103)(pg 105)
48. EIG tree (6.2.3) ***
49. EIG byt algo v/s EIG stop algo (pg 111)(pg 120)
50. 3 phase commit (pg 185) **
51. Dijkstra ME algo (pg 265)
52. fairness (pg 212)
53. peterson NP algo and ZP algo (pg 284) *
54. Perfect FD agreement
55. Ben or algo (Example)(pg 673)
56. Simple write/multiread register (Bcast Sim algo) (pg 585)
57. thiird implementation of Buffermain ME algo
58. Communication Complexity == St complexity or not
59. Problems in networks in distributed implementation
60. Bynzatime failure (6.2) ***
61. Turpin Coan algo (pg 123)
62. 2 phase commit (pg 184)
63. Can Peterson 2P classify as lock out free mutual exclusion algo (2 phase) (pg 278)
64. doorway (pg 296)
65. backery algo (lockout freedom) (pg 296)
66. F-failure termination
67. Buffer main ME algo (pg 316)
Books
1. Nancy Lynch, "Distributed Algorithms" Morgan Kaufmann.
2. Gerlad Tel, "Introduction to Distributed Algorithms" Cambridge University Press.
Terms
Tel = Book Gerlad Tel
Ch = chapter
Pg = page number in Nancy lynch
6.3.2 = Topic 6.3.2 in Nancy lynch
algo = algorithm
* = important
*** , ***** = too much important
1. Issues in Cooperating processes (Tel 1.1.6)
2. Central V/s Distributed Algo (Tel 1.3.1)
3. LCR (3.3 pg 476) **
4. LCR solves leader election (3.3)
5. Variable speed is better than time slice (3.5)
6. Synch GHS (pg 67) **
7. Random Attack Algorithm ***
8. Coordinate Attack Problem ***** (5.1,5.2)
9. Aggrement Problem (pg 177) **
10. opt Flood set (pg 105) *
11. EIG stop Algorithm (pg 110) *
12. 2 v/s 3 phase commit (7.3.2-7.3.3)
13. blocking commit (pg 182)
14. Tournament Algo (pg 289) *
15. Mutual Exclusion (ch-10) *
16. Burns ME algo (pg 294)
17. Ticket ME algo (pg 313) *
18. Wait free termination (pg 378)
19. RMW Aggreement algo (12.3) *
20. Transformation (ch-17)
21. SR Sim algo (arbitrary failure) (pg 583)
22. Failure Detector (21.4) *****
23. Synch network problem (pg 52)
24. Types of failure (2.2)
25. leader election problem (pg 52) *
26. min weight spanning tree (pg 63)
27. sequential BFS algo (pg 58)
28. Flood min algo (pg 163)
29. stopping failure model (6.2) *
30. flood set algo (pg 103)
31. stoping and bynzatine agreement algorithm (ch-6)
32. EIG algo (6.3.2)
33. Consensus Problem (6.1)(pg 373)
34. 2 phase lockout free mutual exclusion algo (pg 278) *
35. shared memory system (pg 237)
36. Trival ME algo (pg 310)
37. Peterson leader election algo (asynchronous) (pg 482)
38. Shared ---> Network model (problems)(17.1) *
39. k-agreement algo (asynchronous) (pg 161) (pg 681)
40. Simple ShVar Sim algo (pg 566)
41. Fault tolerence *****
42. busy waiting
43. HS algo (pg 476) (pg 31) *
44. belsnes single message communication (Tel)
45. 3 message conversation
46. non comparison based algo (synchronous) (pg 35) *
47. opt flood set v/s flood set algo (pg 103)(pg 105)
48. EIG tree (6.2.3) ***
49. EIG byt algo v/s EIG stop algo (pg 111)(pg 120)
50. 3 phase commit (pg 185) **
51. Dijkstra ME algo (pg 265)
52. fairness (pg 212)
53. peterson NP algo and ZP algo (pg 284) *
54. Perfect FD agreement
55. Ben or algo (Example)(pg 673)
56. Simple write/multiread register (Bcast Sim algo) (pg 585)
57. thiird implementation of Buffermain ME algo
58. Communication Complexity == St complexity or not
59. Problems in networks in distributed implementation
60. Bynzatime failure (6.2) ***
61. Turpin Coan algo (pg 123)
62. 2 phase commit (pg 184)
63. Can Peterson 2P classify as lock out free mutual exclusion algo (2 phase) (pg 278)
64. doorway (pg 296)
65. backery algo (lockout freedom) (pg 296)
66. F-failure termination
67. Buffer main ME algo (pg 316)
Books
1. Nancy Lynch, "Distributed Algorithms" Morgan Kaufmann.
2. Gerlad Tel, "Introduction to Distributed Algorithms" Cambridge University Press.
Terms
Tel = Book Gerlad Tel
Ch = chapter
Pg = page number in Nancy lynch
6.3.2 = Topic 6.3.2 in Nancy lynch
algo = algorithm
* = important
*** , ***** = too much important
