Scheduling of client-server applications

✍ Scribed by Jacek Błażewicz; Paolo Dell’Olmo; Maciej Drozdowski

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 889 KB
• Volume: 6
• Category: Article
• ISSN: 0969-6016
• DOI: 10.1016/s0969-6016(98)00060-4

✦ Synopsis

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 ®nd 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.