Skip to main content
Log in

Optimal scheduling of contract algorithms with soft deadlines

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time, and may not return useful results if interrupted prior to that time. In contrast, an interruptible algorithm will always output some meaningful (albeit suboptimal) solution, even if interrupted during its execution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a well-studied problem with significant applications in AI. In the standard model, the interruptions are hard deadlines in which a solution must be reported immediately at the time the interruption occurs. In this paper, we study the more general setting of scheduling contract algorithms in the presence of soft deadlines. In particular, we address the setting in which if an interruption occurs at time t, then the system is given an additional window of time \(w(t)\le c \cdot t\), for constant c, within which the simulation must be completed. We formulate extensions to performance measures of schedules under this setting and derive schedules of optimal performance for all concave functions w.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Angelopoulos, S. (2015). Further connections between contract-scheduling and ray-searching problems. In Proceedings of the 24th International Joint Conference in Artificial Intelligence (JCAI) (pp. 1516–1522).

  • Angelopoulos, S., & López-Ortiz, A. (2009). Interruptible algorithms for multi-problem solving. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI) (pp. 380–386).

  • Angelopoulos, S., López-Ortiz, A., & Hamel, A. (2008). Optimal scheduling of contract algorithms with soft deadlines. In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI) (pp. 868–873).

  • Bernstein, D.S., Finkelstein, L., & Zilberstein, S. (2003). Contract algorithms and robots on rays: Unifying two scheduling problems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 1211–1217).

  • Bernstein, D.S., Perkins, T.J., Zilberstein, S., & Finkelstein, L. (2002). Scheduling contract algorithms on multiple processors. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI) (pp. 702–706).

  • Dean, T., & Boddy, M.S. (1998). An analysis of time-dependent planning. In Proceedings of the 15th National Conference on Artificial Intelligence (pp. 49–54).

  • Gal, S. (1980). Search games. New York: Academic Press.

    Google Scholar 

  • Horvitz, E. (1987). Reasoning about beliefs and actions under computational resource constraints. In Proceedings of the 3rd Annual Conference on Uncertainty in Artificial Intelligence (pp. 301–324).

  • Horvitz, E. (1998). Reasoning under varying and uncertain resource constraints. In Proceedings of the 15th National Conference on Artificial Intelligence (pp. 111–116).

  • López-Ortiz, A., Angelopoulos, S., & Hamel, A. M. (2014). Optimal scheduling of contract algorithms for anytime problems. Journal of Artificial Intelligence Research, 51, 533–554.

    Google Scholar 

  • Manolache, S.n, Eles, P., & Peng, Z. (2004). Optimization of soft real-time systems with deadline miss ratio constraints. In Proceedings of 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’04) (p. 562).

  • Russell, S.J., & Zilberstein, S. (1991). Composing real-time systems. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI) (pp. 212–217).

  • Schuierer, S. (2001). Lower bounds in online geometric searching. Computational Geometry: Theory and Applications, 18(1), 37–53.

    Article  Google Scholar 

  • Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 73–83.

    Google Scholar 

  • Zilberstein, S., Charpillet, F., & Chassaing, P. (2003). Real-time problem-solving with contract algorithms. Annals of Mathematics and Artificial Intelligence, 39(1–2), 1–18.

    Article  Google Scholar 

  • Zilberstein, S., Charpillet, F., & Chassaing, P. (2003). Optimal sequencing of contract algorithms. Annals of Mathematics and Artificial Intelligence, 39(1–2), 1–18.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alejandro López-Ortiz.

Additional information

A preliminary version of this paper appeared in the Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 2008 (Angelopoulos et al. 2008).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Angelopoulos, S., López-Ortiz, A. & Hamel, A. Optimal scheduling of contract algorithms with soft deadlines. J Sched 20, 267–277 (2017). https://doi.org/10.1007/s10951-016-0483-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-016-0483-z

Keywords

Navigation