Premium
Scheduling of client‐server applications
Author(s) -
Blażewicz J.,
Dell'Olmo P.,
Drozdowski M.
Publication year - 1999
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.1999.tb00160.x
Subject(s) - computer science , scheduling (production processes) , distributed computing , schedule , job shop scheduling , client–server model , parallel computing , mathematical optimization , server , computer network , operating system , mathematics
In this paper, we analyze the problem of deterministic scheduling of applications (programs) in a client‐server environment. We assume that the client reads data from the server, processes it, and stores the results on the server. This paradigm can also model a wider class of parallel applications. The goal is to find the shortest schedule. It is shown that the general problem is computationally hard. However, any list scheduling algorithm delivers solutions not worse than twice the optimum when tasks are preallocated, and three times the optimum when tasks are not preallocated. A polynomially solvable case is also presented.