Abstract: One embodiment relates to a method for identifying sources of memory retention in an executing application. A size of a set of objects is tracked over multiple periods. A period is determined to be a growth period if the size for the set of objects increases above a previous maximum size, and the number of growth periods is counted. The set of objects is flagged as having potential undesired object retention (a memory leak) if the number of growth periods is greater than a threshold number. Other embodiments are also disclosed.

Abstract: A computer-implemented method for implementing a deadlock avoidance mechanism to prevent a plurality of threads from deadlocking in a computer system wherein a first thread of the plurality of threads request for a first resource is provided. The computer-implemented method includes employing the deadlock avoidance mechanism to intercept the request. The computer-implemented method also includes examining a status of the first resource. The computer-implemented method further includes, if the first resource is owned, identifying an owner of the first resource, analyzing the owner of the first resource to determine if the owner of the first resource is requesting a second resource, and analyzing the second resource to determine if the second resource is owned by the first thread. The computer-implemented method yet also includes, if the first thread owns the second resource, preventing deadlocking by handling a potential deadlock situation.

Abstract: A system and computer implemented method for dynamic management of an application. The system includes an application transformer configured to work symbiotically with a computer executable application, to monitor and control both the application and the application transformer including resource allocation associated with both the application and the application transformer, wherein the application transformer is configured to dynamically control the application and the application transformer without requiring a central management system or central resource control utility.

Abstract: One embodiment relates to a method for identifying sources of memory retention in an executing application. A size of a set of objects is tracked over multiple periods. A period is determined to be a growth period if the size for the set of objects increases above a previous maximum size, and the number of growth periods is counted. The set of objects is flagged as having potential undesired object retention (a memory leak) if the number of growth periods is greater than a threshold number. Other embodiments are also disclosed.

Abstract: One embodiment disclosed relates to a method of automated alerts for resource retention problems. Data on the resource usage as a function of time is obtained, and an automated analysis of the resource usage data is performed to determine whether the data indicates a minimum level of retention of the resource that increases over time for a period of time longer than a threshold time period. An alert notification is provided if the analysis determines that said indication is inferred from the data. Other embodiments are also disclosed.

Abstract: A method for optimization of memory usage for a computer program. Memory usage data is received wherein the memory usage data comprises timing information. A graphical representation of the memory usage data is generated. At least one heap parameter is received. A memory usage simulation is performed based on the memory usage data and the heap parameter.

Abstract: A system and method for debugging a software application written in a platform-independent programming language, including non-application-code components invoked by the software application. The debugging tool and method can generate debugging metrics (e.g. debugging information and analysis) relating to both the software application and the non-application-code component invoked by the software application.

Abstract: A method for optimization of memory usage for a computer program. Memory usage data is received wherein the memory usage data comprises timing information. A graphical representation of the memory usage data is generated. At least one heap parameter is received. A memory usage simulation is performed based on the memory usage data and the heap parameter.

Abstract: A compiler-linker software system translates a source code file into a machine executable code file. The compiler converts source code files to corresponding object code files. The linker converts the object code files to machine executable code files and tables required for execution. For each procedure, the linker derives one or more tables and one of the tables is a line number table. The line number table identifies the offset of a block of machine executable codes in the procedure with their corresponding source code line number. The construction of the line number table at link-time, not at compile-time, enables all changes to the sequences of machine executable codes and addresses to be accommodated without requiring supplemental processing of the line number table.