Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
From MaRDI portal
Publication:3095325
DOI10.1007/978-3-642-24100-0_15zbMath1350.68279MaRDI QIDQ3095325
Chryssis Georgiou, Dariusz R. Kowalski
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_15
competitive analysis; distributed algorithms; crashes and restarts; performing tasks; dynamic task injection
68W15: Distributed algorithms
Related Items
Doing-it-all with bounded work and communication, Fault tolerant scheduling of tasks of two sizes under resource augmentation, Online parallel scheduling of non-uniform tasks: trading failures for energy
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending IC-scheduling via the sweep algorithm
- Competitive algorithms for distributed data management.
- Distributed scheduling for disconnected cooperation
- Collective asynchronous reading with polylogarithmic worst-case overhead
- Performing Work Efficiently in the Presence of Faults
- Meeting the deadline
- Online set packing and competitive scheduling of multi-part tasks
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups