Executing an incoming job on the least loaded of the machines of a distributed system can considerably improve its response time. To make the right choice, it is useful to have some information both about the load on the machines of the system and about the job we are considering. The information about the load ought to indicate the resources a machine is able to give, whereas the information about the job must tell which resources the job is going to need. We developed a multivariable scheme to distribute load information and to match a machine's available resources with a job's specific requirements. The experiments we performed with a prototype implementation show that our tool is able to make the right choice on a set of test jobs between 55 and 88% of the times. Our purpose is to shed light on some controversial issues, in order to prune the intricate complexity of the problem and open the way to future more general implementations.
Title
A Multivariable Information Scheme to Balance the Load in a Distributed System
Published
1985-05-12
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-85-234
Type
Text
Extent
32 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
