The field of invention relates generally to the software arts; and, more specifically to an architecture that promotes high reliability and iterative load balancing with multiple worker nodes.
Even though standards-based application software (e.g., Java based application software) has the potential to offer true competition at the software supplier level, legacy proprietary software has proven reliability, functionality and integration into customer information systems (IS) infrastructures. Customers are therefore placing operational dependency on standards-based software technologies with caution. Not surprisingly, present day application software servers tend to include both standard and proprietary software suites, and, often, “problems” emerge in the operation of the newer standards-based software, or interoperation and integration of the same with legacy software applications.
The prior art application server 100 depicted in
The back and forth communication typically involves a client (“client”) sending a server 100 (“server”) a “request” that the server 100 interprets into some action to be performed by the server 100. The server 100 then performs the action and if appropriate returns a “response” to the client (e.g., a result of the action). Often, a session will involve multiple, perhaps many, requests and responses. A single session through its multiple requests may invoke different application software programs.
For each client request that is received by the application server's connection manager 102, the connection manager 102 decides to which software suite 103, 104 the request is to be forwarded. If the request is to be forwarded to the proprietary software suite 103, notification of the request is sent to a proprietary dispatcher 105, and, the request itself is forwarded into a request/response shared memory 106. The proprietary dispatcher 105 acts as a load balancer that decides which one of multiple proprietary worker nodes 1071 through 107L are to actually handle the request.
A worker node is a focal point for the performance of work. In the context of an application server that responds to client-server session requests, a worker node is a focal point for executing application software and/or issuing application software code for downloading. The term “working process” generally means an operating system (OS) process that is used for the performance of work and is also understood to be a type of worker node. For convenience, the term “worker node” is used throughout the present discussion.
When a particular proprietary worker node has been identified by dispatcher 105 for handling the aforementioned request, the request is transferred from the request/response shared memory 106 to the identified worker node. The identified worker node processes the request and writes the response to the request into the request/response shared memory 106. The response is then transferred from the request/response shared memory 106 to the connection manager 102. The connection manager 102 sends the response to the client via network 101.
Note that the request/response shared memory 106 is a memory resource that each of worker nodes 1071 through 107L has access to (as such, it is a “shared” memory resource). For any request written into the request/response shared memory 106 by the connection manager 102, the same request can be retrieved by any of worker nodes 1071 through 107L. Likewise, any of worker nodes 1071 through 107L can write a response into the request/response shared memory 106 that can later be retrieved by the connection manager 102. Thus the request/response shared memory 106 provides for the efficient transfer of request/response data between the connection manager 102 and the multiple proprietary worker nodes 1071 through 107L.
If the request is to be forwarded to the standards based software suite 104, notification of the request is sent to the dispatcher 108 that is associated with the standards based software suite 104. As observed in
A Java Virtual Machine is associated with each worker node for executing the worker node's abstract application software code. For each request, dispatcher 108 decides which one of the N worker nodes is best able to handle the request (e.g., through a load balancing algorithm). Because no shared memory structure exists within the standards based software suite 104 for transferring client session information between the connection manager 102 and the worker nodes 1091 through 109N, separate internal connections have to be established to send both notification of the request and the request itself to the dispatcher 108 from connection manager 102 for each worker node. The dispatcher 108 then forwards each request to its proper worker node.
b shows a more detailed depiction of the J2EE worker nodes 1091 through 109N of the prior art system of
A virtual machine, as is well understood in the art, is an abstract machine that converts (or “interprets”) abstract code into code that is understandable to a particular type of a hardware platform (e.g., a particular type of processor). Because virtual machines operate at the instruction level they tend to have processor-like characteristics, and, therefore, can be viewed as having their own associated memory. The memory used by a functioning virtual machine is typically modeled as being local (or “private”) to the virtual machine. Hence,
Various problems exist with respect to the prior art application server 100 of
A method is described that involves entering a notification of a request into a queue that supplies request notifications to a first worker node amongst a plurality of worker nodes. The first worker node is targeted to process the request. Before the notification is serviced from the first queue, the notification is withdrawn from the first queue. The notification may be discarded or dispatched to a second queue that supplies request notifications to a second worker node amongst the plurality of worker nodes.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
a shows a prior art application server;
b shows a more detailed depiction of the J2EE worker nodes of
a and 3b show a session request and response methodology that can be performed by the improved system of
a shows a methodology for with sessions that have been targeted for a worker node to another worker node;
b shows a methodology for withdrawing requests for sessions that have been targeted for a worker node;
a through 6c depict the transfer of a session whose request notification was targeted for a worker node;
Comparing
Secondly, the role of a shared memory has been expanded to at least include: a) a first shared memory region 250 that supports request/response data transfers not only for the proprietary suite 203 but also the standards based software suite 204; b) a second shared memory region 260 that stores session objects having “low level” session state information (i.e., information that pertains to a request's substantive response such as the identity of a specific servlet invoked through a particular web page); and, c) a third shared memory region 270 that stores “high level” session state information (i.e., information that pertains to the flow management of a request/response pair within the application server (e.g., the number of outstanding active requests for a session)).
Third, request notification queues 212 Q1 through QM, one queue for each of the worker nodes 2091 through 209M has been implemented within the standards-based software suite 204. As will be described in more detail below, the shared memory structures 250, 260, 270 and request notification queues 212 help implement a fast session fail over protection mechanism in which a session that is assigned to a first worker node can be readily transferred to a second worker node upon the failure of the first worker node, or simply a mechanism to withdraw a request for a session, or the session itself, assigned to the first worker node, and then either discard or transfer the request to a second worker node before the first worker node processes a pending request.
Shared memory is memory whose stored content can be reached by multiple worker nodes. Here, the contents of each of the shared memory regions 250, 260 and 270 can be reached by each of worker nodes 2091 through 209M. Different types of shared memory technologies may be utilized within the application server 200 and yet still be deemed as being a shared memory structure. For example, shared memory region 250 may be implemented within a “connection” oriented shared memory technology, while shared memory region 260 may be implemented with a “shared closure” oriented shared memory technology. A more thorough discussion of these two different types of shared memory implementations is provided in more detail below in section 6.0 entitled “Implementation Embodiment of Request/Response Shared Memory” and section 7.0 entitled “Implementation Embodiment of Shared Closure Based Shared Memory”.
The connection oriented request/response shared memory region 250 effectively implements a transport mechanism for request/response data between the connection manager and the worker nodes. That is, because the connection manager is communicatively coupled to the shared memory, and because shared memory contents can be made accessible to each worker node, the request/response shared memory 250—at perhaps its broadest level of abstraction—is a mechanism for transporting request/response data between the connection manager and the applicable worker node(s) for normal operation sessions (i.e., no worker node failure) as well as those sessions affected by a worker node congestion, overload, or crash.
Although the enhancements of the application server 200 of
In operation, the connection manager 202 forwards actual request data to the first shared memory region 250 (request/response shared memory 250) regardless of whether the request is to be processed by one of the proprietary worker nodes 207 or one of the standards based worker nodes 204. Likewise, the connection manager 202 receives response data for a request from the request/response shared memory 250 irregardless if the response was generated by a proprietary worker node or a standards based worker node. With the exception of having to share the request/response shared memory 250 with the worker nodes 209 of the standards-based software suite 204, the operation of the proprietary suite 203 is essentially the same as that described in the background.
That is, the connection manager 202 forwards request notifications to the proprietary dispatcher 205 and forwards the actual requests to the request/response shared memory 250. The proprietary dispatcher 205 then identifies which one of the proprietary worker nodes 207 is to handle the request. The identified worker node subsequently retrieves the request from the request/response shared memory 250, processes the request and writes the response into the request/response shared memory 250. The response is then forwarded from the request/response shared memory 250 to the connection manager 202 who forwards the response to the client via network 201.
a and 3b show an improved session handling flow that is used within the standards based software suite 204 of the improved application server 200 of
Then, the dispatcher 308 for the standards-based software suite is invoked. One possible dispatching algorithm that is executed by the dispatcher 308 is described in more detail further below in Section 3.0 entitled “Dispatching Algorithm”. For purposes of the present discussion it is sufficient to realize that the dispatcher 308: 1) accesses and updates at 1 “high level” state information 3701 for the request's session in the shared memory session table 370 (hereinafter, referred to as session table 370); 2) determines which one 309 of the M worker nodes should handle the newly arrived request; and 3) submits at 2 the request 3221 into the request/response shared memory 350 and submits at 3 a request notification 3201 for the request 3221 into a request notification queue Q1 that is associated with the worker node 309 identified by the dispatching algorithm. For ease of drawing,
In an embodiment, there is an entry in the session table 370 for each session being supported by the M worker nodes. If the received request is for a new session (i.e., the received request is the first request of the session), the dispatcher process 308 will create at 1 a new entry 3701 in the session table 370 for the new session and assign at 2 one of the M worker nodes to handle the session based on a load balancing algorithm. By contrast, if the received request pertains to an already existing session, the dispatcher process 308 will access at 1 the already existing entry 3701 for the session and use the information therein to effectively determine the proper worker node to handle the request as well as update at 1 the session table entry 3701. In an embodiment, as will be described in detail further below in Section 3.0, in the case of an already existing session, the determination of the proper worker node may or may not involve the execution of a load balancing algorithm.
In an embodiment, the following items are associated with each session table entry 3701: 1) a “key” used to access the session table entry 3701 itself (e.g., session key “SK1”); 2) an active request count (ARC) that identifies the total number of requests for the session that have been received from network 301 but for which a response has not yet been generated by a worker node; 3) an identifier of the worker node 309 that is currently assigned to handle the session's requests (e.g., “Pr_ldx”, which, in an embodiment, is the index in the process table of the worker node that is currently assigned to handle the session's requests); and, 4) some form of identification of the request notification queue (Q1) that provides request notifications to the worker node 309 identified in 3) above.
In a further embodiment, each entry in the session table 370 further includes: 1) a flag that identifies the session's type (e.g., as described in more detail further below in Section 3.0, the flag can indicate a “distributed” session, a “sticky” session, or a “corrupted” session); 2) a timeout value that indicates the maximum amount of time a request can remain outstanding, that is, waiting for a response; 3) the total number of requests that have been received for the session; 4) the time at which the session entry was created; and, 5) the time at which the session entry was last used.
For each request, whether a first request of a new session or a later request for an already established session, the dispatcher's dispatching algorithm 308 increments the ARC value and at 8 places a “request notification” RN_13201, into the request notification queue Q1 that feeds request notifications to the worker node 309 that is to handle the session. The request notification RN_1 contains both a pointer to the request data RQD_13221 in the request/response shared memory and the session key SK1 in the session table entry for the session.
The pointer is generated by that portion of the connection manager 302 that stores the request data RQD_13221 into the request/response shared memory 350 and is provided to the dispatcher 308. The pointer is used by the worker node 309 to fetch the request data RQD_13221 from the request/response shared memory 350, and, therefore, the term “pointer” should be understood to mean any data structure that can be used to locate and fetch the request data. The session key (or some other data structure in the request notification RN_1 that can be used to access the session table entry 3701 for the session) is used by the worker node 309 to decrement the ARC counter to indicate the worker node 309 has fully responded to the request.
As will be described in more detail below in section 6.0 entitled “Implementation Embodiment of Request/Response Shared Memory”, according to a particular implementation, the request/response shared memory 350 is connection based. Here, a connection is established between the targeted (assigned) worker node 309 and the connection manager 302 through the request/response shared memory 350 for each request/response cycle that is executed in furtherance of a particular session; and, a handle for a particular connection is used to retrieve a particular request from the request/response shared memory 350 for a particular request/response cycle. According to this implementation, the pointer in the request notification RN is the “handle” for the shared memory 350 connection that is used to fetch request data RQD_13221.
In the case of a first request for a new session, the dispatcher 308 determines which worker node should be assigned to handle the session (e.g., with the assistance of a load balancing algorithm) and places the identity of the worker node's request notification queue (Q1) into a newly created session table entry 3701 for the session along with some form of identification of the worker node itself (e.g., “Pr_ldx”, the index in the process table of the worker node that is currently assigned to handle the session's requests). For already existing sessions, the dispatcher 308 simply refers to the identify of the request notification queue (Q1) in the session's session table entry 3701 in order to understand which request notification queue the request notification RN should be entered into.
In a further embodiment, a single session can entertain multiple “client connections” over its lifespan, where, each client connection corresponds to a discrete time/action period over which the client engages with the server. Different client connections can therefore be setup and torn down between the client and the server over the course of engagement of an entire session. Here, depending on the type of client session, for example in the case of a “distributed” session (described in more detail further below), the dispatcher 308 may decide that a change should be made with respect to the worker node that is assigned to handle the session. If such a change is to be made the dispatcher 308 performs the following within the entry 3701 for the session: 1) replaces the identity of the “old” worker node with the identity of the “new” worker node (e.g., a “new” Pr_ldx value will replace an “old” Pr_ldx value); and, 2) replaces the identification of the request notification queue for the “old” worker nodewith an identification of the request notification queue for the “new” worker node.
In another embodiment, over the course a single session and perhaps during the existence of a single client connection, the client may engage with different worker node applications. Here, a different entry in the session table can be entered for each application that is invoked during the session. As such, the level of granularity of a session's management is drilled further down to each application rather than just the session as a whole. A “session key” (SK1) is therefore generated for each application that is invoked during the session. In an embodiment, the session key has two parts: a first part that identifies the session and a second part that identifies the application (e.g., numerically through a hashing function).
Continuing then with a description of the present example, with the appropriate worker node 309 being identified by the dispatcher 308, the dispatcher 308 concludes with the submission at 2 of the request RQD_13221 into the request/response shared memory 350 and the entry at 3 of a request notification RN_13201 into the queue Q1 that has been established to supply request notifications to worker node 309. The request notification RN_13201 sits in its request notification queue Q1 until the targeted worker node 309 foresees an ability (or has the ability) to process the corresponding request 3221. Recall that the request notification RN_13201 includes a pointer to the request data itself RQD_13221 as well as a data structure that can be used to access the entry 3701 in the session table (e.g., the session key SK1).
Comparing
When the targeted worker node 309 foresees an ability to process the request 3221, it looks to its request notification queue Q1 and retrieves at 4 the request notification RN_13201 from the request notification queue Q1.
The targeted worker node 309 also assumes control of one or more “session” objects S13232 used to persist “low level” session data. Low level session data pertains to the request's substantive response rather than its routing through the application server. If the request is the first request for a new session, the targeted worker node 309 creates the session object(s) S13232 for the session; or, if the request is a later request of an existing session, the targeted worker node 309 retrieves 6 previously stored session object(s) S13231 from the “shared closure” memory region 360 into the targeted worker node 3232 . The session object(s) S1 may 3231 be implemented as a number of objects that correspond to a “shared closure”. A discussion of shared closures and an implementation of a shared closure memory region 360 is provided in more detail further below in section 7.0 entitled “Implementation Embodiment of Shared Closure Based Shared Memory”.
With respect to the handling of a new session, the targeted worker node 309 generates a unique identifier for the session object(s) S1323 according to some scheme. In an embodiment, the scheme involves a random component and an identifier of the targeted worker node itself 309. Moreover, information sufficient to identify a session uniquely (e.g., a sessionid parameter from a cookie that is stored in the client's browser or the URL path of the request) is found in the header of the request RQD_13222 whether the request is the first request of a new session or a later requests of an existing session. This information can then be used to fetch the proper session object(s) S1323 for the session.
b depicts the remainder of the session handling process. With the targeted worker node 309 having the request RQD_13222 and low level session state information via session object(s) S13232 , the request is processed by the targeted worker node 309 resulting in the production of a response 324 that is to be sent back to the client. The worker node 309 writes at 7 the response 324 into the response/request shared memory 350; and, if a change to the low level session state information was made over the course of generating the response, the worker node 309 writes at 8 updated session object(s) into the shared closure memory 360. Lastly, the worker node 309 decrements at 9 the ARC value in the session table entry 3701 to reflect the fact that the response process has been fully executed from the worker node's perspective and that the request has been satisfied. Here, recall that a segment of the request notification RN_13202(e.g., the session key SK1) can be used to find a “match” to the correct entry 3701 in the session table 370 in order to decrement of the ARC value for the session.
In reviewing the ARC value across
After the response 324 is written at 7 into the request/response shared memory 350, it is retrieved at 10 into the connection manager 302 which then sends it to the client over network 301.
Recall from the discussions of
A distributable session is a session that permits the handling of its requests by different worker nodes over the course of its regular operation (i.e., no worker node crash). A sticky session is a session whose requests are handled by only one worker node over the normal course of its operation. That is, a sticky session “sticks” to the one worker node. According to an implementation, each received request that is to be processed by any of worker nodes 209 is dispatched according to the process 400 of
Before execution of the dispatching process 400, the connection manager 202, 302 will understand: 1) whether the request is the first request for a new session or is a subsequent request for an already existing session (e.g., in the case of the former, there is no “sessionID” from the client's browser's cookie in the header of the request, in the later case there is a such a “sessionID”); and, 2) the type of session associated with the request (e.g., sticky or distributable). In an embodiment, sessions start out as distributable as a default but can be changed to “sticky”, for example, by the worker node that is presently responsible for handling the session.
In the case of a first request for a new session 401, a load balancing algorithm 407 (e.g., round robin based, weight based (e.g., using the number of un-serviced request notifications as weights)) is used to determine which one of the M worker nodes is the proper worker node to handle the request. The dispatching process then writes 408 a new entry for the session into the session table that includes: 1) the sticky or distributable characterization for the session; and, 2) an ARC value of 1 for the session; 3) some form of identification of the worker that has been targeted; and, 4) the request notification queue for the worker node identified by 3). In a further embodiment, a session key is also created for accessing the newly created entry.
If the request is not a first request for a new session 401, whether the received request corresponds to a sticky or distributable session is understood by reference to the session table entry for the session. If the session is a sticky session 402, the request is assigned to the worker node that has been assigned to handle the session 405. According to the embodiment described with respect to
The ARC value in the session's session table entry is incremented and the request notification RN for the session is entered into the request notification queue for the worker node assigned to handle the session 408. Recall that the request notification RN includes both a pointer to the request in the request/response shared memory as well as a data structure that can be used by the targeted worker node to access the correct session table entry. The former may be provided by the functionality of the connection manager that stores the request into the request/response shared memory and the later may be the session key.
If the session is a distributable session 402, and if the ARC value obtained from the retrieval of the session's session table entry is greater than zero 404, the request is assigned to the worker node that has been assigned to handle the session 405. Here, an ARC greater than zero means there still exists at least one previous request for the session for which a response has not yet been generated.
The ARC value for the session is then incremented in the session's session table entry and the request notification RN for the session is directed to the request notification queue for the worker node assigned to handle the session 408.
If the ARC value is not greater than zero 404, the request is assigned to the worker node that has been assigned to handle the session 405 if the request notification queue for the assigned worker node is empty 406. This action essentially provides an embedded load balancing technique. Since the request notification queue is empty for the worker node that has been assigned to handle the session, the latest request for the session may as well be given to the same worker node.
The ARC value for the session is then incremented in the session's session table entry and the request notification RN for the session is directed to the request notification queue for the worker node assigned to handle the session 408.
If the ARC value is not greater than zero 404, the request is assigned to a new worker node 407 (through a load balancing algorithm) if the request notification queue for the previously assigned worker node is not empty 406. In this case, there are no un-responded to requests for the session (i.e., ARC=0), the worker node assigned to the session has some backed-up traffic in its request notification queue, and the session is distributable. As such, to improve overall efficiency, the request can be assigned to a new worker node that is less utilized than the previous worker node assigned to handle the session.
The ARC value for the session is incremented in the session's session table entry and the request notification RN for the session is directed to the request notification queue for the new worker node that has just been assigned to handle the session 408.
a and 6a,b,c together describe a scheme for rescuing one or more sessions whose request notifications have been queued into the request notification queue for a particular worker node that crashes before the request notifications are serviced from the request notification queue.
Request notifications 625, 626 are also queued into the request notification queue Q1 for worker node 6091. Request notification 625 corresponds to a second session that session table 670 entry SK2 and request 628 are associated with. Request notification 626 corresponds to a third session that session table entry SK3 and request 629 are associated with.
b shows activity that transpires after worker node 6091 crashes at the time of the system state observed in
Here, recall that in an embodiment, some form of identification of the worker node that is currently assigned to handle a session's requests is listed in that session's session table entry. For example, recall that the “Pr_ldx” index value observed in each session table entry in
In the particular example of
Referring back to
Thus, the ARC value is decremented for the SK2 session entry in session table 670 and the ARC value is decremented for the SK3 session entry in session table 670. Because the ARC value for each of the SK1, SK2 and SK3 sessions was set equal to 1.0 prior to the crash of worker node 6091 (referring briefly back to
Because the request notification 624 for the SK1 entry had been removed from the request notification queue Q1 prior to the crash, it could not be “retracted” in any way and therefore its corresponding ARC value could not be decremented. As such, the ARC value for the SK1 session remains at 1.0 as observed in
Once the decrements have been made for each extracted request notification 502, at 2, decisions can be made as to which “affected” sessions are salvageable and which “affected” sessions are not salvageable. Specifically, those affected sessions who have decremented down to an ARC value of zero are deemed salvageable; while, those affected sessions who have not decremented down to an ARC value of zero are not deemed salvageable.
Having the ARC value of an affected session decrement down to a value of zero by way of process 502 corresponds to the extraction of a request notification from the failed worker node's request notification queue for every one of the session's non-responded to requests. This, in turn, corresponds to confirmation that the requests themselves are still safe in the request/response shared memory 650 and can therefore be subsequently re-routed to another worker node. In the simple example of
The first session SK1 did not decrement down to a value of zero, which, in turn, corresponds to the presence of its request RQD_1624 being processed by the worker node 6091 at the time of its crash. As such, the SK1 session will be marked as “corrupted” and eventually dropped.
As another example, assume that each of the request notifications 624, 625, 626 where for the same “first” SK1 session. In this case there would be only one session table 670 entry SK1 in
Referring to
Referring to
From the state of the system observed in
Note that if different worker nodes were identified as the new target nodes for the second and third sessions, the request notifications 625, 626 would be entered in different request notification queues.
For distributable sessions, reassignment to a new worker node is a non issue because requests for a distributable session can naturally be assigned to different worker nodes. In order to advocate the implementation of a distributable session, in an implementation, only the session object(s) for a distributable session is kept in shared closure shared memory 660. Thus, the examples provided above with respect to
For sticky sessions various approaches exist. According to a first approach, session fail over to a new worker node is not supported and sticky sessions are simply marked as corrupted if the assigned worker node fails (recalling that session table entries may also include a flag that identifies session type).
According to a second approach, session fail over to a new worker node is supported for sticky sessions. According to an extended flavor of this second approach, some sticky sessions may be salvageable while others may not be. According to one such implementation, the session object(s) for a sticky session are kept in the local memory of a virtual machine of the worker node that has been assigned to handle the sticky session (whether the sticky session is rescuable or is not rescuable). Here, upon a crash of a worker node's virtual machine, the session object(s) for the sticky session that are located in the virtual machine's local memory will be lost.
As such, a sticky sessions can be made “rescuable” by configuring it to have its session object(s) serialized and stored to “backend” storage (e.g., to a hard disk file system in the application server or a persisted database) after each request response is generated. Upon a crash of a worker node assigned to handle a “rescuable” sticky session, after the new worker node to handle the sticky session is identified (e.g., through a process such as those explained by
b and 6a,b,c together describe a scheme for withdrawing one or more requests for which a corresponding one or more request notifications have been queued into the request notification queue for a particular worker node before the request notifications are serviced from the request notification queue. In one embodiment of the invention, once the requests are withdrawn, they may be discarded by the connection manager, or transferred by the connection manager to another worker node.
a shows an initial condition. A first request RQD_1627 (with a corresponding request notification RN_1624) for a first session is currently being processed by worker node 6091. As such, the session object(s) S1629 for the first session is also being used by worker node 6091. Request notifications RN_2625 and RN_3626 are also queued into the request notification queue Q1 for worker node 6091. Request notification 625 corresponds to a second session that session table 670 entry SK2 and request RD_2628 are associated with. Request notification 626 corresponds to a third session that session table entry SK3 and request RD_3629 are associated with.
At a time subsequent to the system state observed in
The connection manager may withdraw a request for any number of reasons, including, but not limited to, the request becomes stale because, e.g., a timer expires, the connection manager receives an indication that the client terminates or is to terminate its session with the worker node or otherwise becomes unavailable to receive a response to its request(s) from the worker node, another worker node is available or idle and the connection manager intends to redistribute or re-dispatch one or more active requests pending with one worker node to another worker node as part of a load balancing process, corruption in the request/response shared memory is detected, the connection manager detects anomalies with the operation of the worker node assigned to handle the requests and preempts processing of the requests to avoid jeopardizing or corrupting the sessions to which the requests relate, etc.
In any case, once the connection manager withdraws a request, it may choose to discard the request. Alternatively, the connection manager may decide to redirect or redispatch the request to another worker node, depending on the circumstances and reasons behind the connection manager withdrawing the request. If the connection manager is to redirect the request, the corresponding withdrawn request notification is transferred to the request notification queue associated with another worker node while the corresponding request is preserved (not moved) in shared memory. The handle in the request notification to the request is used (as it would have been had the request notification not been transferred) by the new worker node so that it can retrieve the request from shared memory when it services the request notification.
Going back to the withdrawal process in reference to
If the connection manager is simply withdrawing a request, the corresponding session table entry as identified above is deleted or removed from the table, in one embodiment of the invention. Additionally, the corresponding request in shared memory is removed. In one embodiment, removal may be simply discarding or otherwise no longer using a pointer to point to the session table entry or the request in shared memory.
If the connection manager decides to transfer a withdrawn request to another worker node, the process continues as follows, in one embodiment. Referring back to
Thus, the ARC value is decremented for the SK2 and SK3 session entries in session table 670. Because the ARC value for each of the SK1, SK2 and SK3 sessions was set to 1 prior to the withdrawal of request notifications queued for worker node 6091 (referring briefly back to
Because the request notification 624 for the SK1 entry had been removed from the request notification queue Q1 prior to the connection manager deciding to withdraw request notifications from queue Q1, it is not withdrawn and therefore its corresponding ARC value is not decremented. As such, the ARC value for the SK1 session remains at 1 as observed in
Once the decrements have been made for each extracted request notification 502, at 2, decisions can are made as to which “affected” sessions are to be transferred to another worker node for processing and which are not. In one embodiment, those affected sessions that have an ARC value of zero are transferred; while, those affected sessions that have an ARC value greater than zero are not transferred—they are processed by the worker node to which they were originally assigned.
Decrementing the ARC value of an affected session to zero at 502 indicates that every active request notification for a session has been withdrawn from the worker node's request notification queue. Likewise, the corresponding requests are still preserved in request/response shared memory 650 and can therefore be subsequently accessed by another worker node. In the simple example of
The first session SK1 did not decrement down to a value of zero, which, in turn, corresponds to its request RQD_1624 being processed by the worker node 6091 at the time the connection manager decided to withdraw requests from worker node 6091. As such, the SK1 session will be processed by the original worker node at 503.
As another example, assume that each of the request notifications 624, 625, 626 is for the same session, e.g., SK1. In this case only one session table 670 entry SK1 would exist in
Referring to
Referring to
From the state of the system observed in
In one embodiment of the invention, once the connection manager has withdrawn a request, the session table entry pointed to by the corresponding request notification queue (from which the corresponding request notification is consumed by the connection manager), may simply be modified by updating the Pr_ldx pointer value and Q value to indicate the new worker node to which the request is to be processed, and the accompanying request notification queue in which to transfer the request notification consumed by the connection manager. The ARC for the existing session table entry may be modified as well, depending on the number of request notifications pending in the request notification queue identified by the Q value in the session table entry.
Recall from above that according to a particular implementation, the request/response shared memory 250 has a connection oriented architecture. Here, a connection is established between the targeted worker node and the connection manager across the request/response shared memory 350 for each request/response cycle between the connection manager and a worker node. Moreover, a handle to a particular connection is used to retrieve a particular request from the request/response shared memory.
The connection oriented architecture allows for easy session handling transfer from a crashed worker node to a new worker node because the routing of requests to a new targeted worker node is accomplished merely by routing the handle for a specific request/response shared memory connection to the new worker node. That is, by routing the handle for a request/response shared memory connection to a new worker node, the new worker node can just as easily “connect” with the connection manager to obtain a request as the originally targeted (but now failed) worker node. Here, the “pointer” contained by the request notification is the handle for the request's connection.
In a further embodiment, referring to
Above the FCA level 702 is the jFCA level 703. The jFCA level 703 is essentially an API used by the Java worker nodes and relevant Java parts of the connection manager to access the FCA level 702. In an embodiment, the jFCA level is modeled after standard Java Networks Socket technology. At the worker node side, however, a “jFCA connection” is created for each separate request/response cycle through request/response shared memory; and, a “jFCA queue” is created for each request notification queue. Thus, whereas a standard Java socket will attach to a specific “port” (e.g., a specific TCP/IP address), according to an implementation, the jFCA API will establish a “jFCA queue” that is configured to implement the request notification queue of the applicable worker node and a “jFCA connection” for each request/response cycle.
Here, an instance of the jFCA API includes the instance of one or more objects to: 1) establish a “jFCA queue” to handle the receipt of request notifications from the worker node's request notification queue; 2) for each request notification, establishing a “jFCA connection” over request/response shared memory with the connection manager so that the corresponding request from the request/response shared memory can be received (through the jFCA's “InputStream”); and, 3) for each received request, the writing of a response back to the same request/response shared memory connection established for the request (through the jFCA's “OutputStream”).
In the outbound direction (i.e., from the worker node to the connection manager), in an embodiment, the same jFCA connection that is established through the request/response shared memory between the worker node and the connection manager for retrieving the request data is used to transport the response back to the connection manager.
In a further embodiment, a service (e.g., an HTTP service) is executed at each worker node that is responsible for managing the flow of requests/responses and the application(s) invoked by the requests sent to the worker node. In a further embodiment, in order to improve session handling capability, the service is provided its own “dedicated thread pool” that is separate from the thread pool that is shared by the worker node's other applications. By so-doing, a fixed percentage of the worker node's processing resources are allocated to the service regardless of the service's actual work load. This permits the service to immediately respond to incoming requests during moments of light actual service work load and guarantees a specific amount of performance under heavy actual service workload.
According to one implementation, each thread in the dedicated thread pool is capable of handling any request for any session. An “available” thread from the dedicated thread pool listens for a request notifications arriving over the jFCA queue. The thread services the request from the jFCA queue and establishes the corresponding jFCA connection with the handler associated with the request notification and reads the request from request/response shared memory. The thread then further handles the request by interacting with the session information associated with the request's corresponding session.
Each worker node may have its own associated container(s) in which the service runs. A container is used to confine/define the operating environment for the application thread(s) that are executed within the container. In the context of J2EE, containers also provide a family of services that applications executed within the container may use (e.g., (e.g., Java Naming and Directory Interface (JNDI), Java Database Connectivity (JDBC), Java Messaging Service (JMS) among others).
Different types of containers may exist. For example, a first type of container may contain instances of pages and servlets for executing a web based “presentation” for one or more applications. A second type of container may contain granules of functionality (generically referred to as “components” and, in the context of Java, referred to as “beans”) that reference one another in sequence so that, when executed according to the sequence, a more comprehensive overall “business logic” application is realized (e.g., stringing revenue calculation, expense calculation and tax calculation components together to implement a profit calculation application).
Recall from the Background in the discussion pertaining to
According to the depiction of
In order to concurrently execute a comparable number of application threads as the prior art worker nodes 109 of
Thus, for example, if the prior art worker nodes 109 of
Here, the prior art worker nodes 109 instantiate one virtual machine per CPU while the improved worker nodes 809 of
Recall from the discussion of
Thus, whereas the prior art worker nodes 109 of
According to an object oriented approach where each of virtual machines 123, 223, . . . M23 does not have visibility into the local memories of the other virtual machines, specific rules are applied that mandate whether or not information is permitted to be stored in shared memory 860. Specifically, to first order, according to an embodiment, an object residing in shared memory 860 should not contain a reference to an object located in a virtual machine's local memory because an object with a reference to an unreachable object is generally deemed “non usable”.
That is, if an object in shared memory 860 were to have a reference into the local memory of a particular virtual machine, the object is essentially non usable to all other virtual machines; and, if shared memory 860 were to contain an object that was usable to only a single virtual machine, the purpose of the shared memory 860 would essentially be defeated.
In order to uphold the above rule, and in light of the fact that objects frequently contain references to other objects (e.g., to effect a large process by stringing together the processes of individual objects; and/or, to effect relational data structures), “shareable closures” are employed. A “closure” is a group of one or more objects where every reference stemming from an object in the group that references another object does not reference an object outside the group. That is, all the object-to-object references of the group can be viewed as closing upon and/or staying within the confines of the group itself. Note that a single object without any references stemming from can be viewed as meeting the definition of a closure.
If a closure with a non shareable object were to be stored in shared memory 860, the closure itself would not be shareable with other virtual machines, which, again, defeats the purpose of the shared memory 860. Thus, in an implementation, in order to keep only shareable objects in shared memory 860 and to prevent a reference from an object in shared memory 860 to an object in a local memory, only “shareable” (or “shared”) closures are stored in shared memory 860. A “shared closure” is a closure in which each of the closure's objects are “shareable”.
A shareable object is an object that can be used by other virtual machines that store and retrieve objects from the shared memory 860. As discussed above, in an embodiment, one aspect of a shareable object is that it does not possess a reference to another object that is located in a virtual machine's local memory. Other conditions that an object must meet in order to be deemed shareable may also be effected. For example, according to a particular Java embodiment, a shareable object must also posses the following characteristics: 1) it is an instance of a class that is serializable; 2) it is an instance of a class that does not execute any custom serializing or deserializing code; 3) it is an instance of a class whose base classes are all serializable; 4) it is an instance of a class whose member fields are all serializable; 5) it is an instance of a class that does not interfere with proper operation of a garbage collection algorithm; 6) it has no transient fields; and, 7) its finalize ( ) method is not overwritten.
Exceptions to the above criteria are possible if a copy operation used to copy a closure into shared memory 860 (or from shared memory 860 into a local memory) can be shown to be semantically equivalent to serialization and deserialization of the objects in the closure. Examples include instances of the Java 2 Plafform, Standard Edition 1.3 java.lang.String class and java.util.Hashtable class.
A container is used to confine/define the operating environment for the application thread(s) that are executed within the container. In the context of J2EE, containers also provide a family of services that applications executed within the container may use (e.g., (e.g., Java Naming and Directory Interface (JNDI), Java Database Connectivity (JDBC), Java Messaging Service (JMS) among others).
Different types of containers may exist. For example, a first type of container may contain instances of pages and servlets for executing a web based “presentation” for one or more applications. A second type of container may contain granules of functionality (generically referred to as “components” and, in the context of Java, referred to as “beans”) that reference one another in sequence so that, when executed according to the sequence, a more comprehensive overall “business logic” application is realized (e.g., stringing revenue calculation, expense calculation and tax calculation components together to implement a profit calculation application).
The architectures and methodologies discussed above may be implemented with various types of computing systems such as an application server that includes a Java 2 Enterprise Edition (“J2EE”) server that supports Enterprise Java Bean (“EJB”) components and EJB containers (at the business layer) and/or Servlets and Java Server Pages (“JSP”) (at the presentation layer). Of course, other embodiments may be implemented in the context of various different software platforms including, by way of example, Microsoft .NET, Windows/NT, Microsoft Transaction Server (MTS), the Advanced Business Application Programming (“ABAP”) platforms developed by SAP AG and comparable platforms.
Processes taught by the discussion above may be performed with program code such as machine-executable instructions which cause a machine (such as a “virtual machine”, a general-purpose processor disposed on a semiconductor chip or special-purpose processor disposed on a semiconductor chip) to perform certain functions. Alternatively, these functions may be performed by specific hardware components that contain hardwired logic for performing the functions, or by any combination of programmed computer components and custom hardware components.
An article of manufacture may be used to store program code. An article of manufacture that stores program code may be embodied as, but is not limited to, one or more memories (e.g., one or more flash memories, random access memories (static, dynamic or other)), optical disks, CD-ROMs, DVD ROMs, EPROMs, EEPROMs, magnetic or optical cards or other type of machine-readable media suitable for storing electronic instructions. Program code may also be downloaded from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of data signals embodied in a propagation medium (e.g., via a communication link (e.g., a network connection)).
It is believed that processes taught by the discussion above can be practiced within various software environments such as, for example, object-oriented and non-object-oriented programming environments, Java based environments (such as a Java 2 Enterprise Edition (J2EE) environment or environments defined by other releases of the Java standard), or other environments (e.g., a NET environment, a Windows/NT environment each provided by Microsoft Corporation).
In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.