System of assigning work requests based on classifying into an e

Details System of assigning work requests based on classifying into an e System of assigning work requests based on classifying into an e

1995-06-07

1997-02-11

Lee, Thomas C.

Boots, shoes, and leggings

395616, 395859, 39520001, 36424294, 364229, 3642303, 364286, 364281, 3642844, G06F 1506

Patent

active

056030290

ABSTRACT:
Apparatus and accompanying methods for use preferably in a multi-system shared data (sysplex) environment (100), wherein each system (110) provides one or more servers (115), for dynamically and adaptively assigning and balancing new work and for new session requests, among the servers in the sysplex, in view of attendant user-defined business importance of these requests and available sysplex resource capacity so as to meet overall business goals. Specifically, systems and servers are categorized into two classes: eligible, i.e., goal-oriented servers running under a policy and for which capacity information is currently available, and candidate, i.e., servers which lack capacity information. Work requests for a client application are assigned first to various eligible systems and eligible servers thereon based on their current capacity to accept new work and in a manner that meets business goals inherent in a sysplex policy; followed, if additional servers are requested by that application, to candidate systems and candidate servers thereon. As to session placement, first those system(s) are selected that have lowest utilization, at a target importance level, but with sufficient available capacity at that level. Competing servers on the selected system(s) are then evaluated based on their corresponding session count data to yield a single resulting server. Thereafter, identification of multiple servers and their corresponding weights are returned to, e.g., a client application, for eventual routing of work requests to those servers, or the identification of a single server is returned to that application for establishing a new session therewith.

REFERENCES:
patent: 4481583 (1984-11-01), Mueller
patent: 5241677 (1993-08-01), Naganuma et al.
patent: 5341477 (1994-08-01), Pitkin et al.
patent: 5537542 (1996-07-01), Eilert et al.
D. Sitaram et al, Issues in the . . . Load Skew, Parallel and Distributed Information Systems, pp. 214-223 1993.
Lin et al., "A Dynamic Load Balancing Policy with a Central Job Dispatcher (LBC)", Proceedings of the Eleventh International Conference on Distributed Computing Systems, Arlington, Texas, 20-24 May 1991, pp. 264-271.
Geise, "Dynamic Load Balancing in a Cluster of Loosely Coupled Systems", IBM Technical Disclosure Bulletin, vol. 37, No. 7, Jul. 1994, pp. 243-244.
Herrin II, et al., "The Benefits of Service Rebalancing", Proceedings of the Third Workship on Workstation Operating Systems, Key Biscayne, FL, 23-24 Apr. 1992, pp. 104-110.
Menditto et al., "Single System Image And Load Balancing For Network Access To A Loosely Coupled Complex", IBM Technical Disclosure Bulletin, vol. 34, No. 9, Feb. 1992, pp. 464-271.

Affiliated with

Also associated with

Rating

System of assigning work requests based on classifying into an e does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System of assigning work requests based on classifying into an e, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System of assigning work requests based on classifying into an e will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-350501