HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Interruptible algorithms for multiproblem solving

Abstract : 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 concurrently. 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. In this work we first introduce new measures for evaluating the performance of interruptible systems in this setting. In particular, we propose the deficiency of a schedule as a performance measure that meets the requirements of the problem at hand. We then present a schedule whose performance we prove that is within a small factor from optimal in the general, multiprocessor setting. We also show several lower bounds on the deficiency of schedules on a single processor. More precisely, we prove a general lower bound of (n + 1)/n, an improved lower bound for the two-problem setting (n = 2), and a tight lower bound for the class of round-robin schedules. Our techniques can also yield a simpler, alternative proof of the main result of Bernstein et al. [4] concerning the performance of cyclic schedules in multiprocessor environments.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02986029
Contributor : Spyros Angelopoulos Connect in order to contact the contributor
Submitted on : Monday, November 2, 2020 - 4:14:28 PM
Last modification on : Friday, January 21, 2022 - 1:50:02 PM

File

1810.11291.pdf
Files produced by the author(s)

Identifiers

Citation

Spyros Angelopoulos, Alejandro Lopez-Ortiz. Interruptible algorithms for multiproblem solving. Journal of Scheduling, Springer Verlag, 2020, 23 (4), pp.451-464. ⟨10.1007/s10951-020-00644-9⟩. ⟨hal-02986029⟩

Share

Metrics

Record views

32

Files downloads

18