Abstract: Methods and systems for optimizing a build order of component source modules comprises creating a dependency graph based on dependency information. Historical build information associated with previous build failures is then used to calculate relative failure factors for paths of the dependency graph; and the relative failure factors are used to determine an order of traversal of the dependency graph during a build process in which component binary modules are built from the component source modules.

Abstract: Methods and systems for optimizing a build order of component source modules comprises creating a dependency graph based on dependency information. Historical build information associated with previous build failures is then used to calculate relative failure factors for paths of the dependency graph; and the relative failure factors are used to determine an order of traversal of the dependency graph during a build process in which component binary modules are built from the component source modules.

Abstract: Methods and systems for optimizing a build order of component source modules comprises creating a dependency graph based on dependency information. Historical build information associated with previous build failures is then used to calculate relative failure factors for paths of the dependency graph; and the relative failure factors are used to determine an order of traversal of the dependency graph during a build process in which component binary modules are built from the component source modules.

Abstract: Methods and systems for optimizing a build order of component source modules comprises creating a dependency graph based on dependency information. Historical build information associated with previous build failures is then used to calculate relative failure factors for paths of the dependency graph; and the relative failure factors are used to determine an order of traversal of the dependency graph during a build process in which component binary modules are built from the component source modules.

Abstract: A method, system and computer program product for determining and describing available resources and capabilities to match jobs to endpoints may include applying a set of rules to resource information to at least one of create new resource and attribute information and update existing resource and attribute information. The method may also include applying at least one of the new resource and attribute information and the updated existing resource and attribute information to match jobs to endpoints.

Abstract: A clone managed session affinity system, method and apparatus. A clone-managed session affinity method includes receiving a request from a client. The request includes a reference to a selected clone with which the client has a session affinity relationship. The clone determines whether a session affinity cancellation condition has arisen. If the clone determines that a session affinity termination condition has arisen, the session affinity relationship is cancelled.

Abstract: Methods and systems for optimizing a build order of component source modules comprises creating a dependency graph based on dependency information. Historical build information associated with previous build failures is then used to calculate relative failure factors for paths of the dependency graph; and the relative failure factors are used to determine an order of traversal of the dependency graph during a build process in which component binary modules are built from the component source modules.

Abstract: A method and apparatus route hypertext protocol requests to one of a plurality of application servers, which share a database through a backend database management system. The application servers store session data in the database. Hence, if a subsequent request is routed to a different application server, the session data is available through the backend database management system. One or more web servers perform routing of requests to the application server. When a request is received that is accompanied by a session ID, routing is performed by utilizing a hash function on the session ID. The resulting hash value is mapped to an application server. A hash function on a session ID will always result in the same hash value; therefore, the request will always be routed to the same application server. However, if an application server is non-functional, a new hash based on the previous hash is computed until a functional application server is selected.

Abstract: Mapping information that describes the mapping of referenced projects to their container project is included in the container project, using a “module mapping” file. A module mapping file is a simple meta-data file, for use at development time only, which stores data that maps relative URIs to IDE project names. The module mapping file contains entries for the location of nested archives, relative to the virtual archive defined by the container project, mapped to the uniquely named referenced project within the IDE. The paths of the archive files are computed “on the fly” just before the application server is started, rather than being simply written into an extensions file, located within the container project, in a fixed form when the enterprise application is written/developed.

Abstract: A method and apparatus route hypertext protocol requests to one of a plurality of application servers, which share a database through a backend database management system. The application servers store session data in the database. Hence, if a subsequent request is routed to a different application server, the session data is available through the backend database management system. One or more web servers perform routing of requests to the application server. When a request is received that is accompanied by a session ID, routing is performed by utilizing a hash function on the session ID. The resulting hash value is mapped to an application server. A hash function on a session ID will always result in the same hash value; therefore, the request will always be routed to the same application server. However, if an application server is non-functional, a new hash based on the previous hash is computed until a functional application server is selected.

Abstract: A method and apparatus route hypertext protocol requests to one of a plurality of application servers, which share a database through a backend database management system. The application servers store session data in the database. Hence, if a subsequent request is routed to a different application server, the session data is available through the backend database management system. One or more web servers perform routing of requests to the application server. When a request is received that is accompanied by a session ID, routing is performed by utilizing a hash function on the session ID. The resulting hash value is mapped to an application server. A hash function on a session ID will always result in the same hash value; therefore, the request will always be routed to the same application server. However, if an application server is non-functional, a new hash based on the previous hash is computed until a functional application server is selected.

Abstract: Methods, systems, computer program products, and methods of doing business whereby programmatically-generated byte code insertion is used to perform run-time tracing of code that potentially encounters a wait during execution. The byte code insertion is performed at load time, and inserts byte codes before and after a located (potential) wait point. The inserted byte code functions to gather execution statistics, such as a time stamp before invoking a located wait point and a time stamp after invoking the located wait point. Preferred embodiments allow this tracing to be selectively activated/deactivated.

Abstract: A custom class loader configured to dynamically locate and load classes in a virtual machine in accordance with an associated dependency specification. The custom class loader can include class loading logic configured to specifically and dynamically locate, define and load a class specified by name. The custom class loader also can include a list of peer class loaders arranged in a peer-to-peer fashion in accordance with the associated dependency specification in the virtual machine. In this regard, list generation logic can be included which can generate the list when the specified class has been replaced. Finally, the custom class loader can include deference logic configured to defer the location, definition and loading of the specified class to the peer class loaders in the list.

Abstract: A method and apparatus for securing hypertext transfer protocol sessions authenticates a user's credentials before creating a session. The present invention then associates the session with the credentials. Subsequent requests are submitted with the session ID and the user credentials to be associated with the session. Therefore, an unauthorized user that has obtained a session ID cannot gain access to sensitive content associated with the session without possessing the valid credentials.

Abstract: Methods, systems, computer program products, and methods of doing business whereby programmatically-generated byte code insertion is used to perform run-time tracing of code that potentially encounters a wait during execution. The byte code insertion is performed at load time, and inserts byte codes before and after a located (potential) wait point. The inserted byte code functions to gather execution statistics, such as a time stamp before invoking a located wait point and a time stamp after invoking the located wait point. Preferred embodiments allow this tracing to be selectively activated/deactivated.

Abstract: Mapping information that describes the mapping of referenced projects to their container project is included in the container project, using a “module mapping” file. A module mapping file is a simple meta-data file, for use at development time only, which stores data that maps relative URIs to IDE project names. The module mapping file contains entries for the location of nested archives, relative to the virtual archive defined by the container project, mapped to the uniquely named referenced project within the IDE. The paths of the archive files are computed “on the fly” just before the application server is started, rather than being simply written into an extensions file, located within the container project, in a fixed form when the enterprise application is written/developed.

Abstract: A clone managed session affinity system, method and apparatus. A clone-managed session affinity method can include receiving a request from a client. The request can include a reference to a selected clone with which the client has a session affinity relationship. The clone can determine whether a session affinity cancellation condition has arisen. If the clone determines that a session affinity termination condition has arisen, the session affinity relationship can be cancelled.

Abstract: This invention describes a system and method for monitoring the execution of hybrid source code such as JavaServer Pages (JSP) code. The system comprises a page compiler, which is called by a server for translating JSP code into a servlet for execution by the server. The page compiler during translation of the JSP code inserts instrumentation in the compiled JSP code for supporting execution tracing by an execution monitor. The execution monitor receives outputs from the page compiler, the servlet and the raw JSP code for displaying selected information about the execution of the JSP code to the developer on a graphical user interface. The execution monitor thus allows the developer to view the correlation between the JSP code, the servlet code and the HTML code that is generated by the servlet.

Abstract: A custom class loader configured to dynamically locate and load classes in a virtual machine in accordance with an associated dependency specification. The custom class loader can include class loading logic configured to specifically and dynamically locate, define and load a class specified by name. The custom class loader also can include a list of peer class loaders arranged in a peer-to-peer fashion in accordance with the associated dependency specification in the virtual machine. In this regard, list generation logic can be included which can generate the list when the specified class has been replaced. Finally, the custom class loader can include deference logic configured to defer the location, definition and loading of the specified class to the peer class loaders in the list.

Abstract: Methods, systems and computer program products are provided for managing shared data elements among a plurality of different client processes in a network environment. Shared data elements are associated with a Flow. A Flow is a logical stream of data that is only transmitted to a client process that explicitly subscribes for updates from the Flow. Update requests for the shared data elements are transmitted from client processes along the Flow so as to request the receipt of update notifications along the Flow. Update notifications are also transmitted about the shared data elements to the client processes along the Flow which have requested update notifications. Content of the shared data elements is, thereby, delivered to applications executing within said at least one client process which have requested updates of the shared data elements.