2 papers
cs.DS2003
Compositional competitiveness for distributed algorithms
James Aspnes, Orli Waarts
We define a measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This n…
cs.DC2000
Performing work efficiently in the presence of faults
Cynthia Dwork, Joseph Y. Halpern, O. Waarts
We consider a system of t synchronous processes that communicate only by sending messages to one another, and that together must perform independent units of work. Processes ma…