Interruptible algorithms for multiproblem solving - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Interruptible algorithms for multiproblem solving

Résumé

In this paper we address the problem of designing an interruptible system in a setting in which n problem instances, all equally important, must be solved. The system involves scheduling executions of contract algorithms (which offer a trade-off between allowable computation time and quality of the solution) in m identical parallel processors. When an interruption occurs, the system must report a solution to each of the n problem instances. The quality of this output is then compared to the best-possible algorithm that has foreknowledge of the interruption time and must, likewise, produce solutions to all n problem instances. This extends the well-studied setting in which only one problem instance is queried at interruption time. We propose a schedule which we prove is optimal for the case of a single processor. For multiple processors, we show that the quality of the schedule is within a small factor from optimal.
Fichier non déposé

Dates et versions

hal-02986819 , version 1 (03-11-2020)

Identifiants

Citer

Spyros Angelopoulos, Alejandro Lopez-Ortiz. Interruptible algorithms for multiproblem solving. Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09), Jul 2009, Pasadena, CA, United States. pp.380-386, ⟨10.5555/1661445.1661506⟩. ⟨hal-02986819⟩
17 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More