Optimal scheduling of contract algorithms with soft deadlines
DOI10.1007/S10951-016-0483-ZzbMATH Open1376.90021OpenAlexW2168704598MaRDI QIDQ2400436FDOQ2400436
Authors: Spyros Angelopoulos, Alejandro Lopez-Ortiz, Angèle. M. Hamel 
Publication date: 1 September 2017
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-016-0483-z
Recommendations
- Optimal scheduling of contract algorithms for anytime problem-solving
- Optimal sequencing of contract algorithms
- A contracting model for flexible distributed scheduling
- Contracts for schedulability analysis
- scientific article; zbMATH DE number 7561341
- Optimal scheduling with strict deadlines
- Near-optimal scheduling of distributed algorithms
contract algorithmsacceleration ratiointerruptible algorithmsanytime computationscheduling problems in artificial intelligence
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (7)
- Optimal sequencing of contract algorithms
- Optimal scheduling of contract algorithms with soft deadlines
- Further connections between contract-scheduling and ray-searching problems
- Optimal scheduling of contract algorithms for anytime problem-solving
- Multi-processor search and scheduling problems with setup cost
- A contracting model for flexible distributed scheduling
- Interruptible algorithms for multiproblem solving
This page was built for publication: Optimal scheduling of contract algorithms with soft deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400436)
