Abstract: A method, system, computer program product and a computer program for prioritizing queued tasks waiting to access a resource associated with a resource manager in an application server, wherein an incoming task received at the application server from a calling application may have a status indicating that the incoming task is in a final phase during which a response to the calling application is created, the method comprising: receiving the incoming task; identifying the status of the incoming task; in response to identifying that the status of the incoming task is in the final phase, placing the incoming task in a priority queue; analyzing any queued tasks waiting to access the resource in the priority queue and one or more other queues; and processing a queued task from the priority queue in preference to the one or more other queues.

Abstract: A method and system are provided for capturing and applying changes to a data structure made by one or more processing nodes. The method includes providing a data structure including one or more elements (200-205), maintaining a linked record of changes (200a-200c, 201a-201c, 205a-205b) to each element (200-205) made by a processing node. A new value of an element (200-205) is linked to the previous value. A record (250) of the sequence of changes to the elements (200-205) is also maintained. In one embodiment, the linked record of changes (200a-200c, 201a-201c, 205a-205b) is a push down stack. The data structure is defined including indirections (210-215) pointing to most recent values of an element (200-205), which in turn points to the previous value of the element (200-205), forming a linked record to the initial value of the element.

Abstract: A system, method and computer program for managing resources within an integrated development environment for multiple users. The resources include both content resources and people resources. The method comprises: managing a plurality of nodes representing resources, the nodes including content nodes and person nodes, wherein the node contains a resource reference for referencing the resource; managing one or more links representing one or more relationships between the resources, the links including links between content nodes, between person nodes and between content and person nodes, each link comprising node references to identify the nodes in the relationships and an importance value to identify the importance of the relationship; providing an interface for selecting one of the plurality of content nodes or person nodes; adapting, in response to the user selected node, one or more importance values of certain links.

Abstract: A method is provided for managing resources within an integrated development environment for multiple users. The resources include both content resources and people resources. The method comprises managing a plurality of nodes representing resources. The nodes include content nodes and person nodes. The node contains a resource reference for referencing the resource. The method comprises managing one or more links representing one or more relationships between the resources. Each link comprises node references to identify the nodes in the relationships and an importance value to identify the importance of the relationship. The method further comprises providing an interface for selecting one of the plurality of content nodes or person nodes and estimating, in response to a selected nodes, a node having a likelihood of subsequent selection based on the importance value of its link to the selected nodes. The method comprises providing an interface for selecting said estimated node.

Abstract: A method and system are provided for capturing and applying changes to a data structure made by one or more processing nodes. The method includes providing a data structure including one or more elements (200-205), maintaining a linked record of changes (200a-200c, 201a-201c, 205a-205b) to each element (200-205) made by a processing node. A new value of an element (200-205) is linked to the previous value. A record (250) of the sequence of changes to the elements (200-205) is also maintained. In one embodiment, the linked record of changes (200a-200c, 201a-201c, 205a-205b) is a push down stack. The data structure is defined including indirections (210-215) pointing to most recent values of an element (200-205), which in turn points to the previous value of the element (200-205), forming a linked record to the initial value of the element.