Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
SETI@HOME—massively distributed computing for SETI
Computing in Science and Engineering
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of synchronous iterative Do-All with crashes
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
SIAM Journal on Computing
Toward a Theory for Scheduling Dags in Internet-Based Computing
IEEE Transactions on Computers
Do-All Computing in Distributed Systems
Do-All Computing in Distributed Systems
A theory of competitive analysis for distributed algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing,we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The systemconsists of n message-passing processes which, subject to dynamic crashes and restarts, cooperate in performing independent tasks that are continuously and dynamically injected to the system. The task specifications are not known a priori to the processes.This problemabstracts todays Internet-based computations, such as Grid computing and cloud services, where tasks are generated dynamically and different tasks may be known to different processes. We measure performance in terms of the number of pending tasks, and as such it can be directly compared with the optimumnumber obtained under the same crash-restart-injection pattern by the best off-line algorithm. We propose several deterministic algorithmic solutions to the considered problem under different information models and correctness criteria, and we argue that their performance is close to the best possible offline solutions.