IBM / Distributed Systems / Distributive Networks / Database Systems / /
Currency
USD / /
Event
Product Issues / /
Facility
Princeton University / Cornell University / Laboratory of Information Theory / University of Paris / /
IndustryTerm
given processor / similar processors / symmetric systems / bidirectional message-passing systems / bounded-fair systems / faulty processor / message-passing communications / deterministic solution / selection algorithm / deterministic algorithms / neigh* boring processors / to concurrent systems / similar processor / network connecting processors / connected boundedfair systems / symmetric solution / concurrent systems / set partition algorithm / selection algorithms / message-passing systems / asynchronous message-passing systems / homogeneous systems / symmetric processors / tion algorithm / /
Organization
Laboratory of Information Theory and Programming / VERSIONS / National Science Foundation / Princeton University / Computer Science Department / Cornell University / Association for Computing Machinery / University of Paris / /
Person
Pl / O. Rabin / Lehmann / /
Position
Vp / D.J. / Arbiter / leader / /
Product
Algorithm 2 / processor / Process / main result / /
ProgrammingLanguage
R / L / /
ProvinceOrState
New York / /
Technology
selection algorithm / two neighboring processors / tion algorithm / faulty processor / similar processor / one faulty processor / causes processors / network connecting processors / O. This algorithm / given processor / two processors / time Algorithm / Exactly one processor / using Algorithm / selected processor / one processor / selection algorithms / five processors / five symmetric processors / third processor / set partition algorithm / two neigh* boring processors / /
Symmetry and Similarity in Distributed Systems* R a l p h E. J o h n s o n t F r e d B. S c h n e i d e r t Computer Science Department Cornell University Similarity is introduced as a model-independent characterization