Technical Report TR-1994-09

BibliographyBecker, Wolfgang; Pollak, Rainer: Efficiency of server task queueing for dynamic load balancing.
University of Stuttgart, Faculty of Computer Science, Technical Report No. 1994/09.
12 pages, english.
CR-SchemaC.2.4 (Distributed Systems)
C.4 (Performance of Systems)
D.4.8 (Operating Systems Performance)
Abstract

In this paper we investigate optimal points of time for task assignment in dynamic load balancing schemes. Normally final assignment of tasks to server queues is made at the latest possible time. The main reason for a late assignment is, that a dynamic load balancer can use most recent information about system and application state for the decision. In general however, assignment can be done at task arrival time, at the moment when a processor or server becomes idle, or when significant load changes in the system occur. We will elaborate preconditions and circumstances for situations, where it is advantageous to assign tasks earlier than necessary, i.e. to queue them at the servers. We verify the results in an experimental load balancing environment.

Full text and
other links
HTML (generated from PostScript)
Department(s)University of Stuttgart, Institute of Parallel and Distributed High-Performance Systems, Applications of Parallel and Distributed Systems (Prof. Reuter)
Entry dateJune 18, 1996
   Publ. Computer Science