Browsing by Subject "Distributed computation"
Now showing items 1-4 of 4
-
Article
Computing on a partially eponymous ring
(2009)We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all ...
-
Article
Trade-off results for connection management
(2003)A connection management protocol establishes and handles a connection between two hosts across a wide-area network to allow reliable message delivery. We continue the previous work of Kleinberg et al. (Proceedings of the ...
-
Article
Work-competitive scheduling for cooperative computing with dynamic groups
(2005)The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...
-
Conference Object
Work-competitive scheduling for cooperative computing with dynamic groups
(2003)The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...