Task allocation in distributed processing systems
Distributed processing in computer networks is a powerful development emanating from technological advances in computer science and communications research. An important unresolved problem in distributed processing is how to optimally allocate jobs among interconnected processors. We develop a dynamic programming algorithm which incorporates many of the essential problem elements. Computational results are encouraging for problems of realistic size.
scientific article; zbMATH DE number 3974773