Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems
We consider the following natural problem: n failure-prone servers, communicating synchronously through message passing, must assign themselves one-to-one to n distinct items. Existing literature suggests two possible approaches to this problem. First, model it as an instance of tight renaming in sy...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM),
2016-02-02T02:42:54Z.
|
| Subjects: | |
| Online Access: | Get fulltext |