{"type":"ScholarlyArticle","title":"Earliest-Completion Scheduling of Contract Algorithms with End Guarantees","authors":[{"name":"Spyros Angelopoulos","slug":"spyros-angelopoulos","given":"Spyros","family":"Angelopoulos","affiliation":"Sorbonne Université , CNRS , Laboratoire d'Informatique de Paris 6 , LIP6 , F-75252 Paris , France"},{"name":"Shendan Jin","slug":"shendan-jin","given":"Shendan","family":"Jin","affiliation":"Sorbonne Université , CNRS , Laboratoire d'Informatique de Paris 6 , LIP6 , F-75252 Paris , France"}],"abstract":"We consider the setting in which executions of contract algorithms are scheduled in a processor so as to produce an interruptible system. Such algorithms offer a trade off between the quality of output and the available computation time, provided that the latter is known in advance. Previous work on this setting has provided strict performance guarantees for several variants of this setting, assuming that an interruption can occur arbitrarily ahead in the future. In practice, however, one expects that the schedule will reach a point beyond which further progress will only be marginal, hence it can be deemed complete. In this work we show how to optimize the time at which the system reaches a desired performance objective, while maintaining interruptible guarantees throughout the entire execution. The resulting schedule is provably optimal, and it guarantees that upon completion each individual contract algorithm has attained a predefined end guarantee.","doi":"10.24963/ijcai.2019/763","url":"https://ijcai.org/proceedings/2019/763","pdf":"https://ijcai.org/proceedings/2019/0763.pdf","markdown":"https://ijcai.org/proceedings/2019/763.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/763","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Planning and Scheduling","track":"Main track","number":763,"pages":{"first":5493,"last":5499},"keywords":["Planning and Scheduling: Scheduling","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Angelopoulos and López-Ortiz, 2009] S. Angelopoulos and A. López-Ortiz. Interruptible algorithms for multi- problem solving. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pages 380-386, 2009.","title":"Interruptible algorithms for multiproblem solving","authors":"S Angelopoulos, A López-Ortiz","year":"2009","venue":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Angelopoulos et al., 2008] S. Angelopoulos, A. López- Ortiz, and A. Hamel. Optimal scheduling of contract algo- rithms with soft deadlines. In Proceedings of the 23rd Na- tional Conference on Artificial Intelligence (AAAI), pages 868-873, 2008.","title":"Optimal scheduling of contract algorithms with soft deadlines","authors":"S Angelopoulos, A López-Ortiz, A Hamel","year":"2008","venue":"Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Angelopoulos, 2015] S. Angelopoulos. Further connections between contract-scheduling and ray-searching problems. In Proceedings of the 24th International Joint Conference in Artificial Intelligence (IJCAI), pages 1516-1522, 2015.","title":"Further connections between contract-scheduling and ray-searching problems","authors":"S","year":"2015","venue":"Proceedings of the 24th International Joint Conference in Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2015/217"},{"position":4,"raw":"[Baryshnikov et al., 2004] YM M. Baryshnikov, E. G. Coff- man Jr., P. R. Jelenkovic, Petar Momcilovic, and D. Rubenstein. Flood search under the california split rule. Oper. Res. Lett., 32(3):199-206, 2004.","title":"Flood search under the california split rule","authors":"Baryshnikov","year":"2004","venue":"Oper. Res. Lett","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bernstein et al., 2002] D.S. Bernstein, T. J. Perkins, S. Zil- berstein, and L. Finkelstein. Scheduling contract algo- rithms on multiple processors. In Proceedings of the 18th AAAI Conference on Artificial Intelligence (AAAI), pages 702-706, 2002.","title":"Scheduling contract algorithms on multiple processors","authors":"D S Bernstein, T J Perkins, S Zilberstein, L Finkelstein","year":"2002","venue":"Proceedings of the 18th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bernstein et al., 2003] D.S. Bernstein, L. Finkelstein, and S. Zilberstein. Contract algorithms and robots on rays: unifying two scheduling problems. In Proceedings of the 18th International Joint Conference on Artificial Intelli- gence (IJCAI), pages 1211-1217, 2003.","title":"Contract algorithms and robots on rays: unifying two scheduling problems","authors":"D S Bernstein, L Finkelstein, S Zilberstein","year":"2003","venue":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2003/172"},{"position":7,"raw":"[Boddy and Dean, 1994] M. S. Boddy and T. L. Dean. Delib- eration scheduling for problem solving in time-constrained environments. Artif. Intell., 67(2):245-285, 1994.","title":"Deliberation scheduling for problem solving in time-constrained environments","authors":"M S Boddy, T L Dean","year":"1994","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chrobak and Mathieu, 2006] M. Chrobak and C. Mathieu. Competitiveness via doubling. SIGACT News, pages 115- 126, 2006.","title":"Competitiveness via doubling","authors":"M Chrobak, C Mathieu","year":"2006","venue":"SIGACT News","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Horvitz, 1988] E. Horvitz. Reasoning about beliefs and ac- tions under computational resource constraints. Int. J. Ap- prox. Reasoning, 2(3):337-338, 1988.","title":"Reasoning about beliefs and actions under computational resource constraints","authors":"E Horvitz","year":"1988","venue":"Int. J. Approx. Reasoning","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[López-Ortiz et al., 2014] A. López-Ortiz, S. Angelopoulos, and A.M. Hamel. Optimal scheduling of contract algo- rithms for anytime problems. Journal of Artificial Intelli- gence Research, (51):533-554, 2014.","title":"Optimal scheduling of contract algorithms for anytime problems","authors":"A López-Ortiz, S Angelopoulos, A M Hamel","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Russell and Zilberstein, 1991] S. J. Russell and S. Zilber- stein. Composing real-time systems. In Proceedings of the 12th International Joint Conference on Artificial Intel- ligence (IJCAI), pages 212-217, 1991.","title":"Composing real-time systems","authors":"S J Russell, S Zilberstein","year":"1991","venue":"Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/1991/32"},{"position":12,"raw":"[Zilberstein and Russell, 1993] S. Zilberstein and S. J. Rus- sell. Anytime sensing, planning and action: A practical model for robot control. In Proceedings of the 13th In- ternational Joint Conference on Artificial Intelligence (IJ- CAI), pages 1402-1407, 1993.","title":"Anytime sensing, planning and action: A practical model for robot control","authors":"S Zilberstein, S J Russell","year":"1993","venue":"Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJ-CAI)","doi":null,"url":null,"internal_url":"/proceedings/1993/194"},{"position":13,"raw":"[Zilberstein et al., 2003] S. Zilberstein, F. Charpillet, and P. Chassaing. Optimal sequencing of contract algorithms. Ann. Math. Artif. Intell., 39(1-2):1-18, 2003.","title":"Optimal sequencing of contract algorithms","authors":"S Zilberstein, F Charpillet, P Chassaing","year":"2003","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Zilberstein, 1996] S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996.","title":"Using anytime algorithms in intelligent systems","authors":"S Zilberstein","year":"1996","venue":"AI Magazine","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}