On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts
Authors:
- Chryssis GeorgiouCGChryssis Georgiou
- Dariusz R. KowalskiDKDariusz R. Kowalski
- 1 October 2015
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 84, 94-107
Abstract
No abstract availableKeywords
Funding Information
- University of Cyprus (UCY-ED-CG-2011)
- Engineering and Physical Sciences Research Council (EP/G023018/1, EP/H018816/1)
This publication has 25 references indexed in Scilit:
- Extending IC-scheduling via the Sweep AlgorithmJournal of Parallel and Distributed Computing, 2010
- Distributed scheduling for disconnected cooperationDistributed Computing, 2005
- Efficient gossip and robust distributed computationTheoretical Computer Science, 2005
- Work-Competitive Scheduling for Cooperative Computing with Dynamic GroupsSIAM Journal on Computing, 2005
- A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous ProcessorsSIAM Journal on Computing, 2005
- The complexity of synchronous iterative Do-All with crashesDistributed Computing, 2004
- An adaptive collect algorithm with applicationsDistributed Computing, 2002
- Performing Work Efficiently in the Presence of FaultsSIAM Journal on Computing, 1998
- Algorithms for the Certified Write-All ProblemSIAM Journal on Computing, 1997
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985