Adaptive online scheduling of tasks with anytime property on heterogeneous resources

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00243315" target="_blank" >RIV/68407700:21230/16:00243315 - isvavai.cz</a>

Result on the web

<a href="http://www.sciencedirect.com/science/article/pii/S030505481630140X" target="_blank" >http://www.sciencedirect.com/science/article/pii/S030505481630140X</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cor.2016.06.008" target="_blank" >10.1016/j.cor.2016.06.008</a>

Result language

angličtina

Original language name

Adaptive online scheduling of tasks with anytime property on heterogeneous resources

Original language description

An acceptable response time of a server is an important aspect in many client-server applications; this is evident in situations in which the server is overloaded by many computationally intensive requests. In this work, we consider that the requests, or in this case tasks, generated by the clients are instances of optimization problems solved by anytime algorithms, i.e. the quality of the solution increases with the processing time of a task. These tasks are submitted to the server which schedules them to the available computational resources where the tasks are processed. To tackle the overload problem, we propose a scheduling algorithm which combines traditional scheduling approaches with a quality control heuristic which adjusts the requested quality of the solutions and thus changes the processing time of the tasks. Two efficient quality control heuristics are introduced: the first heuristic sets a global quality for all tasks, whereas the second heuristic sets the quality for each task independently. Moreover, in practice, the relationship between the processing time and the quality is not known a priori. Because it is crucial for scheduling algorithms to know at least the estimation of these relationships, we propose a general procedure for estimating these relationships using information obtained from the already executed tasks. Finally, the performance of the proposed scheduling algorithm is demonstrated on a real-world problem from the domain of personnel rostering with very good results.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computers & Operations Research

ISSN

0305-0548

e-ISSN

—

Volume of the periodical

76

Issue of the periodical within the volume

December

Country of publishing house

US - UNITED STATES

Number of pages

23

Pages from-to

95-117

UT code for WoS article

000383008100009

EID of the result in the Scopus database

2-s2.0-84977674493