Online Scheduling System for Server Based Personnel Rostering Applications

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00223443" target="_blank" >RIV/68407700:21230/14:00223443 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Online Scheduling System for Server Based Personnel Rostering Applications

Popis výsledku v původním jazyce

In the recent time many software applications have web based character. It means that the computer of the user is used as a terminal while the application is running on a server. Nevertheless, the server may be a bottleneck of the application from the performance point of view. All data manipulations and all computations are processed there and if the server is overloaded it usually causes slow reactions of the application measured by response time of the server. In this paper we consider a server basedpersonnel rostering application where many users send their requests at the same time. To solve the requests the server uses a heterogeneous grid, i.e. a collection of computer resources such that each one has different speed. A single request of a useris called task which has to be mapped and solved on a computer resource. The tasks are usually solved by anytime algorithms. It means that if the algorithm is interrupted earlier (but not before the minimal execution time) the solution i

Název v anglickém jazyce

Online Scheduling System for Server Based Personnel Rostering Applications

Popis výsledku anglicky

In the recent time many software applications have web based character. It means that the computer of the user is used as a terminal while the application is running on a server. Nevertheless, the server may be a bottleneck of the application from the performance point of view. All data manipulations and all computations are processed there and if the server is overloaded it usually causes slow reactions of the application measured by response time of the server. In this paper we consider a server basedpersonnel rostering application where many users send their requests at the same time. To solve the requests the server uses a heterogeneous grid, i.e. a collection of computer resources such that each one has different speed. A single request of a useris called task which has to be mapped and solved on a computer resource. The tasks are usually solved by anytime algorithms. It means that if the algorithm is interrupted earlier (but not before the minimal execution time) the solution i

Druh

O - Ostatní výsledky

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/7H12008" target="_blank" >7H12008: Design, Monitoring and Operation of Adaptive Networked Embedded Systems</a><br>

Návaznosti

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

Rok uplatnění

2014

Kód důvěrnosti údajů

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