1,720,980 research outputs found
Programmable framework for automatic tuning of software applications
No full textA target application is automatically tuned. A list of solutions for identified performance bottlenecks in a target application is retrieved from a storage device. A plurality of modules is executed to compute specific parameters for solutions contained in the list of solutions. A list of modification commands associated with specific parameters computed by the plurality of modules is generated. The list of modification commands associated with the specific parameters is appended to a command sequence list. The list of modification commands is implemented in the target application. Specific source code regions corresponding to the identified performance bottlenecks in the target application are automatically tuned using the implemented list of modification commands. Then, the tuned target application is stored in the storage device
Automated detection of application performance bottlenecks
No full textDetecting performance bottlenecks in a target application is provided. In response to receiving hotspot selections from a user interface, bottleneck rules are extracted from a database. A hotspot is a region of source code that exceeds a time threshold to execute in the target application. Metrics needed to evaluate the bottleneck rules extracted from the database are identified. The identified metrics are computed. It is determined whether each bottleneck rule extracted from the database is evaluated to true using the computed metrics for hotspots in the target application. In response to determining that a bottleneck rule is evaluated to true using an appropriate computed metric corresponding to the bottleneck rule, a bottleneck description is created for the bottleneck rule. Then, the bottleneck description is sent to the user interface
A method for an extensible and programmable framework for automating performance analysis and tuning of software applications
No full textProfiling application performance according to data structure
No full textDuring runtime of a binary program file, streams of instructions are executed and memory references, generated by instrumentation applied to given ones of the instructions that refer to memory locations, are collected. A transformation is performed, based on the executed streams of instructions and the collected memory references, to obtain a table. The table lists memory events of interest for active data structures for each function in the program file. The transformation is performed to translate memory addresses for given ones of the instructions and given ones of the data structures into locations and variable names in a source file corresponding to the binary file. At least the memory events of interest are displayed, and the display is organized so as to correlate the memory events of interest with corresponding ones of the data structures
Binary programmable method for application performance data collection
No full textA method for application performance data collection includes steps or acts of: customizing a performance tool for collecting application performance data of an application; modifying the application by inserting the performance tool while the application does not need to be rebuilt from the source; executing the application; and collecting the application execution performance data such that only interesting data is collected. Customizing the performance tool proceeds by implementing at least one configurable tracing function that can be programmed by the user; compiling the function(s) into an object file; and inserting the object file into the performance tool using binary instrumentation
A study on the locality behavior of parallel and sequential algorithms for connectivity problems
No full text
Which interbank net is the safest?
No full textIn this paper, we aim at establishing some clear guidelines on which configuration of the interbank net can be most effective in limiting the banks' default contagion risk. More specifically, based on real banks' balance sheet data, we analyzed how the exposure concentration on specific counterparts can limit or enhance contagion, and which characteristics (variables) of the counterparts induce these differences. The analysis performed here is based on interbank exposures data, which only represent one of the contagion channels, but the same perspective can be generalized when considering, instead of the direct interbank exposures, the asymmetrical effects of a systemic crisis on the considered bank soundness (similar to what happens for the effect of interbank credit losses on a specific bank), or of the considered bank crisis to the whole system's soundness (similar to the case of interbank default of the considered bank). Moreover, the simulation model as it is can be applied to both listed and nonlisted banks, since it is based purely on balance sheet data. Results suggest that, if we consider the whole interbank market, a high concentration of exposures can enhance contagion, and that, with reference to specific bank-to-bank exposures, the case in which small banks lend to larger and riskier banks is the most threatening for the system's stability. These results can help regulators and supervisors keep the banking and financial system safe
- …
