Fast wait-free symmetry breaking in distributed systems
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
Main Author: | Smith, Mark Anthony Shawn |
---|---|
Other Authors: | Baruch Awerbuch and Nancy Lynch. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/80467 |
Similar Items
-
Wait-learning : intelligent systems for making productive use of wait time
by: Cai, Carrie Jun
Published: (2017) -
Are Wait-free Algorithms Fast?
by: Attiya, Hagit, et al.
Published: (2023) -
Formal verification of TCP and T/TCP
by: Smith, Mark Anthony Shawn, 1968-
Published: (2008) -
Fast distributed first-order methods
by: Chen, Annie I-An
Published: (2012) -
Symmetries of trellis codes
by: Sarvis, James P. (James Patrick)
Published: (2005)