Abstract
The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous processors start performing tasks in isolation and where an adversary can force an arbitrary pattern of merges. Following a merge, processors are able to share their knowledge about the computational progress prior to the merge.
Original language | English (US) |
---|---|
Pages | 132 |
Number of pages | 1 |
State | Published - 2002 |
Externally published | Yes |
Event | Proceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002 - Monterey, CA, United States Duration: Jul 21 2002 → Jul 24 2002 |
Conference
Conference | Proceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002 |
---|---|
Country/Territory | United States |
City | Monterey, CA |
Period | 7/21/02 → 7/24/02 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications