Performing dynamically injected tasks on processes prone to crashes and restarts
From MaRDI portal
Publication:3095325
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
Cites work
- scientific article; zbMATH DE number 1696672 (Why is no real title available?)
- scientific article; zbMATH DE number 1033646 (Why is no real title available?)
- scientific article; zbMATH DE number 2006650 (Why is no real title available?)
- Collective asynchronous reading with polylogarithmic worst-case overhead
- Competitive algorithms for distributed data management.
- Distributed scheduling for disconnected cooperation
- Extending IC-scheduling via the sweep algorithm
- Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
- Online set packing and competitive scheduling of multi-part tasks
- Performing Work Efficiently in the Presence of Faults
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
Cited in
(3)
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)