Performing dynamically injected tasks on processes prone to crashes and restarts
From MaRDI portal
Publication:3095325
DOI10.1007/978-3-642-24100-0_15zbMATH Open1350.68279OpenAlexW2127719769MaRDI QIDQ3095325FDOQ3095325
Authors: 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
Recommendations
- Dynamic Task Allocation in Asynchronous Shared Memory
- Work-competitive scheduling for cooperative computing with dynamic groups
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Fault tolerant scheduling of tasks of two sizes under resource augmentation
- Performing tasks on synchronous restartable message-passing processors
competitive analysisdistributed algorithmscrashes and restartsperforming tasksdynamic task injection
Cites Work
- Online set packing and competitive scheduling of multi-part tasks
- Title not available (Why is that?)
- Extending IC-scheduling via the sweep algorithm
- Title not available (Why is that?)
- Performing Work Efficiently in the Presence of Faults
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
- Collective asynchronous reading with polylogarithmic worst-case overhead
- Title not available (Why is that?)
- Distributed scheduling for disconnected cooperation
- Competitive algorithms for distributed data management.
Cited In (3)
Uses Software
This page was built for publication: Performing dynamically injected tasks on processes prone to crashes and restarts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095325)
