Optimal scheduling of contract algorithms with soft deadlines

DOI10.1007/S10951-016-0483-ZMaRDI QIDQ2400436zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

contract algorithmsacceleration ratiointerruptible algorithmsanytime computationscheduling problems in artificial intelligence

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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
• Safe and optimal scheduling for hard and soft tasks
• Optimal scheduling with strict deadlines
• Near-optimal scheduling of distributed algorithms

Cites work

• scientific article; zbMATH DE number 67465 (Why is no real title available?)
• Lower bounds in on-line geometric searching
• Optimal scheduling of contract algorithms for anytime problem-solving
• Optimal scheduling of contract algorithms with soft deadlines
• Optimal sequencing of contract algorithms
• Search games

Cited in

(8)

• Optimal sequencing of contract algorithms
• Further connections between contract-scheduling and ray-searching problems
• Multi-processor search and scheduling problems with setup cost
• A contracting model for flexible distributed scheduling
• Contract scheduling with predictions
• Interruptible algorithms for multiproblem solving
• Optimal scheduling of contract algorithms with soft deadlines
• Optimal scheduling of contract algorithms for anytime problem-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)