Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
446 words
A method for processing data processing application requests in a computer system configured as a plurality of nodes, a node having memory for storing data and a plurality of interacting processes, comprising the steps of: establishing a portion of computer memory on the nodes as agent message queues ("AMQ's"); receiving an application request by a first process, wherein the application request includes a request that is not specific to the computer system node configuration, the first process acting as a coordinating agent; requesting the processing of data, including data on a plurality of nodes, ("request data") by an application request originating on a first node, the request data being located on a second node; generating a first internal request by the coordinating agent processing a low level request compiled from the application request, and adding an access authorization to the low level request, by the coordinating agent, for authorizing access to the request data and an access location for identifying the request data location, so that the internal request is specific to the computer system configuration; communicating, by the coordinating agent, the internal request to a first fast communication manager process ("FCM") and thence to a second FCM, the second FCM being on the second node, and storing, by the second FCM, the internal request in the selected AMQ, the selected AMQ being on the second node; retrieving the internal request from the selected AMQ by a second process, the second process acting as a subordinate agent; generating, by the coordinating agent, a second internal request for the application request, for processing by a second subordinate agent, the second subordinate agent being on a third node; communicating, by the first FCM, the second internal request to a third FCM, the third FCM being on the third node; storing, by the third FCM, the second internal request in a second AMQ, the second AMQ being on the third node; wherein a plurality of internal requests are stored in a plurality of AMQ's, the step of storing an internal request in an AMQ further comprising the steps of: identifying the internal request with a universal unique identifier ("UUID"); storing the UUID in the AMQ; designating the AMQ as a busy AMQ; designating AMQ's not having internal requests as free AMQ's; testing busy AMQ's on a node, by an FCM having an internal request for storage in an AMQ, to determine if an AMQ has the UUID of the internal request; selecting a busy AMQ for storing the internal request if the AMQ has the UUID of the internal request; and selecting a free AMQ for storing the internal request if none of the AMQ's tested have the UUID.
Claim 2
Independent Claim
446 words
A method for processing data processing application requests in a computer system configured as a plurality of nodes, a node having memory for storing data and a plurality of interacting processes, comprising the steps of: establishing a portion of computer memory on the nodes as agent message queues ("AMQ's"); receiving an application request by a first process, wherein the application request includes a request that is not specific to the computer system node configuration, the first process acting as a coordinating agent; requesting the processing of data, including data on a plurality of nodes, ("request data") by an application request originating on a first node, the request data being located on a second node; generating a first internal request by the coordinating agent processing a low level request compiled from the application request, and adding an access authorization to the low level request, by the coordinating agent, for authorizing access to the request data and an access location for identifying the request data location, so that the internal request is specific to the computer system configuration; communicating, by the coordinating agent, the internal request to a first fast communication manager process ("FCM") and thence to a second FCM, the second FCM being on the second node, and storing, by the second FCM, the internal request in the selected AMQ, the selected AMQ being on the second node; retrieving the internal request from the selected AMQ by a second process, the second process acting as a subordinate agent; generating, by the coordinating agent, a second internal request for the application request, for processing by a second subordinate agent, the second subordinate agent being on a third node; communicating, by the first FCM, the second internal request to a third FCM, the third FCM being on the third node; storing, by the third FCM, the second internal request in a second AMQ, the second AMQ being on the third node; wherein a plurality of internal requests are stored in a plurality of AMQ's, the step of storing an internal request in an AMQ further comprising the steps of: identifying the internal request with a universal unique identifier ("UUID"); storing the UUID in the AMQ; designating the AMQ as a busy AMQ; designating AMQ's not having internal requests as free AMQ's; testing busy AMQ's on a node, by an FCM having an internal request for storage in an AMQ, to determine if an AMQ has the UUID of the internal request; selecting a busy AMQ for storing the internal request if the AMQ has the UUID of the internal request; and selecting a free AMQ for storing the internal request if none of the AMQ's tested have the UUID.
Claim 3
Dependent Claim
92 words
The method of claim 1 further comprising: testing for an application state anchor block (ASAB) for recording information about the state of the application request by the subordinate agent that is processing the internal request; establishing, by the subordinate agent, an application state anchor block if an ASAB has not yet been established for the application request; storing, by the subordinate agent the address for the ASAB into the AMQ so that any agent subsequently servicing an internal request having the same UUID may determine the existence and address of the ASAB.
Claim 4
Independent Claim
329 words
A system for processing data processing application requests configured as a plurality of nodes, a node having memory for storing data and a plurality of interacting processes, comprising: a portion of computer memory on the nodes configured as agent message queues; a coordinating manager for receiving a first one of a plurality of application requests including a format that is not specific to node configuration, and for generating a first one of a plurality of internal requests derived from the application request; means for identifying each of the internal requests with a universal unique identifier; means for queuing the first internal request for storage in one of a plurality of selected agent message queues; means for designating the agent message queues as busy agent message queues; a subordinate agent for retrieving the first internal request from the selected agent message queue; a first fast communication manager for sending the first internal request for storage in the agent message queue; means for processing of requested data, including data located on a plurality of nodes, to fulfill the application request which originates on a first node, the requested data being located on a second node; an authorization facility for authorizing access to the requested data; means for providing an access location for identifying the requested data location, so that the first internal request is specific to the computer system configuration; a second fast communication manager on the second node for storing the internal request in the agent message queue being on the second node; and a third fast communication manager for sending the second internal request to a second agent message queue, the third fast communication manager being on the third node, wherein the coordinating manager generates a second internal request for the application request for processing by a second subordinate agent process, the second subordinate agent process being on a third node and wherein the first fast communication manager communicates the second internal request to a third fast communication manager.
Claim 5
Independent Claim
329 words
A system for processing data processing application requests configured as a plurality of nodes, a node having memory for storing data and a plurality of interacting processes, comprising: a portion of computer memory on the nodes configured as agent message queues; a coordinating manager for receiving a first one of a plurality of application requests including a format that is not specific to node configuration, and for generating a first one of a plurality of internal requests derived from the application request; means for identifying each of the internal requests with a universal unique identifier; means for queuing the first internal request for storage in one of a plurality of selected agent message queues; means for designating the agent message queues as busy agent message queues; a subordinate agent for retrieving the first internal request from the selected agent message queue; a first fast communication manager for sending the first internal request for storage in the agent message queue; means for processing of requested data, including data located on a plurality of nodes, to fulfill the application request which originates on a first node, the requested data being located on a second node; an authorization facility for authorizing access to the requested data; means for providing an access location for identifying the requested data location, so that the first internal request is specific to the computer system configuration; a second fast communication manager on the second node for storing the internal request in the agent message queue being on the second node; and a third fast communication manager for sending the second internal request to a second agent message queue, the third fast communication manager being on the third node, wherein the coordinating manager generates a second internal request for the application request for processing by a second subordinate agent process, the second subordinate agent process being on a third node and wherein the first fast communication manager communicates the second internal request to a third fast communication manager.
Claim 6
Dependent Claim
119 words
The system of claim 3 further comprising: means for designating agent message queues not having an internal request as free agent message queues; means for testing busy agent message queues on a node, by a fast communication manager having an internal request for storage in an agent message queue, to determine if an agent message queue has the universal unique identifier of the internal request; means for selecting a busy agent message queue for storing the internal request if the agent message queue has the universal unique identifier of the internal request; and means for selecting a free agent message queue for storing the internal request if none of the agent message queues tested have the universal unique identifier.
Claim 7
Dependent Claim
61 words
The system of claim 4 further comprising: means for testing for an application state anchor block for recording information about the state of the application request by the subordinate agent that is processing the internal request; and means for establishing an application state anchor block if an application state and anchor block has not yet been established for the application request.