Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
1998-03-11
2001-05-08
Harrell, Robert B. (Department: 2152)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
Reexamination Certificate
active
06230183
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to a method and apparatus for controlling the number of servers in an information handling system in which incoming work requests belonging to a first service class are placed in a queue for processing by one or more servers.
2. Description of the Related Art
Systems in which incoming work requests are placed in a queue for assignment to an available server are well known in the art. Since the frequency at which the incoming requests arrive may not be readily controlled, the principal means of controlling system performance (measured by queue delay or the like) in such a queued system is to control the number of servers. Thus, it is known in the art to start an additional server when the length of the queue being served reaches a certain high threshold or to stop a server when the length of the queue being served reaches a certain low threshold. While such an expedient may achieve its design objectives, it is unsatisfactory in a system in which other units of work besides the queued work requests are contending for system resources. Thus, even though providing an additional server for a queue may enhance the performance of the work requests in that queue, providing such a server may so degrade the performance of other units of work being handled by the system that the performance of the system as a whole deteriorates.
Most current operating system software is not able to take over the responsibility for managing the number of servers according to the end-user oriented goals specified for the work requests and considering other work with independent goals running in the same computer system.
The commonly assigned copending application of J. D. Aman et al., Ser. No. 081828,440, filed Mar. 28, 1997, discloses a method and apparatus for controlling the number of servers on a particular system in which incoming work requests belonging to a first service class are placed in a queue for processing by one or more servers. The system also has units of work assigned to at least one other service class that acts as a donor of system resources. In accordance with the invention, a performance measure is defined for the first service class as well as for at least one other service class. Before adding servers to the first service class, there is determined not only the positive effect on the performance measure for the first service class, but also the negative effect on the performance measure for the other service class. Servers are added to the first service class only if the positive effect on the performance measure for the first service class outweighs the negative effect on the performance measure for the other service class.
While the invention disclosed in this copending application considers the impact on other work when deciding whether to add servers, it does so in the context of a single system. In a multisystem complex (“sysplex”), however, a single queue of work requests may be serviced by servers from across the complex. Thus, for a given queue, the decision may involve not only whether to add a server, but where to add the server to optimize overall sysplex performance.
SUMMARY OF THE INVENTION
The present invention relates to a method and apparatus for controlling the number of servers in a cluster of information handling systems in which incoming work requests belonging to a first service class are placed in a queue for processing by one or more servers. Some of the incoming work requests may have a requirement to run only on a subset of the servers in the cluster. Work requests that have such a requirement are said to have an affinity to the subset of systems in the cluster that they must run on. In accordance with this invention, servers are started on one or more of the systems in the clusters to process the work requests in the queue. The systems on which to start these servers are chosen to take advantage of the total capacity of the cluster of systems, to meet the affinity requirements of the work requests, and to minimize the effect on other work that might be running on the systems in the cluster. The system on which new servers are started also has units of work assigned to a second service class that acts as a donor of system resources. In accordance with the invention, a performance measure is defined for the first service class as well as for the second service class. Before adding servers to the first service class, there is determined not only the positive effect on the performance measure for the first service class, but also the negative effect on the performance measure for the second service class. Servers are added to the first service class only if the positive effect on the performance measure for the first service class outweighs the negative effect on the performance measure for the second service class.
The present invention allows system management of the number of servers across a cluster of system for each of a plurality of user performance goal classes based on the performance goals of each goal class. Tradeoffs are made that consider the impact of addition or removal of servers on competing goal classes.
REFERENCES:
patent: 4468736 (1984-08-01), DeSantis et al.
patent: 5170466 (1992-12-01), Rogan et al.
patent: 5253342 (1993-10-01), Blount et al.
patent: 5283897 (1994-02-01), Georgiadis et al.
patent: 5414845 (1995-05-01), Behm et al.
patent: 5428781 (1995-06-01), Duault et al.
patent: 5473773 (1995-12-01), Aman et al.
patent: 5504894 (1996-04-01), Ferguson et al.
patent: 5537542 (1996-07-01), Eilert et al.
patent: 5603029 (1997-02-01), Aman et al.
patent: 5630133 (1997-05-01), Hotea et al.
patent: 5675739 (1997-10-01), Eilert et al.
patent: 5974462 (1999-10-01), Aman et al.
patent: 0 694 837 A1 (1996-01-01), None
patent: 0 750 256 A2 (1996-12-01), None
patent: 0 798 639 A1 (1997-10-01), None
patent: 3-40034 (1991-02-01), None
patent: 07281982 (1995-10-01), None
patent: 07281908 (1995-10-01), None
patent: 09101902 (1997-04-01), None
patent: 09212468 (1997-08-01), None
IBM Technical Bulletin, vol. 40, No. 07, Jul. 1997 entitled “Method of Compute Resource Allocation in a Batch Job Submission Environment”, pp. 7-8.
EPEMA, D.H.J. et al., “A Worldwide Flock Of Condors: Load Sharing Among Workstation Clusters”, Future Generations Computer Systems, NL, Elsevier Science Publishers, Amsterdam, vol. 12, No. 1, May 1, 1996, pp. 53-65, XP000591704, ISSN: 0167-739X.
IBM Technical Disclosure Bulletin, vol. 33, No. 6B, 11/90 “Direct Interface To Submit and Process User's Request”, pp. 126-127.
IBM Technical Disclosure Bulletin, vol. 39, No. 06, 6/96 “Distributed Parallel Build System for . . . Systems”, pp. 63-68.
OS/390 MVS Planning: Workload Management, First Edition, Mar. 1996, Form No. GC28-1761-00.
OS/390 MVS Planning: Workload Management Services, First Edition, Mar. 1996, Form No. GC28-1773-00.
Arwe John E.
Eilert Catherine K.
Yocom Peter B.
Harrell Robert B.
International Business Machines - Corporation
Kinnaman, Jr. William A.
LandOfFree
Method and apparatus for controlling the number of servers... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for controlling the number of servers..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for controlling the number of servers... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2436741