New! View global litigation for patent families

US20130283281A1 - Deploying Trace Objectives using Cost Analyses - Google Patents

Deploying Trace Objectives using Cost Analyses Download PDF

Info

Publication number
US20130283281A1
US20130283281A1 US13765651 US201313765651A US2013283281A1 US 20130283281 A1 US20130283281 A1 US 20130283281A1 US 13765651 US13765651 US 13765651 US 201313765651 A US201313765651 A US 201313765651A US 2013283281 A1 US2013283281 A1 US 2013283281A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
tracer
objectives
block
data
objective
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US13765651
Inventor
Russell S. Krajec
Ying Li
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Technology Licensing LLC
Original Assignee
Concurix Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for programme control, e.g. control unit
    • G06F9/06Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/36Preventing errors by testing or debugging software
    • G06F11/362Software debugging
    • G06F11/3636Software debugging by tracing the execution of the program
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3409Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
    • G06F11/3433Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment for load management
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3466Performance evaluation by tracing or monitoring
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3447Performance evaluation by modeling
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3452Performance evaluation by statistical analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/865Monitoring of software
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/504Resource capping
    • Y02D10/22
    • Y02D10/34

Abstract

A tracing management system may use cost analyses and performance budgets to dispatch tracing objectives to instrumented systems that may collect trace data while running an application. The tracing management system may analyze individual tracing workloads for processing, storage, and network performance costs, and select workloads to deploy based on a resource budget that may be set for a particular device. In some cases, complementary tracing objectives may be selected that maximize consumption of resources within an allocated budget. The budgets may allocate certain resources for tracing, which may be a mechanism to limit any adverse effects from tracing when running an application.

Description

    BACKGROUND
  • [0001]
    Tracing gathers information about how an application executes within a computer system. Tracing data may include any type of data that may explain how the application operates, and such data may be analyzed by a developer during debugging or optimization of the application. Tracing data may also be used by an administrator during production operation of the application to identify various problems.
  • [0002]
    Tracing that occurs during development and debugging can be very detailed. In some cases, the tracing operations may adversely affect system performance, as the tracing operations may consume large amounts of processing, storage, or network bandwidth.
  • SUMMARY
  • [0003]
    A tracing system may divide trace objectives across multiple instances of an application, then deploy the objectives to be traced. The results of the various objectives may be aggregated into a detailed tracing representation of the application. The trace objectives may define specific functions, processes, memory objects, events, input parameters, or other subsets of tracing data that may be collected. The objectives may be deployed on separate instances of an application that may be running on different devices. In some cases, the objectives may be deployed at different time intervals. The trace objectives may be lightweight, relatively non-intrusive tracing workloads that, when results are aggregated, may provide a holistic view of an application's performance.
  • [0004]
    A tracing system may perform cost analysis to identify burdensome or costly trace objectives. For a burdensome objective, two or more objectives may be created that can be executed independently. The cost analysis may include processing, storage, and network performance factors, which may be budgeted to collect data without undue performance or financial drains on the application under test. A larger objective may be recursively analyzed to break the larger objective into smaller objectives which may be independently deployed.
  • [0005]
    A tracing management system may use cost analyses and performance budgets to dispatch tracing objectives to instrumented systems that may collect trace data while running an application. The tracing management system may analyze individual tracing workloads for processing, storage, and network performance costs, and select workloads to deploy based on a resource budget that may be set for a particular device. In some cases, complementary tracing objectives may be selected that maximize consumption of resources within an allocated budget. The budgets may allocate certain resources for tracing, which may be a mechanism to limit any adverse effects from tracing when running an application.
  • [0006]
    A tracing system may optimize collected data by identifying periodicities within the collected data, then updating sampling rates and data collection windows. The updated parameters may be used to re-sample the data and perform more detailed analysis. The optimization may be based on a preliminary trace analysis from which a set of frequencies may be extracted as used for a default set of parameters. The tracing system may use multiple independent trace objectives that may be deployed to gather data, and each trace objective may be optimized using periodicity analysis to collect statistically significant data.
  • [0007]
    Periodicity similarity between two different tracer objectives may be used to identify additional input parameters to sample. The tracer objectives may be individual portions of a large tracer operation, and each of the tracer objectives may have separate set of input objects for which data may be collected. After collecting data for a tracer objective, other tracer objectives with similar periodicities may be identified. The input objects from the other tracer objectives may be added to a tracer objective and the tracer objective may be executed to determine a statistical significance of the newly added objective. An iterative process may traverse multiple input objects until exhausting possible input objects and a statistically significant set of input objects are identified.
  • [0008]
    Tracer objectives in a distributed tracing system may be compared to identify input parameters that may have a high statistical relevancy. An iterative process may traverse multiple input objects by comparing results of multiple tracer objectives and scoring possible input objects as being possibly statistically relevant. With each iteration, statistically irrelevant input objects may be discarded from a tracer objective and other potentially relevant objects may be added. The iterative process may converge on a set of statistically relevant input objects for a given measured value without a priori knowledge of an application being traced.
  • [0009]
    A distributed tracing system may use independent tracer objectives for which a profile model may be created. The profile model may be deployed as a monitoring agent on non-instrumented devices to evaluate the profile models. As the profile models operate with statistically significant results, the sampling frequencies may be adjusted. The profile models may be deployed as a verification mechanism for testing models created in a more highly instrumented environment, and may gather performance related results that may not have been as accurate using the instrumented environment. In some cases, the profile models may be distributed over large numbers of devices to verify models based on data collected from a single or small number of instrumented devices.
  • [0010]
    This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0011]
    In the drawings,
  • [0012]
    FIG. 1 is a diagram illustration of an embodiment showing a system for tracing an application.
  • [0013]
    FIG. 2 is a diagram illustration of an embodiment showing a device that may create trace objectives, deploy the objectives, and analyze results.
  • [0014]
    FIG. 3 is a flowchart illustration of an embodiment showing a method for creating and deploying objectives.
  • [0015]
    FIG. 4 is a flowchart illustration of an embodiment showing a method for determining a default sampling rate and data collection window.
  • [0016]
    FIG. 5 is a diagram illustration of an embodiment showing tracing with tracer objectives.
  • [0017]
    FIG. 6 is a flowchart illustration of an embodiment showing a method for creating and deploying trace objectives.
  • [0018]
    FIG. 7 is a flowchart illustration of an embodiment showing a method for sizing tracer objectives using cost analysis.
  • [0019]
    FIG. 8 is a flowchart illustration of an embodiment showing a method for dividing tracer objectives using cost analysis.
  • [0020]
    FIG. 9 is a diagram illustration of an embodiment showing a process for fine tuning sampling rates and data collection windows.
  • [0021]
    FIG. 10 is a flowchart illustration of an embodiment showing a method with a feedback loop for evaluating tracer results.
  • [0022]
    FIG. 11 is a flowchart illustration of an embodiment showing a method for iterating on objectives using frequency similarity.
  • [0023]
    FIG. 12 is a diagram illustration of an embodiment showing a method for validating predictive models.
  • [0024]
    FIG. 13 is a flowchart illustration of an embodiment showing a method for analyzing results from tracer objectives.
  • [0025]
    FIG. 14 is a diagram illustration of an embodiment showing an environment with a tracing objective dispatcher.
  • [0026]
    FIG. 15 is a flowchart illustration of an embodiment showing a method for deploying tracer objectives.
  • [0027]
    FIG. 16 is a flowchart illustration of an embodiment showing a detailed method for tracer objective characterization and deployment.
  • DETAILED DESCRIPTION
  • [0028]
    Application Tracing with Distributed Objectives
  • [0029]
    A system for tracing an application may gather trace data from discrete, independent objectives that may be executed against multiple instances of the application. The system may divide the tracing workload into individual objectives, then dispatch those objectives to collect subsets of data. The trace data may be aggregated into a complete dataset.
  • [0030]
    In tracing a large application, the application may be considered to be a large system that responds to stimuli, which are the input events, data, or other stimuli. When a theoretical assumption may be made that the application behaves in a relatively consistent manner, the tracing may be broken into many smaller units and the results aggregated together to give a detailed picture of the entire application. The smaller units may be known as ‘trace objectives’ that may be dispatched to gather some portion of the larger set of trace data.
  • [0031]
    The trace objectives may be a set of definitions for how to collect trace data and conditions for collecting trace data. The trace objectives may be consumed by a tracer operating within an instrumented environment, which may be configured to collect many different types of trace data and many different data objects. The objectives may also include connection definitions that establish a network connection to a data gathering and storage system. In many cases, the trace objectives may be described in a configuration file that may be transmitted to a tracer.
  • [0032]
    In many cases, detailed tracing may consume a large amount of computing, storage, and network bandwidth resources. For example, many tracing algorithms may increase the computation workload of a device by a factor of three or more. When such a load may be placed on a system, the performance of the application may be extremely degraded. By creating many smaller objectives that each cause a small amount of tracing to be performed, the detailed tracing results may still be achievable, but with a lower impact to the running application.
  • [0033]
    A distributed tracing system may have a smaller footprint than a more detailed tracing system, as the tracing workload may be distributed to multiple instances of the application or as individual workloads that may be executed sequentially on one device. In many cases, the tracing may be performed using a very large number of devices, where each device performs a relatively small subset of the larger tracing task. In such cases, a full view of the application functions may be obtained with minimal impact on each of the many devices.
  • [0034]
    The tracing system may automatically determine how to perform tracing in an optimized manner. An initial analysis of an application may uncover various functions, memory objects, events, or other objects that may serve as the foundation for a trace objective. The automated analysis may identify related memory objects, functions, and various items for which data may be collected, all of which may be added to a trace objective.
  • [0035]
    Once the trace objectives have been prepared, the trace objectives may be dispatched to be fulfilled by various instrumented execution environments. The trace results may be transmitted to a centralized collector, which may store the raw data. For each objective, a post collection analysis may evaluate the results to determine if the data are sufficient to generate a meaningful summary statistic, which may be a profile model for how an application's various components respond to input.
  • [0036]
    When the results of an objective cannot be verified with statistical certainty, the objective may be refactored and re-executed against the application. In some cases, the objective may be run for a longer time window to collect more data, while in other cases the objective may have items added or removed prior to re-execution.
  • [0037]
    Cost Analysis for Selecting Trace Objectives
  • [0038]
    A trace objective may be automatically evaluated using a cost analysis to determine if the objective may be too large or too burdensome to execute. When the objective becomes too burdensome, the objective may be split into two or more smaller objectives, where the results may be combined.
  • [0039]
    The cost analysis may evaluate execution costs, such as processor consumption, network bandwidth consumption, storage consumption, power consumption, or other resource consumption. In many such cases, a cost limit may be placed on a trace objective to limit the amount of resources that may be allocated for tracing. In some embodiments, the cost may be quantifiable financial costs that may be attributed to consuming various resources.
  • [0040]
    Dividing a larger objective into multiple smaller objectives may use relationships within the various data objects to place related objects in the same smaller objective. For example, a larger objective may involve tracing multiple data items for an executable function. Some of the outputs of the function may be consumed by one downstream function while other outputs of the function may be consumed by a different downstream function. When such relationships are available and known, the system may place the outputs for the first function in one trace objective and the outputs for the second function in a second trace objective.
  • [0041]
    The costs for analyzing an objective's impact may be estimated or measured. In some cases, an objective may be selected from a library of data collection templates. Each template may have estimated costs for performing different aspects of the template, and the estimated costs may be used for evaluating a trace objective.
  • [0042]
    In some cases, the costs for an objective may be measured. In such cases, the objective may be executed for a short period of time while collecting cost data, such as impact on processors, storage, or network bandwidth. Once such costs are known, an analysis may be performed to determine whether or not to split the objective into multiple smaller objectives.
  • [0043]
    Throughout this specification and claims, the term “costs” in the context of evaluating trace objectives may be a general term that reflects any cost, expense, resource, tax, or other impediment created by a trace objective. In general, costs refer to anything that has an effect that may be minimized.
  • [0044]
    Deploying Trace Objectives Using Cost Analyses
  • [0045]
    Trace objectives may be deployed using cost estimate for the trace objectives and resource budgets on tracing devices. The budgets may define a resource allocation for trace objectives, and a dispatcher may select trace objectives that may utilize the allocated resources.
  • [0046]
    Multiple trace objectives may be dispatched to a device when the sum of the resources consumed by all of the trace objectives are less than the budgeted amount. The trace objectives may be dispatched using a manifest that may include all of the assigned trace objectives.
  • [0047]
    A trace resource budget may define a maximum amount of resources that may be allocated to tracing workloads on a particular device. The budget may vary between devices, based on the hardware and software configuration, as well as any predefined resource or performance allocations. In some cases, a particular device or instance of an application may be allocated to meet minimum performance standards, leaving remaining resources to be allocated to tracing operations.
  • [0048]
    The assignment of trace objectives by cost may allow a minimum application performance to be maintained even while tracing is being performed. The minimum application performance may ensure that application throughput may be maintained when tracing is deployed in a production environment, as well as ensure that tracing does not adversely affect any data collected during tracing.
  • [0049]
    Periodicity Optimization in an Automated Tracing System
  • [0050]
    An automated tracing system may analyze periodicities in collected data, then adjust sampling rates and data collection windows to collect data that effectively captures the observed periodicities. An initial, high level trace may gather general performance parameters for an arbitrary application under test.
  • [0051]
    From the initial tracing, periodicity analysis may be performed to identify characteristic frequencies of the data. The characteristic frequencies of the initial data may be used to set a default sampling rate and data collection window for detailed tracer objectives that may be deployed.
  • [0052]
    As results may be captured from the tracer objectives, a second periodicity analysis may identify additional repeating patterns in the data. From the second periodicity analysis, the sampling rate and data collection window may be updated or optimized to collect statistically meaningful data.
  • [0053]
    In some embodiments, a tracer objective may be deployed with different parameters to explore repeating patterns at higher or lower frequencies than the default settings. Such an embodiment may test for statistically relevant frequencies, then collect additional data when statistically relevant frequencies are found. As an arbitrary application is traced, the list of dominant frequencies within the application may be applied to other tracer objectives.
  • [0054]
    The sampling rate of a tracer objective may define the smallest period or highest frequency that may be observed in a time series of data. Similarly, the data collection window may define the largest period or lowest frequency that may be observed. By ensuring that known frequencies are covered in a results set, a statistically meaningful determination may be made whether or not such frequencies appear in a set of observed data.
  • [0055]
    Optimization Analysis Using Similar Frequencies
  • [0056]
    An automatic optimization system may create statistically meaningful representations of an application performance by iterating on the input parameters that may affect a traced performance metric. After selecting a starting set of potential input parameters that may affect a measured or traced metric, statistically insignificant input parameters may be removed and potentially relevant parameters may be added to a tracer objective.
  • [0057]
    The observed metric may be analyzed for periodicity, the result of which may be a set of frequencies found in the data. The set of frequencies may be used as a signature, which may be matched with frequency signatures of other tracer objectives. The matching tracer objectives may be analyzed to identify statistically significant input parameters in the other tracer objectives, and those input parameters may be considered as potential input parameters.
  • [0058]
    The frequency analysis may attempt to match tracer objectives that have similar observed characteristics in the time domain by matching similar frequency signatures. Two tracer objectives that may have similar frequency signatures may react similarly to stimuli or have other behavioral similarities. In many cases, the input parameters that may affect the behavior observed with one tracer objective may be somehow related to input parameters that may affect the behavior observed with another tracer objective.
  • [0059]
    In some cases, the frequency comparisons may examine a dominant frequency found within the data. Such cases may be occur when analysis of the various tracer objective results yields several different dominant frequencies. In other cases, a single dominant frequency may be observed in a large number of results sets. In such cases, the comparisons may be made using a secondary frequency which may be a characteristic frequency after the dominant frequency may be removed.
  • [0060]
    In embodiments where multiple frequencies may be observed from the data, a frequency signature may be created that reflects the frequencies and the strength or importance of each frequency. The signatures may be compared using a similarity comparison to identify matches. In some embodiments, the comparisons may be performed using a score that may indicate a degree of similarity.
  • [0061]
    Deployment of Profile Models with a Monitoring Agent
  • [0062]
    Some tracing systems may create profile models that may represent tracing data. The models may then be deployed to monitors that may test the profile models against additional data. When the profile models successfully track additional data, the monitoring may be halted or reduced to a lower frequency. When the profile models may not successfully track additional data, the trace objectives used to create the original data may be refactored and redeployed so that new or updated models may be generated.
  • [0063]
    The monitoring system may operate with less cost than with a tracer. In many cases, a tracer may consume overhead processes, storage, and network traffic that may adversely affect application performance and may adversely affect financial costs of executing an application. A monitoring system may have much less overhead than a tracer and may be configurable to gather just specific data items and test the data items using a profile model.
  • [0064]
    In some systems, an instrumented execution environment with a tracer system may be deployed on a subset of devices, while a monitoring system may be deployed on all or a larger subset of devices. By using the monitoring system for testing or verification of the profile models, the complex and costly data collection operations may be performed on a subset of devices while the less costly monitoring operations may be performed on a different subset of devices.
  • [0065]
    Throughout this specification and claims, the term “trace objective” or “tracer objective” is used to refer to a set of configuration settings, parameters, or other information that may be consumed by a tracer to collect data while an application executes. The trace objective may be embodied in any manner, such as a configuration file or other definition that may be transmitted to and consumed by a tracer. In some cases, the trace objective may include executable code that may be executed by the tracer in order to collect data. The tracer object may often contain a connection definition that may enable a network connection to a remote device that may collect data for storage and analysis.
  • [0066]
    Throughout this specification and claims, the terms “profiler”, “tracer”, and “instrumentation” are used interchangeably. These terms refer to any mechanism that may collect data when an application is executed. In a classic definition, “instrumentation” may refer to stubs, hooks, or other data collection mechanisms that may be inserted into executable code and thereby change the executable code, whereas “profiler” or “tracer” may classically refer to data collection mechanisms that may not change the executable code. The use of any of these terms and their derivatives may implicate or imply the other. For example, data collection using a “tracer” may be performed using non-contact data collection in the classic sense of a “tracer” as well as data collection using the classic definition of “instrumentation” where the executable code may be changed. Similarly, data collected through “instrumentation” may include data collection using non-contact data collection mechanisms.
  • [0067]
    Further, data collected through “profiling”, “tracing”, and “instrumentation” may include any type of data that may be collected, including performance related data such as processing times, throughput, performance counters, and the like. The collected data may include function names, parameters passed, memory object names and contents, messages passed, message contents, registry settings, register contents, error flags, interrupts, or any other parameter or other collectable data regarding an application being traced.
  • [0068]
    Throughout this specification and claims, the term “execution environment” may be used to refer to any type of supporting software used to execute an application. An example of an execution environment is an operating system. In some illustrations, an “execution environment” may be shown separately from an operating system. This may be to illustrate a virtual machine, such as a process virtual machine, that provides various support functions for an application. In other embodiments, a virtual machine may be a system virtual machine that may include its own internal operating system and may simulate an entire computer system. Throughout this specification and claims, the term “execution environment” includes operating systems and other systems that may or may not have readily identifiable “virtual machines” or other supporting software.
  • [0069]
    Throughout this specification, like reference numbers signify the same elements throughout the description of the figures.
  • [0070]
    When elements are referred to as being “connected” or “coupled,” the elements can be directly connected or coupled together or one or more intervening elements may also be present. In contrast, when elements are referred to as being “directly connected” or “directly coupled,” there are no intervening elements present.
  • [0071]
    The subject matter may be embodied as devices, systems, methods, and/or computer program products. Accordingly, some or all of the subject matter may be embodied in hardware and/or in software (including firmware, resident software, micro-code, state machines, gate arrays, etc.) Furthermore, the subject matter may take the form of a computer program product on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in connection with an instruction execution system. In the context of this document, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
  • [0072]
    The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media.
  • [0073]
    Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by an instruction execution system. Note that the computer-usable or computer-readable medium could be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, of otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
  • [0074]
    When the subject matter is embodied in the general context of computer-executable instructions, the embodiment may comprise program modules, executed by one or more systems, computers, or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments.
  • [0075]
    FIG. 1 is a diagram of an embodiment 100 showing a system for tracing an application. Embodiment 100 is a simplified example of a sequence for creating trace objectives, deploying the objectives, and analyzing the results.
  • [0076]
    Embodiment 100 illustrates an example of a tracing system that may be fully automated or at least largely automated to collect data about an application. The resulting data may be a characterization of the application, including profile models of the application as a whole or at least for some subsets of the application. The results may be used to analyze and debug the application, design monitoring metrics, or other uses.
  • [0077]
    Embodiment 100 illustrates a generalized operation that takes an application 102 and does some preliminary analysis 104 to create lists 106 of events, functions, memory objects, and other potentially interesting objects for tracing. From the lists 106, instrumentation or trace objectives 108 may be created and deployed 110 to various instrumented devices 112, 114, and 116.
  • [0078]
    Each of the instrumented devices 112, 114, and 116 may execute an instance of the application 118, 120, and 122, respectively, and the instrumentation may generate results in the form of input streams and tracer results 124. The results 124 may be analyzed 126, which may cause the instrumentation objectives 108 to be updated and redeployed, or an aggregated results set 128 may be generated.
  • [0079]
    The various instrumented devices may be any device capable of collecting data according to a trace objective. In some cases, the instrumented devices may have specialized or dedicated hardware or software components that may collect data. In other cases, an instrumented system may be a generic system that may be configured to collect data as defined in a tracer objective.
  • [0080]
    Embodiment 100 illustrates a system that may be automated to generate tracing data for an application by splitting the tracing workload into many small trace objectives. The smaller trace objectives may be deployed such that the trace objectives may not adversely interfere with the execution of the application.
  • [0081]
    Smaller trace objectives may allow much more detailed and fine grained data collection than may be possible with a complete tracer that may capture all data at once. In many cases, capturing a very detailed set of data may consume large amounts of processor, storage, network bandwidth, or other resources.
  • [0082]
    When smaller trace objectives are used, the data collected from different trace objectives may not be from precisely the same set of input parameters to the application. As such, the results from the smaller trace objectives may undergo various analyses to determine whether or not the results may be repeatable. When the results are shown to be repeatable, the results may be aggregated from multiple trace objectives to create a superset of data.
  • [0083]
    Embodiment 100 illustrates an example where an application may be performed by several devices. In some cases, each device may execute an identical instance of the application. An example may be a website application that may be load balanced such that each device executes an identical copy. In other cases, each device may execute a subset of a larger application. An example may be a distributed application where each device performs a set of functions or operations that may cause data to pass to another device for further processing.
  • [0084]
    FIG. 2 is a diagram of an embodiment 200 showing a computer system with a system for automatically tracing an application using independent trace objectives. Embodiment 200 illustrates hardware components that may deliver the operations described in embodiment 100, as well as other embodiments.
  • [0085]
    The diagram of FIG. 2 illustrates functional components of a system. In some cases, the component may be a hardware component, a software component, or a combination of hardware and software. Some of the components may be application level software, while other components may be execution environment level components. In some cases, the connection of one component to another may be a close connection where two or more components are operating on a single hardware platform. In other cases, the connections may be made over network connections spanning long distances. Each embodiment may use different hardware, software, and interconnection architectures to achieve the functions described.
  • [0086]
    Embodiment 200 illustrates a device 202 that may have a hardware platform 204 and various software components. The device 202 as illustrated represents a conventional computing device, although other embodiments may have different configurations, architectures, or components.
  • [0087]
    In many embodiments, the optimization server 202 may be a server computer. In some embodiments, the optimization server 202 may still also be a desktop computer, laptop computer, netbook computer, tablet or slate computer, wireless handset, cellular telephone, game console or any other type of computing device.
  • [0088]
    The hardware platform 204 may include a processor 208, random access memory 210, and nonvolatile storage 212. The hardware platform 204 may also include a user interface 214 and network interface 216.
  • [0089]
    The random access memory 210 may be storage that contains data objects and executable code that can be quickly accessed by the processors 208. In many embodiments, the random access memory 210 may have a high-speed bus connecting the memory 210 to the processors 208.
  • [0090]
    The nonvolatile storage 212 may be storage that persists after the device 202 is shut down. The nonvolatile storage 212 may be any type of storage device, including hard disk, solid state memory devices, magnetic tape, optical storage, or other type of storage. The nonvolatile storage 212 may be read only or read/write capable. In some embodiments, the nonvolatile storage 212 may be cloud based, network storage, or other storage that may be accessed over a network connection.
  • [0091]
    The user interface 214 may be any type of hardware capable of displaying output and receiving input from a user. In many cases, the output display may be a graphical display monitor, although output devices may include lights and other visual output, audio output, kinetic actuator output, as well as other output devices. Conventional input devices may include keyboards and pointing devices such as a mouse, stylus, trackball, or other pointing device. Other input devices may include various sensors, including biometric input devices, audio and video input devices, and other sensors.
  • [0092]
    The network interface 216 may be any type of connection to another computer. In many embodiments, the network interface 216 may be a wired Ethernet connection. Other embodiments may include wired or wireless connections over various communication protocols.
  • [0093]
    The software components 206 may include an operating system 218 on which various software components and services may operate. An operating system may provide an abstraction layer between executing routines and the hardware components 204, and may include various routines and functions that communicate directly with various hardware components.
  • [0094]
    Embodiment 200 illustrates many software components 206 as deployed on a single device 202. In other embodiments, some or all of the various software components 206 may be deployed on separate devices or even on clusters of devices.
  • [0095]
    Device 202 illustrates many of the software components that may manage the tracing of an application 220.
  • [0096]
    A preliminary analysis of the application 220 may be performed using a static code analyzer 222 or a high level tracer 224. In some embodiments, both a static code analyzer 222 and a high level tracer 224 may be used.
  • [0097]
    The static code analyzer 222 may examine source code, intermediate code, binary code, or other representation of the application 220 to identify various elements that may be traced or for which data may be collected. For example, a static code analyzer 222 may identify various functions, subroutines, program branches, library routines, or other portions of the executable code of the application 220, each of which may be an element for which data may be gathered. Additionally, a static code analyzer 222 may identify memory objects, parameters, input objects, output objects, or other memory elements or data objects that may be sampled or retrieved.
  • [0098]
    The high level tracer 224 may be a lightweight tracing system that may monitor an executing application 220 and identify sections of code that are executed, memory objects that are manipulated, interrupts that may be triggered, errors, inputs, outputs, or other elements, each of which may or may not have data elements that may be gathered during tracing.
  • [0099]
    The static code analyzer 222 or the high level tracer 224 may create a flow control graph or other representation of relationships between elements. The relationships may be traversed to identify related objects that may be useful when generating trace objectives 228.
  • [0100]
    The various elements may be analyzed by the trace objective generator 226 to create a trace objective 228. Once created, a dispatcher 230 may cause the trace objectives 228 to be executed by a tracer.
  • [0101]
    The trace objective generator 226 may generate independently executable trace objectives that generate data regarding the application 220 when the application 220 is executed. The independent trace objectives 228 may be constructed by identifying an element to be traced, which may be a function, memory object, interrupt, input object, output object, or other element.
  • [0102]
    Once a starting element may be identified, the trace objective generator 226 may attempt to find related items that may also be traced. For example, a function may be identified as a starting element. Related items may include input parameters passed to the function and results transmitted from the function. Further related items may be functions called by the starting function and the various parameters passed to those functions. Regarding each function, related items may include the processing time consumed by the function, heap memory allocated, memory objects created or changed by the function, and other parameters.
  • [0103]
    In some embodiments, a set of trace objective templates 227 may be available. A trace objective template 227 may be a starting framework for tracing a specific object. For example, a trace objective template 227 may be created for tracing a specific type of function, where the template may include parameters that may typically be measured for a specific type of function. Other examples may include templates for tracing different types of memory objects, interrupts, input objects, output objects, error conditions, and the like.
  • [0104]
    The various templates may include cost estimating parameters, which may be used to assess or estimate the impact of a particular trace objective. The cost estimating parameters may include financial cost as well as performance costs, resource consumption costs, or other costs. The estimated costs may be a factor used by a trace objective generator 226 to determine whether a given trace objective may be too large, complex, or costly to execute and therefore may be split into multiple smaller trace objectives.
  • [0105]
    When a high level tracer 224 may be used, periodicity data may be extracted from the data collected. Periodicity data may include any repeating pattern or frequency of data that repeats. Periodicity data may be used by the trace objective generator 226 to select a data collection window that may be sized to capture periodic data. When a data collection window is smaller than a known repeating period, any profile model or other analysis may not fully capture the behavior of the data.
  • [0106]
    The trace objective generator 226 may create execution parameters for a trace objective. The execution parameters may include a data collection window. In some cases, a data collection window may be defined by a start time and end time. In other cases, a data collection window may be defined by a number of values collected, amount of data collected, or other conditions. In still other cases, starting and stopping conditions may include event monitoring. For example, a starting condition may begin tracing when a specific input event occurs or an ending condition may be defined when a memory object reaches a certain value.
  • [0107]
    The execution parameters may include data collection parameters, such as sampling frequency. In some cases, data collection parameters may also include definitions of when to collect data, which may be dependent on calculated, measured, or observed data. For example, data may be collected when a parameter X is equal to zero, when the processor load is less than 80%, or some other condition.
  • [0108]
    The trace objective generator 226 may transmit executable code to a tracer. The executable code may include condition definitions or other code that may be evaluated during execution. The executable code may also include instrumentation or other code that may collect specific types of data.
  • [0109]
    In some cases, the executable code may be inserted into an application to retrieve values, perform calculations, or other functions that may generate data. In some embodiments, executable code may be included in trace objective templates 227, and the executable code may be customized or modified by the trace objective generator 226 prior to inclusion in a trace objective.
  • [0110]
    The trace objective generator 226 may define input conditions for a given traced object. The input conditions may be data that are collected in addition to the objects targeted for monitoring. In some embodiments, the input conditions may be analyzed and evaluated to compare different runs of the same or related trace objectives. The input conditions may include any input parameter, object, event, or other condition that may affect the monitored object. In many embodiments, a profile model may be created that may represent the behavior of the monitored object, and the input conditions may be used as part of the profile model.
  • [0111]
    The trace objective generator 226 may create multiple trace objectives 228 which may be transmitted to various instrumented systems 246 by a dispatcher 230.
  • [0112]
    The dispatcher 230 may determine a schedule for executing trace objectives and cause the trace objectives to be executed. The schedule may include identifying which device may receive a specific trace objective, as well as when the trace objective may be executed. In some cases, the dispatcher 230 may cause certain trace objectives to be executed multiple times on multiple devices and, in some cases, in multiple conditions.
  • [0113]
    A data collector 234 may receive output from the trace objectives and store the results and input stream 236 in a database. An analyzer 232 may analyze the data to first determine whether the data may be repeatable, then to aggregate results from multiple trace objectives into an aggregated results set 238. In many embodiments, the analyzer 232 may create profile models that may represent the observed data. Such profile models may be used for various scenarios, such as identifying bottlenecks or mapping process flow in a development or debugging scenario, monitoring costs or performance in a runtime or administrative scenario, as well as other uses.
  • [0114]
    The instrumented systems 246 may be connected to the device 202 through a network 244. The network 244 may be the Internet, a local area network, or any other type of communications network.
  • [0115]
    The instrumented systems 246 may operate on a hardware platform 248 which may have an instrumented execution environment 252 on which an application 250 may execute. The instrumented execution environment 252 may be an operating system, system virtual machine, process virtual machine, or other software component that may execute the application 250 and provide a tracer 254 or other instrumentation that may collect data during execution.
  • [0116]
    The tracer 254 may receive trace objectives 256 from the dispatcher 230. The tracer 254 may evaluate and execute the trace objectives 256 to collect input data and tracer results, then transmit the input data and tracer results to the data collector 234.
  • [0117]
    In some embodiments, a single tracer 254 may have multiple trace objectives 256 that may be processed in parallel or at the same time. In some such embodiments, a dispatcher 230 may identify two or more trace objectives 256 that may not overlap each other. An example may include a first trace objective that gathers data during one type of operation and a second trace objective that gathers data during another type of operation, where the two operations may not occur at the same time. In such an example, neither trace objective would be executing while the other tracer object were executing.
  • [0118]
    In another example, some trace objectives 256 may be very lightweight in that the trace objective may not have much impact or cost on the instrumented systems 246. In such cases, the dispatcher 230 may send several such low cost or lightweight trace objectives 256 to the instrumented systems 246.
  • [0119]
    In some embodiments, the trace objective generator 226 may create trace objectives that may be sized to have minimal impact. Such trace objectives may be created by estimating the cost impact on an instrumented system 246. The cost impact may include processing, input/output bandwidth, storage, memory, or any other impact that a trace objective may cause.
  • [0120]
    The trace objective generator 226 may estimate the cost impact of a proposed trace objective, and then split the trace objective into smaller, independent trace objectives when the cost may be above a specific threshold. The smaller trace objectives may also be analyzed and split again if they may still exceed the threshold.
  • [0121]
    Such embodiments may include a cost analysis, performance impact, or other estimate with each trace objective. In such embodiments, a dispatcher 230 may attempt to match trace objectives with differing cost constraints. For example, a dispatcher 230 may be able to launch one trace objective with high processing costs with another trace objective with little processing costs but high storage costs. Both trace objectives together may not exceed a budgeted or maximum amount of resource consumption.
  • [0122]
    The analyzer 232 may create profile models of the tracer results and input stream 236. The profile models may be a mathematical or other expression that may predict an object's behavior based on a given set of inputs. Some embodiments may attempt to verify profile models by exercising the models with real input data over time to compare the model results with actual results.
  • [0123]
    Some such embodiments may use a monitoring system to evaluate profile models. A monitoring manager 240 may dispatch the models to various systems with monitoring 256. The systems with monitoring 256 may have a hardware platform 258 on which an execution environment 260 may run an application 262. A monitor 264 may receive configurations 266 which may include profile models to evaluate.
  • [0124]
    The monitor 264 may be a lightweight instrumentation system. In many cases, the systems with monitoring 256 may be production systems where the monitor 264 may be one component of a larger systems administration and management system. The monitor 264 may evaluate a profile model to generate an error statistic. The error statistic may represent the difference between a predicted value and an actual value. When the error statistic is high, the profile model may be reevaluated by creating a new or updated trace objective. When the error statistic is low, the profile model may be used to represent the observed data with a high degree of confidence.
  • [0125]
    The architecture of embodiment 200 illustrates two different types of systems that may execute an application. The systems with monitoring 256 may represent production systems on which an application may run, while the instrumented systems 246 may be specialized systems that may have additional data collection features. In some cases, the instrumented systems 246 may be the same or similar hardware as the systems with monitoring 256, and may be specially configured. In still other embodiments, the two types of systems may be identical in both hardware and software but may be used in different manners.
  • [0126]
    In some embodiments, the various components that may generate tracing objectives may also be deployed on the same device that may execute the traced application and collect the results. In some such embodiments, some components may be allocated to certain processors or other resources while other components may be allocated to different resources. For example, a processor or group of processors may be used for executing and tracing an application, while other processors may collect and analyze tracer results. In some cases, a tracer objective may execute on one processor and monitor the operations of an application executing on a different processor.
  • [0127]
    FIG. 3 is a flowchart illustration of an embodiment 300 showing a method for creating and deploying trace objectives. Embodiment 300 illustrates the operations of a device 202 as illustrated in embodiment 200.
  • [0128]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0129]
    Embodiment 300 illustrates a general method by which trace objectives may be created and deployed. Some of the components of embodiment 300 may be illustrated in more detail in other embodiments described later in this specification.
  • [0130]
    Embodiment 300 illustrates a method whereby static code analysis and an initial tracing operation may identify various objects for tracing. In some embodiments, the initial tracing operation may identify enough information from which tracing objectives may be created. In other embodiments, an initial tracing operation may identify objects for tracing, then a second initial tracing operation may be performed for each of the objects. The second initial tracing operation may collect detailed data that may be too cumbersome or impractical to gather for many objects in a single tracing operation.
  • [0131]
    An application may be received in block 302 for evaluation. In block 303, the application may undergo preliminary analysis. The preliminary analysis may gather various information that may be used to automatically create a set of tracer objectives. The tracer objectives may be iterated upon to converge on statistically relevant input parameters that may affect a monitored parameter. The preliminary analysis of block 303 may gather objects to monitor as well as operational limits that may be used to create tracing objectives.
  • [0132]
    The preliminary analysis may also include periodicity analysis that may be used to set sampling rates and data collection windows for objectives. The sampling rates and data collection windows may be adjusted over time as additional data are collected and analyzed.
  • [0133]
    Static code analysis may be performed in block 304 to identify potential tracing objects. Static code analysis may identify functions and other executable code elements, memory objects and other storage elements, and other items.
  • [0134]
    In some embodiments, static code analysis may also generate relationships between executable code elements and memory objects. An example of relationships may include flow control graphs that may show causal or communication relationships between code elements. In many cases, memory objects may be related to various code elements.
  • [0135]
    High level tracing may be performed in block 306. High level tracing may help identify objects for tracing as well as gather some high level performance or data characteristics that may be used later when generating trace objectives.
  • [0136]
    During execution with high level tracing, execution elements and execution boundaries may be identified in block 308. The execution elements may be functions, libraries, routines, blocks of code, or any other information relating to the executable code. Execution boundaries may refer to performance characteristics such as amount of time to execute the identified portions of the application, as well as the expected ranges of values for various memory objects. The execution boundaries may include function calls and returns, process spawn events, and other execution boundaries.
  • [0137]
    Causal relationships may be identified between components in block 308. Causal relationships may be cause and effect relationships where one object, function, condition, or other input may cause a function to operate, a memory object to change, or other effect. Causal relationships may be useful in identifying or gathering related objects together for instrumentation.
  • [0138]
    Input parameters may be identified in block 310. The input parameters may include any inputs to the application, including data passed to the application, input events, or other information that may cause behaviors in the application. In some embodiments, the various execution elements may be analyzed to identify input parameters that may be directed to specific execution elements.
  • [0139]
    The high level tracing may identify various memory objects that may change during execution in block 312. The memory objects may represent objects for which a trace objective may be created, which may be added to a list of possible objects for tracing in block 314.
  • [0140]
    While the high level tracing executes, any periodicities or repeating patterns may be identified in block 316. Many applications operate in a repeating fashion, and often have multiple periodicities. For example, a retail website application may have a seasonal periodicity where the workload increases near holidays, as well as a weekly periodicity where the workload predictably varies over the day of week. The same application may experience repeatable changes for the hour of the day as well.
  • [0141]
    When the periodicities of an application may be known, the data collection windows for a tracer object may be set to capture multiple cycles of a period. Data that captures multiple cycles may be used to generate profile models that include a factor that takes into account periodicity. When the data collection window does not collect enough data to capture the periodicity, a profile model may generate more errors, making the model less reliable and repeatable.
  • [0142]
    Several performance tests may be performed, including storage tests in block 318, network bandwidth in block 320, and available computational bandwidth in block 322. The performance tests may be performed under the same or similar conditions as the trace objectives may be run. For example, the performance tests of blocks 318, 320, and 322 may be executed on an instrumented system while the application is executing.
  • [0143]
    The performance tests may be used to set boundaries or thresholds for creating trace objectives that meet a maximum cost goal. In such embodiments, the performance tests may be analyzed to determine the remaining performance bandwidth while an application executes. For an application that may be compute bound, computational performance may be heavily used, but there may be excess storage and network bandwidth that may be consumed by trace objectives. In another example, an application may be network or input/output bound, leaving excess computation free for use by trace objectives.
  • [0144]
    In many cases, a budget or goal may be defined for the cost of tracing. For example, a goal may be set to use up to 10%, 20%, 50%, or some other value of system resources for tracing uses. When such a goal may be set, trace objectives may be created small enough and lightweight enough to meet the goal, and the trace objectives may be dispatched or scheduled to meet the goal.
  • [0145]
    The allocation of tracing resources may be useful when an application performs time sensitive operations, or when the tracing may be focused on performance monitoring or optimization. By allocating only a maximum amount of resources, the application may not be adversely affected by excessive tracing.
  • [0146]
    In block 324, trace objectives may be created. Examples of more detailed methods for creating trace objectives are provided later in this specification. Deployment objectives may be created in block 326 to generate a deployment schedule, and the objectives may be deployed in block 328.
  • [0147]
    As the objectives are deployed, results may be received and analyzed in block 330. The analysis may identify changes to be made to a trace objective, such as changes to the sampling rate or data collection window from periodicity analysis or changes to collecting certain input data streams. Such changes may cause the tracer objectives to be updated in block 332 and redeployed at block 326.
  • [0148]
    FIG. 4 is a flowchart illustration of an embodiment 400 showing a method for determining a default sampling rate and data collection window. Embodiment 400 illustrates some operations of a device 202 as illustrated in embodiment 200.
  • [0149]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0150]
    Embodiment 400 illustrates a method for determining an initial set of settings for sampling rate and a data collection window for tracer objectives. In general, a sampling rate for a time series may reflect the highest frequency that may be observed in a data stream. As a sampling rate becomes faster and the time slices of a data sample become shorter, the data may capture higher frequencies. As the sampling rate decreases, the higher frequencies may not be detectable in the data stream and may add to observed noise.
  • [0151]
    A data collection window may define the longest frequency that may be observed in a time series data set. In general, a statistically significant sample size may be at least two or three times the period of the longest period within the data. A data collection window that is smaller than the longest period within the data may result in a data set that contains observed noise.
  • [0152]
    The operations of embodiment 400 may be used to set an initial sampling rate and data collection window that may be applied as a default to tracer objectives. Once the tracer objectives have been deployed and their resulting data analyzed, changes may be made to the sampling rate and data collection window.
  • [0153]
    Initial trace results may be received in block 402. The initial trace results may come from a preliminary trace of an application. The preliminary trace may identify several parameters to measure and several input streams to capture. In many cases, the preliminary trace may be performed with little or no knowledge of the application.
  • [0154]
    An autocorrelation analysis may be performed in block 404 to identify dominant periodicities in the data. The periodicity analysis of block 404 may identify multiple frequencies that may be contained in the data. Some of the frequencies may have a stronger influence than other frequencies.
  • [0155]
    A long frequency may be identified in block 406 and may be used to determine a default data collection window. A data collection window may define a length of time that time series samples may be taken. In general, a data collection window may be selected to be two, three, or more times the length of the longest period or frequency.
  • [0156]
    A small periodicity may be identified in block 408 and used to determine a default sampling rate. The default sampling rate may be short enough that the smallest frequency may be captured by 5, 10, or more samples.
  • [0157]
    The default data collection window and sampling rate may be stored in block 410. The default data collection window and sampling rate may be used as a starting point for a tracer objective. In many cases, the data collection window and sampling rate may be adjusted after analyzing more detailed data.
  • [0158]
    In some embodiments, a default sampling rate and data collection window may be set to be related to each other. For example, a default sampling rate may be set using a dominant frequency of initial data, then a default data collection window may be set to be a predefined multiple of data samples. In one such example, a default data collection window may be set to be 10,000 times the length of a default sampling window, which may result in 10,000 sets of time series data for analysis.
  • [0159]
    In another example, a default data collection window may be determined by a relatively long dominant frequency, and a sampling rate may be determined to yield a predefined number of samples. In one such example, a default data collection window may be set to be an hour, and a sampling rate may be set to be 0.36 seconds to yield 10,000 samples per run.
  • [0160]
    FIG. 5 is a diagram illustration of an embodiment 500 showing a high level process for creating individual trace objectives then aggregating the collected data. The process of embodiment 500 creates independent trace objectives that may be deployed and optimized using several optimization analyses. Once the trace objectives have converged on statistically meaningful results, the results from multiple trace objectives may be aggregated.
  • [0161]
    A set of initial trace objectives may be analyzed, improved, and iterated to converge on statistically meaningful results. Embodiment 500 may represent an automated methodology for tracing an arbitrary application by using small, independent tracer objectives. The trace objectives may be divided, split, or otherwise made small enough to meet a tracer budget, then the trace objectives may be independently run and evaluated.
  • [0162]
    An overall objective to collect trace data may be defined in block 502. A cost analysis may be performed in block 504 to determine if the trace objective may be achieved. When the trace objective exceeds a set of cost goals, the objective may be divided in block 506 into smaller objectives, which may again be evaluated by the cost analysis in block 504. The iterative process of blocks 504 and 506 may result in multiple trace objectives that meet a cost goal.
  • [0163]
    The cost goals may be a mechanism to create tracer objectives that may be sized appropriately for a given application and a given scenario. By sizing a tracer objective so that the tracer objective does not exceed a cost goal, any negative influence of the tracer objective may be minimized during data collection.
  • [0164]
    Several different tracing scenarios may be supported. In one scenario, an application may be deployed on a large number of devices. One example may be a website that may be deployed on several servers in a datacenter, where all of the servers operate as a cluster to handle incoming web requests in parallel. In such an example, the performance of the servers may be more accurately measured when the tracer objectives are relatively small and consume few resources.
  • [0165]
    In another example, an application for a cellular telephone platform may be deployed on a large number of handheld devices. A tracing scenario may have each device perform a tracer objective that may consume only a limited amount of resources. The cost-based analysis of tracer objectives may ensure that the handheld devices may not be overwhelmed by the tracing workload.
  • [0166]
    The trace objectives may be evaluated for sampling rate and frequency analysis in block 507. The sampling rate and frequency analysis may examine data patterns to identify periodicities to identify which periodicities are dominant. The dominant periodicities may be used to adjust the sampling rate and data collection window to capture the periodicities accurately. In some cases, a hypothesis of an initial sampling rate and data collection window may be tested by changing the sampling rate and data collection window to search for other dominant frequencies in the data.
  • [0167]
    As the objectives are deployed in block 506 and data are collected, the data may be analyzed in several different manners. For each tracer objective, an input stream may be collected along with measured results. In block 510, the input stream may be culled to remove those input parameters or values that have statistically small or insignificant contributions to predicting the results. In block 512, other input parameters may be added to a tracer objective. The process may iterate between blocks 506, 510, and 512 until the input parameters that are statistically meaningful to predicting a measured result converge.
  • [0168]
    When examining a tracer objective to attempt to add input parameters in block 512, related objects may be examined. The related objects may be objects identified from static code analysis, such as from a control flow graph or other relationship. In some cases, trace results that have similar periodicities may be examined to evaluate different parameters in an input stream.
  • [0169]
    The result of the iteration of blocks 506, 510, and 512 may result in a mathematical model that may predict tracer results given a set of input parameters. Each tracer objective may generate a separate mathematical model.
  • [0170]
    The results may be analyzed for completeness in block 514. A completeness hypothesis may posit that the full range of input conditions may have been experienced by the tracer objectives. The hypothesis may be tested in block 514 by comparing the input streams experienced by different runs of the same trace objective, and in some embodiments, by comparing runs of different tracer objectives. When the hypothesis may not be validated, more data may be collected in block 516.
  • [0171]
    When the completeness hypothesis may be validated in block 518, a combinability hypothesis may be tested in block 520. The combinability hypothesis may posit that two models created from different tracer objectives may be combined into a larger model. The combinability hypothesis may be tested by joining two predictive models and testing the results of the combined model using previously collected data or by testing the results against real time data.
  • [0172]
    When the joined models do not yield a statistically meaningful result, a new tracer objective may be created in block 522 that combines the two tracer objectives. The resulting data collection and analysis may result in a different model than the combined model initially tested for the combinability hypothesis.
  • [0173]
    The combinability hypothesis may be tested for some or all of the tracer objectives. When the hypothesis may be verified in block 524, the collected data may be aggregated in block 526.
  • [0174]
    The aggregated data may be used in many different scenarios. In a debugging and testing scenario, the aggregated data may be used by a developer to understand program flow and to highlight any performance bottlenecks or other abnormalities that may be addressed. In an optimization scenario, the aggregated data may be used by an automated or semi-automated optimizer to apply different resources to certain portions of an application, for example.
  • [0175]
    FIG. 6 is a flowchart illustration of an embodiment 600 showing a method for creating and deploying trace objectives.
  • [0176]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0177]
    Embodiment 600 illustrates a method that creates tracer objectives by assigning various objects to tracer objectives. The tracer objectives may undergo a cost analysis that may cause the tracer objectives to be divided into smaller tracer objectives, then the tracer objectives may be dispatched.
  • [0178]
    Embodiment 600 illustrates a method that may be fully automated to begin an iterative method for tracing an application. The iterative method may create small, independent tracer objectives that may be deployed and iterated upon to converge on a set of statistically valid tracer models that may reflect how the application performs. The method may be performed on an arbitrary application and may automatically generate a meaningful understanding of an application without human intervention. In some embodiments, human intervention may be used at different stages to influence or guide the automated discovery and analysis of an application.
  • [0179]
    In block 602, a list of objects to trace may be received. The list of objects may be identified through static code analysis or other preliminary analysis. An example of such analysis may be found in block 303 of embodiment 300.
  • [0180]
    For each object in the list of objects in block 604, if the object is contained in another tracer objective in block 606, the object may be skipped in block 608. When the object is not in a pre-existing tracer objective in block 606, related objects may be identified in block 610.
  • [0181]
    Related objects may be any other objects to trace that may be suitable for inclusion in a single tracer objective. For example, an object to trace may be a memory object. The memory object may be set by a function, so the function may be added to the tracer objective. Other functions may read the memory object, so those functions may be added as well.
  • [0182]
    In the example, the function that may set the memory object may have a stronger relationship to the memory object than the functions that may read the memory object. Later in the process, objects with a weaker relationship may be removed from the tracer objective when the tracer objective may be too costly or burdensome to execute. Those objects that may be removed from a tracer objective may be added back to the list of objects.
  • [0183]
    For each related object in block 612, if the related object is already in a pre-existing tracer objective in block 614, the object may be removed in block 616.
  • [0184]
    The process of blocks 606 through 616 may be one method to gather related objects into tracer objectives, but not duplicate efforts by tracing the same object in multiple tracer objectives. The example of blocks 606 through 616 may assign objects to tracer objectives to maximize coverage with a minimum number of tracer objectives.
  • [0185]
    With each object to be traced, a set of performance parameters may be identified. In many cases, a template of tracer objectives may include measurable parameters that relate to a certain type of object. For example, a memory object may be traced by measuring the number of changes made, number of accesses, and other measurements. In another example, a function or other block of executable code may be traced by measuring speed of completion, error flags thrown, heap allocation and usage, garbage collection frequency, number of instructions completed per unit time, percentage of time in active processing, percentage of time in various waiting states, and other performance metrics. In yet another example, a message interface may be traced by measuring the number of messages passed, payload of the messages, processing time and communication bandwidth allocated to each message, and other parameters.
  • [0186]
    Other embodiments may create tracer objectives that have overlapping coverage, where a single object may be traced by two or more different tracer objectives. Such embodiments may be useful when more resources may be devoted to tracing.
  • [0187]
    After grouping the objects for a tracing objective in block 618, a set of default periodicity settings may be applied in block 620. A cost analysis may be performed in block 622. In some cases, two or more objectives may be created from a single tracer objective. An example of such a method may be found later in this specification.
  • [0188]
    The tracer objective may be prepared for initial dispatch in block 624. Such preparation may define a communications configuration that may define how a tracer may communicate with a data gatherer. The communication configuration may include an address for a data gatherer, as well as permissions, protocols, data schemas, or other information.
  • [0189]
    The tracer objectives may be dispatched in block 626 and results collected. The tracer objectives may be optimized in block 628 by removing statistically insignificant input parameters and searching for potentially significant input parameters.
  • [0190]
    After looping through blocks 626 and 628, the results may be aggregated in block 630.
  • [0191]
    FIG. 7 is a flowchart illustration of an embodiment 700 showing a method for performing cost analysis on tracer objectives. Embodiment 700 may illustrate one example of a process that may be performed in block 622 of embodiment 600.
  • [0192]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0193]
    Embodiment 700 illustrates a method by which a tracer objective may be evaluated for cost impact and divided into smaller tracer objectives. The cost impact may be the resource consumption of a tracer objective. In some embodiments, the cost may be translated into a financial cost, while in other embodiments the cost may be in terms of resources consumed by a tracer objective. Embodiment 700 is an example of the latter type of cost analysis.
  • [0194]
    Embodiment 700 uses three different cost computations: performance cost, storage cost, and network bandwidth cost. Such an embodiment is an example of a cost analysis that may have multiple, independent cost functions to satisfy. Other embodiments may have more or fewer cost functions to evaluate.
  • [0195]
    An objective may be received in block 702.
  • [0196]
    In some embodiments, a test run may be performed using the tracer objective in block 704. In such embodiments, the performance of a tracer may be measured to estimate the cost components. In other embodiments, a static code analysis may be performed of the tracer objective to determine the various cost components.
  • [0197]
    An estimate of the computational cost may be performed in block 706. An estimate of the storage cost may be performed in block 708, and an estimate of the network bandwidth cost may be performed in block 710. The overall cost of the tracer objective may be determined in block 712.
  • [0198]
    Computational cost or processor cost may reflect the amount of processor resources that may be incurred when executing a tracer objective. In many cases, a tracing operation may be substantially more complex than a simple operation of an application. For example, some tracers may incur 10 or more processor steps to analyze a single processor action in an application.
  • [0199]
    Storage costs may reflect the amount of nonvolatile or volatile memory that may be consumed by a tracer objective. In many cases, a tracer objective may collect a large amount of data that may be stored and processed. The storage costs for a tracer objective may be very large in some cases, which may limit performance.
  • [0200]
    Network bandwidth costs may be the resources consumed in transmitting collected data to a data repository. The network resources may include operations of a network interface card, network connection, and other network related resources. As larger amounts of data may be moved across a network connection, a network connection may become saturated and cause disruption to other communications.
  • [0201]
    When the cost is above a predefined threshold in block 714, the objective may be divided into two or more smaller tracer objectives in block 716. An example of such a process may be illustrated in another embodiment described later in this specification.
  • [0202]
    When the cost is below the predefined threshold in block 714, a data collection mechanism may be configured for the tracer objective in block 718 and the tracer objective may be sent to a dispatcher in block 720.
  • [0203]
    The data collection mechanism of block 718 may define how the data may be collected. In some embodiments, the data collection mechanism may include a destination device description that may collect data, as well as any communication parameters or settings.
  • [0204]
    FIG. 8 is a flowchart illustration of an embodiment 800 showing a method for dividing tracer objectives into smaller tracer objectives. Embodiment 800 may illustrate one example of a process that may be performed in block 716 of embodiment 700.
  • [0205]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0206]
    Embodiment 800 illustrates one method by which a tracer objective may be trimmed to meet a cost objective. Embodiment 800 illustrates merely one method by which a tracer objective may be made smaller using an automated process. In embodiment 800, objects may be sorted based on a strength of relationship, then objects with stronger relationships may be consolidated into a tracer objectives. Any remaining objects may be recycled into a new tracer objective.
  • [0207]
    A tracer objective may be received in block 802.
  • [0208]
    For each object in the tracer objective in block 804, a cost contribution of the object may be estimated in block 806. The cost contribution may be the cost of tracing that object.
  • [0209]
    Relationships of the object to other objects within the trace objective may be identified in block 808 and the relationships may be scored in block 810. The scoring may reflect a strength of a relationship.
  • [0210]
    A new objective may be started in block 812 with a starting object in block 814. Relationships between the object and other objects may be sorted by score in block 816. The sorting may result in the strongest relationships being analyzed first.
  • [0211]
    A relationship may be selected in block 818 and tentatively added to the tracer objective. The cost of the tracer objective may be estimated in block 820. The cost estimation in block 820 may utilize the cost contribution determined in block 806. If the cost is below a threshold in block 822, the process may return to block 818 to add another object to the tracer objective.
  • [0212]
    When the cost is above the threshold in block 822, the last object may be removed from the tracer objective. In such a situation, adding the last object may have made the trace objective go over the cost allocation, and therefore it may be removed.
  • [0213]
    When more objects are still available but have not been placed in a tracer objective in block 826, the process may return to block 812 to start a new tracer objective. When all objects have been processed in block 826, the tracer objectives may be deployed in block 828.
  • [0214]
    FIG. 9 is a diagram illustration of an embodiment 900 illustrating a process for tuning the sampling rate and data collection window for a tracer objective.
  • [0215]
    Embodiment 900 illustrates an example process where periodicity analysis may be used to refine a tracer objective's data collection. In some embodiments, each tracer objective may be executed using default sampling rates and data collection windows, then these parameters may be refined after looking at the actual data collected.
  • [0216]
    In block 902, a periodicity may be assumed for a tracer objective. The periodicity may be a default periodicity that may be derived from an initial analysis of an application. In many cases, the default periodicity may reflect periodic behavior of an application as a whole, whereas a tracer objective may generate data with a different set of periodic behavior. However, a first run of a tracer objective may be performed with the default periodicity as a starting point.
  • [0217]
    The first results of a tracer objective may be analyzed in block 904 by using autocorrelation in block 906, which may generate characteristic periodicities or frequencies in the data. From such analysis, dominant upper and lower frequencies may be identified in block 908.
  • [0218]
    A dominant upper frequency or shortest periodicity may be used to set a sampling rate. In many cases, a sampling rate may be set so that 5, 10, 20, or more samples may be taken within a single period of the dominant upper frequency.
  • [0219]
    Similarly, a dominant lower frequency or longest periodicity may be used to set a data collection window. In many cases, a data collection window may be set to capture at least 2, 3, 4, 5, or more instances of the longest periodicity.
  • [0220]
    After analyzing the initial run of a tracer objective, the tracer objective may be updated in block 910 and dispatched in block 912.
  • [0221]
    FIG. 10 is a flowchart illustration of an embodiment 1000 showing a method with a feedback look for evaluating tracer objective results. Embodiment 1000 may illustrate one example of a process that may be performed in blocks 626 and 628 of embodiment 600.
  • [0222]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0223]
    Embodiment 1000 illustrates an embodiment where the input parameters for a tracer objective may be evaluated and iterated upon to converge on a set of statistically meaningful input parameters. Embodiment 1000 may discard those input parameters that may have little statistical relationship to a measured parameter and may attempt to add new input parameters that may have a relationship to the measured object.
  • [0224]
    A results set may be received for a tracer objective in block 1002, and a profile model may be constructed of the results in block 1004. The profile model may be a mathematical expression of the relationship between the input stream and the measured results. The profile model may be created using linear or nonlinear regression, curve fitting, or any of many different techniques for expressing a set of observations. In many cases, the profile model may have correlation factors or other factors that may indicate the degree or importance of an input factor to the profile model.
  • [0225]
    The input parameters may be sorted by importance in block 1006. The first input parameter may be selected in block 1008. Other tracer objectives with the same input parameter may be identified in block 1010.
  • [0226]
    For each of the objectives identified in block 1010, the objectives may be analyzed in block 1012. The relevant input parameters may be identified in block 1014. The relevant input parameters may be any of the parameters for that tracer objective where there may be a minimum of statistical correlation to the measured parameter.
  • [0227]
    For each of the parameters in block 1016, if the parameter is in the current tracer objective, or was previously considered in the current tracer objective, the parameter may be skipped in block 1020.
  • [0228]
    If the parameter has not been examined in the current tracer objective in block 1018, the input parameter may be added to the input list in block 1022. A relevancy score may be calculated in block 1024 for the parameter.
  • [0229]
    The relevancy score may indicate the expected degree to which the parameter may be relevant to the current tracer objective. In some embodiments, the relevancy score may be a factor of the strength of relationship between the current tracer objective and the related tracer objective being examined, along with the relative importance of the input parameter to the related tracer objective.
  • [0230]
    After processing all of the parameters in block 1016 for each of the objectives in block 1012, if another relevant input parameter may be processed in block 1026, the process may return to block 1008 to add still more candidate input parameters.
  • [0231]
    In block 1028, non-relevant input parameters within the current tracer objective may be removed.
  • [0232]
    The list of potential input parameters may be sorted by score in block 1030. The list may include all of the parameters added in block 1022.
  • [0233]
    The top group of input parameters may be selected in block 1032. The top group may contain input parameters with a score above a given threshold. Provided that the group is not an empty set in block 1034, the group may be added to the tracer objective in block 1036 and dispatched for processing again in block 1038. The results of the trace objective may be used as input to block 1002.
  • [0234]
    When the set of available input parameters is an empty set in block 1034, the iteration may end in block 1040 as all of the potential input parameters may have been exhausted.
  • [0235]
    FIG. 11 is a flowchart illustration of an embodiment 1100 showing a method for iterating on tracer objectives using frequency similarities. Embodiment 1000 may illustrate another example of a process that may be performed in blocks 626 and 628 of embodiment 600.
  • [0236]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0237]
    Embodiment 1100 may be similar to embodiment 1000 in that a tracer objective may be updated with input parameters that may have a likelihood of being statistically significant. Embodiment 1100 may gather those input parameters from periodicity analysis of various tracer objectives. Those tracer objectives with similar frequency signatures or periodicities may be candidates for having statistically relevant input parameters.
  • [0238]
    In block 1102, results from many tracer objectives may be received. For each objective in block 1104, a periodicity analysis may be performed in block 1106 to identify frequencies or periods within the data. A frequency profile or signature may be created in block 1108.
  • [0239]
    The frequency profile may include multiple frequencies and the intensity or strength of the various frequencies. The frequency profile may be used as a signature to represent the behavior of the data collected by the tracer objectives.
  • [0240]
    A tracer objective may be selected in block 1112 as a starting objective. In embodiment 1100, each tracer objective may be evaluated to attempt to find additional input parameters that may be related to a given traced object or observed data point. The process may iterate to add potential new input parameters, test the new parameters, and iterate.
  • [0241]
    In many embodiments, each iteration may include removing those input parameters that may be statistically insignificant while attempting to add input parameters that may be statistically significant.
  • [0242]
    For each tracer objective in block 1114, a similarity score may be determined by matching the frequency signatures of the objective selected in block 1112 with the tracer objectives analyzed in block 1114. The similarity score may be a statistical measurement of the correlation or similarity of the two frequency signatures.
  • [0243]
    The tracer objectives may be sorted by similarity score in block 1118. Starting with the most similar frequency signature in block 1120, each input parameter may be analyzed in block 1122 to determine a relevance score. The relevance score may take into account the similarity of the frequency signatures coupled with the relevance of the input parameter to the data collected in the tracer objective selected in block 1120. In many embodiments, a similarity score created in block 1116 may be multiplied with an influence factor for the input parameter to yield a relevance score.
  • [0244]
    The scored input parameters may be sorted by score in block 1126. A parameter may be selected in block 1128 and, when the parameter may be above a threshold in block 1130, the parameter may be added to the tracer objective and the process may loop back to 1128 to select the next parameter in the sorted list.
  • [0245]
    When a parameter does not meet the relevance threshold in block 1130 but some new parameters may have been added in block 1134 and additional objectives remain to be processed in block 1140, the process may return to block 1120 to attempt to add more input parameters from other tracer objectives.
  • [0246]
    When a parameter does not meet the relevance threshold in block 1130 and no new parameters have been added in block 1134, the iterating on the objective may be stopped in block 1138. At this stage, the process of embodiment 1100 may have not identified any new input parameters that may potentially be relevant.
  • [0247]
    After processing each objective in block 1140 to generate input parameters, when additional objectives have not undergone input parameter analysis in block 1142, the process may return to block 1112 to select another tracer objective for analysis.
  • [0248]
    After each tracer objective has been analyzed for additional input parameters in block 1142 and at least some of the tracer objectives may have been updated in block 1144, the updated objectives may be dispatched in block 1146. When no updated objectives may be available in block 1144, the iteration process may halt in block 1148.
  • [0249]
    FIG. 12 is a diagram illustration of an embodiment 1200 showing a method for validating profile models. Embodiment 1200 illustrates a method whereby profile models may be generated using test objectives, which may be run on complex, highly instrumented devices. The models may then be validated by lighter weight monitoring systems that may be deployed on production systems.
  • [0250]
    In one use model, an application may be evaluated using a highly instrumented test environment using independent trace objectives that may capture detailed data. From the data, profile models of small elements of the application may be created. In order to test the profile models, the models may be deployed on production hardware that may or may not have the capabilities to perform detailed data collection.
  • [0251]
    In an example, a mobile telephone application may be tested using a virtualized version of a mobile telephone, where the virtualized version may execute on a desktop computer with large amounts of computational power. The data collection may be performed using trace objectives that may be executed along with the application under test. Once a profile model has been generated that may represent the data, the model may be dispatched to a production mobile phone device that may perform a very lightweight monitoring that merely tests one small profile model. Because the profile model may not consume many resources, a monitor may collect data on the mobile phone to generate an error statistic.
  • [0252]
    In block 1202, trace objectives may be created, and those objectives may be deployed in block 1204. Profile models may be generated from the resulting data in block 1206.
  • [0253]
    The profile models may be deployed to devices in block 1208, where the devices in block 1208 may have monitoring agents installed.
  • [0254]
    The profile models may have one or more input parameters and may perform a mathematical function, then return a predicted result. The monitoring agents may capture input parameters from actual usage, perform the calculations defined in the model, the compare the predictive result to the actual result. The monitoring agent may generate an error statistic that may be derived from the difference between a predictive result and an actual result.
  • [0255]
    Those models with high error statistics in block 1210 may update a trace objective in block 1212 and re-submit the trace objective in block 1204. Those models with low error statistics in block 1214 may be assumed to be accurate models and the monitoring frequency may be lowered or removed in block 1216. The models may be aggregated with other models in block 1218.
  • [0256]
    The monitors and profile models may be deployed as a general purpose monitoring system that may detect when performance, input data, or other conditions may have gone awry. In such embodiments, the profile models may be created to monitor variables or conditions that may cause substantial harm or otherwise warn of adverse conditions. Such models may be derived from the aggregated data in some cases.
  • [0257]
    FIG. 13 is a flowchart illustration of an embodiment 1300 showing a method for analyzing results from trace objectives.
  • [0258]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0259]
    Embodiment 1300 illustrates merely one example of a method for analyzing trace objective results. Embodiment 1300 illustrates an example analysis method that compares multiple trace objective results from separate instances of a trace objective. In many cases, a single trace objective may be executed multiple times, either on multiple devices a various times or on the same device but at different times. The results sets may be analyzed to determine whether or not the results may be consistent and predictable. Consistent and predictable results may be considered good results that may be aggregated with other similarly good results.
  • [0260]
    Embodiment 1300 is an example of an embodiment that may analyze the input stream and results stream separately to make decisions using each stream.
  • [0261]
    Each set of results may be processed in block 1302. For each set of results in block 1302, summary statistics may be generated for the input stream in block 1304 and the input stream may be characterized and classified in block 1306. Similarly, the results stream may have summary statistics generated in block 1308 and characterizations and classifications performed in block 1310. A profile model of the results may be created in block 1312.
  • [0262]
    The statistics generated in blocks 1304 and 1308 may be high level representations of the data. Such statistics may include averages, medians, standard deviations, and other descriptors. The characterizations and classifications performed in blocks 1306 and 1310 may involve curve fitting, statistical comparisons to standard curves, linear and nonlinear regression analysis, or other classifications.
  • [0263]
    The profile model generated in block 1312 may be any type of mathematical or other expression of the behavior of the observed data. The profile model may have input parameters that may be drawn from the input stream to predict the values of the results stream.
  • [0264]
    An objective may be selected in block 1314. All of the results set for the objective may be identified in block 1316. In some embodiments, many results sets may be generated, but the operations of embodiment 1300 may assume at least two results sets may be present for the purposes of illustration.
  • [0265]
    The profile model of each instance may be compared in block 1318. When the profile model of the instances is the same in block 1320, the model may be selected to represent the observed data. In many embodiments, the comparison of numerical values generated during profile model generation may not be exact. In such embodiments, the comparison of profile models in block 1318 may consider models similar using a statistical confidence factor, such as 0.99 or greater for example.
  • [0266]
    When the profile models are not the same in block 1320, the input streams may be compared in block 1324. When the input streams are not similar in block 1326, the objective may be re-executed in block 1328 with longer runtime.
  • [0267]
    When the input streams are not similar, one or both of the objectives may not have experienced the full range of input variations. As such, any model generated from the input streams may not fully represent the actual behavior of the application. Such a condition may occur when the data gathering window does not fully encompass at least a small number of periods, for example, where the periods may be statistically significant parameters in a profile model.
  • [0268]
    When the input streams are similar in block 1326, the profile model may be missing parameters that may be statistically significant. In block 1330, some parameters may be added to the trace objective. In some embodiments, statistically insignificant parameters may be removed from the trace objective in block 1332. The statistically insignificant parameters may be those parameters in a profile model with little or no effect on the final result.
  • [0269]
    The updated trace objective may be resubmitted for scheduling and deployment in block 1334.
  • [0270]
    If another objective can be processed in block 1336, the process may return to block 1314 to select a new objective. When no more objectives are available in block 1336, the results may be aggregated in block 1338.
  • [0271]
    FIG. 14 is a diagram illustration of an embodiment 1400 showing a network environment with a tracing objective dispatcher. Embodiment 1400 illustrates an environment with a dispatcher device 1402, tracing generator device 1404, and a set of tracer devices 1406, all of which may be connected by a network 1408.
  • [0272]
    Embodiment 1400 may illustrate a tracing dispatcher that may match a tracing objective to a device that may execute the tracing objective. The match may be made based on the configuration of the tracing device and the estimated resource consumption of the tracing objective.
  • [0273]
    The dispatcher device 1402 may operate on a hardware platform 1410 and may have a dispatcher 1412 that may dispatch various tracer objectives 1414 to the tracer devices 1406. The dispatcher 1412 may consider the device configurations 1416 which may be collected and updated by a tracing manager 1418.
  • [0274]
    The dispatcher 1412 may place tracer objectives on devices within a tracer resource budget that may be defined for each device. The budget may identify a set of resources that may be set aside for tracing functions. As a tracing objective may be placed on a device, the tracer resource budget for the device may be updated, leaving an available resource budget.
  • [0275]
    In many cases, the set of tracer devices 1406 may have different hardware and software configurations, workloads, or other differences that may be taken into consideration when dispatching tracer objectives. A tracing manager 1418 may collect and update such device configurations 1416 on an ongoing basis.
  • [0276]
    The dispatcher device 1402 may use tracer objectives 1414 that may have been created using a tracer generator device 1404. The tracer generator device 1404 may operate on a hardware platform 1420 and may have a tracer objective generator 1422, which may create tracer objectives by analyzing an application 1424.
  • [0277]
    The tracer devices 1406 may operate on a hardware platform 1426 and have a tracer 1428 that may execute a manifest of tracer objectives 1430 against an instance of an application 1432.
  • [0278]
    FIG. 15 is a flowchart illustration of an embodiment 1500 showing a method for deploying tracer objectives. Embodiment 1500 may illustrate a high level method, with a later embodiment illustrating some detailed examples of how certain portions may be implemented.
  • [0279]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0280]
    Embodiment 1500 illustrates a high level process that characterizes devices in block 1504, characterizes tracer objectives in block 1522, and deploys the objectives on the devices in block 1524. Embodiment 1500 illustrates one method that may be used to dispatch tracer objectives, especially one in which the tracing devices may be differently configured.
  • [0281]
    A set of device descriptors may be received in block 1502. The descriptors may be network addresses or other identifiers for devices that may be deployed as tracer devices.
  • [0282]
    For each device in block 1506, many data points may be collected. In the example of embodiment 1500, these data points may be illustrated as being collected prior to deploying tracer objectives. In many embodiments, some of the various data points may change over time and may be updated periodically. Other data points may be relatively constant and may not be updated as frequently.
  • [0283]
    A hardware configuration may be determined in block 1508. The hardware configuration may include processing capabilities and capacities, storage capacities, and other hardware parameters.
  • [0284]
    A network topology may be determined in block 1510. The network topology may include locating the tracing device within a network, which may be used as an input parameter when determining where to deploy a tracer objective.
  • [0285]
    The software configuration of the tracer device may be determined in block 1512. In some cases, the software configuration may include specific tracing capabilities. Some embodiments may have a non-homogenous group of tracing devices, with some devices having tracing capabilities that other devices may not have. Further, some devices may have certain additional software components or workloads that may interfere, influence, or degrade tracing capabilities in some cases. Such knowledge may be useful in matching specific tracing objectives to devices.
  • [0286]
    In some embodiments, a performance test may be performed in block 1514. The performance tests may measure certain performance capabilities that may be measured dynamically, as opposed to static analyses such as performed in blocks 1508 through 1512.
  • [0287]
    The performance tests of block 1514 may measure processor capabilities, storage resources, network bandwidth, and other performance metrics. In some cases, performance tests may be performed while the application under test is executing. The performance tests may identify the resources consumed by the device, which may be used as a factor when computing a resource budget for tracing.
  • [0288]
    Predefined allocations may be identified in block 1516. The predefined allocations may be any limitation or resource allocation that may take precedence over tracing. For example, a production application may be allocated to execute without any tracing during periods of high workload. Such an allocation may be time based, as resources may be allocated based on a period of time. In another example, a device may have resources allocated to a second application or function that may be unrelated to the application under test and any associated tracing functions.
  • [0289]
    In some cases, certain devices may have allocated resources that may be dedicated to tracing functions. For example, a device may have a storage system and network interface card that may be allocated to tracing, while another storage mechanism and network interface card may be allocated to the application under test. Such devices may be specially allocated for tracing, while other devices may have limited or no resource availability for tracing.
  • [0290]
    An initial tracer resource budget may be defined in block 1518. A tracer resource budget may define the resources that may be consumed by a tracer objective for a particular device. In some cases, the tracer resource budget may be set as a percentage of overall capacity. For example, a tracer resource budget may be 5%, 10%, 20%, 25%, 50%, or some other percentage of resources.
  • [0291]
    In some cases, a tracer resource budget may be a percentage of available resources. For example, the performance tests in block 1514 may determine that an application under test may consume 45% of the processor capacity, meaning that 55% of the processor capacity may be not be utilized and could be available for tracing. In a simplified version of such an example, up to 55% of the processor resource could be allocated for tracing without adversely affecting the application.
  • [0292]
    After determining the various parameters, the configuration of the device may be stored. Some of the elements in the configuration may be relatively static, such as the hardware configuration and network topology, while other elements such as the available resources may change dramatically over time. Some embodiments may monitor the configuration and update various elements over time.
  • [0293]
    After characterizing the devices in block 1504, the tracer objectives may be characterized in block 1522. The deploying step of block 1524 may match the tracer objective characteristics with the device characteristics and cause the tracer objectives to be executed. The results may be received and analyzed in block 1526.
  • [0294]
    FIG. 16 is a flowchart illustration of an embodiment 1600 showing a method for tracer objective characterization and deployment.
  • [0295]
    Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
  • [0296]
    Embodiment 1600 illustrates a detailed method for characterizing tracer objectives then matching those tracer objectives with available devices. A manifest of tracer objectives may be created for each device, then the manifests may be deployed to the devices for execution.
  • [0297]
    The method of embodiment 1600 may attempt to place the most costly tracer objectives on the devices with the most available resources. Multiple tracer objectives may be added to a device until all of the allocated tracing resources may be utilized. Embodiment 1600 may attempt to use all of available tracing resources of each device being examined. Such an embodiment may result in some devices being fully loaded while other devices may not have any tracer objectives.
  • [0298]
    The method of embodiment 1600 illustrates merely one method for matching tracer objectives to devices, and other embodiments may have different ways for distributing tracer objectives. For example, another embodiment may attempt to load all devices equally such that each device may perform at least some tracing.
  • [0299]
    Device characterizations may be received in block 1602. An example of device characterizations may be found in embodiment 1500.
  • [0300]
    The tracer objectives may be analyzed in block 1604 and then deployed in block 1606.
  • [0301]
    The tracer objectives may be received in block 1608. For each tracer objective in block 1610, an initial performance test may be performed in block 1612. The costs associated with executing the tracer objective may be estimated in block 1614 and stored in block 1616.
  • [0302]
    The costs for executing a tracer objective may be resource costs. In some cases, several independent factors may make up the cost. For example, processors costs, storage costs, and network bandwidth costs may be combined into the overall cost of executing a tracer objective. In embodiments where a dynamic performance test may not be performed in block 1612, the costs may be estimated by static analysis of the tracer objectives. A static analysis may estimate the processor load, storage usage, and network bandwidth usage for a given tracer objective.
  • [0303]
    The deployment of objectives may begin in block 1618 by sorting the devices by available resources in block 1620. The trace objectives may be sorted by estimated cost from most expensive to least costly in block 1622.
  • [0304]
    A device may be selected in block 1624 and the next tracer objective may be selected in block 1626. An evaluation may be made in block 1628 to determine whether the objective may be deployed on the device. When the tracer objective can be deployed in block 1628, the tracer objective may be added to the device's manifest in block 1630. When the tracer objective cannot be deployed in block 1628, the objective may be skipped in block 1632.
  • [0305]
    The evaluation of block 1628 may evaluate the selected tracer objective for execution on the selected device. The evaluation may examine whether or not any specific allocations may exist that may prevent the tracer objective from being executed, as well as comparing the cost of executing the tracer objective with the available resource budget on the device. Some embodiments may perform other tests or evaluations to determine whether or not an objective may be placed on a device.
  • [0306]
    When more objectives are on the list in block 1634, the process may return to block 1626. The loop back to block 1626 may process each available tracer objective to attempt to use all of the available resources on the selected device.
  • [0307]
    When all objectives have been processed in block 1634, if no tracer objectives may have been placed in the manifest, the objectives may be evaluated in block 1638 for dividing into smaller tracer objectives. The process may return to block 1608.
  • [0308]
    The operations of block 1638 may be reached when a device is selected but there are no tracer objectives that may be small enough or consume fewer resources than may be available on the device. In such a situation, the tracer objectives may be divided into two or more tracer objectives and the placement may be retried.
  • [0309]
    In block 1638, a tracer objective may be evaluated for dividing into two or more tracer objectives. In some cases, a tracer objective may be modified by changing the sampling rate or setting other parameters so that the cost impact may be lessened.
  • [0310]
    Provided that there are tracing objectives in the manifest in block 1636, the available budget for the device may be updated in block 1640 to reflect that the tracing objectives may be executing. The manifest may be deployed in block 1642 to the selected device.
  • [0311]
    When more objectives and more devices still remain in block 1644, the process may return to block 1624 to process the next device. When more objectives remain but no more devices in block 1646, the process may wait in block 1648 until some of the tracer objectives to finish processing. At that point, remaining objectives may be allocated and dispatched. When all of the objectives have been allocated, the process may end in block 1650, at which point an analysis operation may be performed.
  • [0312]
    The foregoing description of the subject matter has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the subject matter to the precise form disclosed, and other modifications and variations may be possible in light of the above teachings. The embodiment was chosen and described in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and various modifications as are suited to the particular use contemplated. It is intended that the appended claims be construed to include other alternative embodiments except insofar as limited by the prior art.

Claims (20)

    What is claimed is:
  1. 1. A method performed by a computer processor, said method comprising:
    receiving a plurality of tracer objectives, each of said tracer objectives comprising a set of monitored objects and a tracer cost, said set of monitored objects being objects within an application;
    identifying a tracing system executing said application;
    determining a tracing resource budget for said tracing system;
    selecting a first tracer objective having a first tracer cost, said first tracer cost being within said tracing resource budget; and
    causing said first tracer objective to be executed on said tracing system.
  2. 2. The method of claim 1 further comprising:
    selecting a second tracer objective having a second tracer cost, said second tracer cost being within said tracing resource budget; and
    causing said second tracer objective to be executed on said tracing system.
  3. 3. The method of claim 2, said tracing resource budget being greater than a sum of said first tracer cost and said second tracer cost.
  4. 4. The method of claim 3, said first tracer objective and said second tracer objective being executed at the same time.
  5. 5. The method of claim 2, said tracing resource budget being less than a sum of said first tracer cost and said second tracer cost.
  6. 6. The method of claim 5, said second tracer objective being executed when said first tracer objective is not executing.
  7. 7. The method of claim 1 further comprising:
    determining that said first tracer cost is larger than said tracing resource budget; and
    changing said first tracer objective so that said first tracer cost is less than said tracing resource budget.
  8. 8. The method of claim 7, said changing said first tracer objective comprises adjusting one of a group composed of:
    sampling rate; and
    duration of execution.
  9. 9. The method of claim 1 further comprising:
    identifying a plurality of tracing systems;
    for each of said plurality of tracing systems, determining a tracing resource budget, said tracing system being selected from said plurality of tracing systems.
  10. 10. The method of claim 9 further comprising:
    for each of said plurality of tracing systems, determining a set of capabilities.
  11. 11. The method of claim 10, a first tracing system having a first set of capabilities and said second tracing system having a second set of capabilities, said first set of capabilities being different from said second set of capabilities.
  12. 12. A system comprising:
    a processor;
    a dispatcher executing on said processor, said dispatcher that:
    receives a plurality of tracer objectives, each of said tracer objectives comprising a set of monitored objects and a tracer cost, said set of monitored objects being objects within an application;
    identifies a tracing system executing said application;
    determines a tracing resource budget for said tracing system;
    selects a first tracer objective having a first tracer cost, said first tracer cost being within said tracing resource budget; and
    causes said first tracer objective to be executed on said tracing system.
  13. 13. The system of claim 12 further comprising:
    said application.
  14. 14. The system of claim 13 further comprising:
    said application executing on said processor.
  15. 15. The system of claim 12 further comprising:
    a plurality of processors.
  16. 16. The system of claim 15, said application executing on a first processor, said dispatcher executing on a second processor.
  17. 17. The system of claim 15, said application executing on a first processor, said tracing objective executing at least in part on a second processor.
  18. 18. A system comprising:
    a plurality of application devices executing an application and having an instrumentation infrastructure;
    a first device comprising a dispatcher, said dispatcher that;
    receives a plurality of tracer objectives, each of said tracer objectives comprising a set of monitored objects and a tracer cost, said set of monitored objects being objects within an application;
    identifies a tracing system executing said application, said tracing system being one of said application devices;
    determines a tracing resource budget for said tracing system;
    selects a first tracer objective having a first tracer cost, said first tracer cost being within said tracing resource budget; and
    causes said first tracer objective to be executed on said tracing system.
  19. 19. The system of claim 18, said plurality of application devices each executing an instance of said application.
  20. 20. The system of claim 18, at least some of said application devices executing a first portion of said application.
US13765651 2013-02-12 2013-02-12 Deploying Trace Objectives using Cost Analyses Abandoned US20130283281A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13765651 US20130283281A1 (en) 2013-02-12 2013-02-12 Deploying Trace Objectives using Cost Analyses

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US13765651 US20130283281A1 (en) 2013-02-12 2013-02-12 Deploying Trace Objectives using Cost Analyses
EP20130874921 EP2956867A4 (en) 2013-02-12 2013-06-20 Deploying trace objectives using cost analyses
CN 201380072861 CN105122234A (en) 2013-02-12 2013-06-20 Deploying trace objectives using cost analyses
PCT/US2013/046922 WO2014126603A1 (en) 2013-02-12 2013-06-20 Deploying trace objectives using cost analyses
US14820957 US9767006B2 (en) 2013-02-12 2015-08-07 Deploying trace objectives using cost analyses

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14820957 Continuation US9767006B2 (en) 2013-02-12 2015-08-07 Deploying trace objectives using cost analyses

Publications (1)

Publication Number Publication Date
US20130283281A1 true true US20130283281A1 (en) 2013-10-24

Family

ID=49381375

Family Applications (2)

Application Number Title Priority Date Filing Date
US13765651 Abandoned US20130283281A1 (en) 2013-02-12 2013-02-12 Deploying Trace Objectives using Cost Analyses
US14820957 Active US9767006B2 (en) 2013-02-12 2015-08-07 Deploying trace objectives using cost analyses

Family Applications After (1)

Application Number Title Priority Date Filing Date
US14820957 Active US9767006B2 (en) 2013-02-12 2015-08-07 Deploying trace objectives using cost analyses

Country Status (4)

Country Link
US (2) US20130283281A1 (en)
EP (1) EP2956867A4 (en)
CN (1) CN105122234A (en)
WO (1) WO2014126603A1 (en)

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130283102A1 (en) * 2013-02-12 2013-10-24 Concurix Corporation Deployment of Profile Models with a Monitoring Agent
US20130283241A1 (en) * 2013-02-12 2013-10-24 Concurix Corporation Periodicity Optimization in an Automated Tracing System
US20130283246A1 (en) * 2013-02-12 2013-10-24 Concurix Corporation Cost Analysis for Selecting Trace Objectives
US8793669B2 (en) 2012-07-17 2014-07-29 Concurix Corporation Pattern extraction from executable code in message passing environments
US8924941B2 (en) 2013-02-12 2014-12-30 Concurix Corporation Optimization analysis using similar frequencies
US8954546B2 (en) 2013-01-25 2015-02-10 Concurix Corporation Tracing with a workload distributor
US9021262B2 (en) 2013-01-25 2015-04-28 Concurix Corporation Obfuscating trace data
US9021447B2 (en) 2013-02-12 2015-04-28 Concurix Corporation Application tracing by distributed objectives
US9043788B2 (en) 2012-08-10 2015-05-26 Concurix Corporation Experiment manager for manycore systems
US9047196B2 (en) 2012-06-19 2015-06-02 Concurix Corporation Usage aware NUMA process scheduling
US20150178168A1 (en) * 2013-12-24 2015-06-25 International Business Machines Corporation Persistent Data Across Reboots
US9207969B2 (en) 2013-01-25 2015-12-08 Microsoft Technology Licensing, Llc Parallel tracing for performance and detail
US9256969B2 (en) 2013-02-01 2016-02-09 Microsoft Technology Licensing, Llc Transformation function insertion for dynamically displayed tracer data
US9286042B2 (en) 2012-05-01 2016-03-15 Microsoft Technology Licensing, Llc Control flow graph application configuration
US9323652B2 (en) 2013-03-15 2016-04-26 Microsoft Technology Licensing, Llc Iterative bottleneck detector for executing applications
US9323863B2 (en) 2013-02-01 2016-04-26 Microsoft Technology Licensing, Llc Highlighting of time series data on force directed graph
US9417935B2 (en) 2012-05-01 2016-08-16 Microsoft Technology Licensing, Llc Many-core process scheduling to maximize cache usage
US9575874B2 (en) 2013-04-20 2017-02-21 Microsoft Technology Licensing, Llc Error list and bug report analysis for configuring an application tracer
US9575813B2 (en) 2012-07-17 2017-02-21 Microsoft Technology Licensing, Llc Pattern matching process scheduler with upstream optimization
US9658943B2 (en) 2013-05-21 2017-05-23 Microsoft Technology Licensing, Llc Interactive graph for navigating application code
US9734040B2 (en) 2013-05-21 2017-08-15 Microsoft Technology Licensing, Llc Animated highlights in a graph representing an application
US9754396B2 (en) 2013-07-24 2017-09-05 Microsoft Technology Licensing, Llc Event chain visualization of performance data
US9767006B2 (en) 2013-02-12 2017-09-19 Microsoft Technology Licensing, Llc Deploying trace objectives using cost analyses
US9772927B2 (en) 2013-11-13 2017-09-26 Microsoft Technology Licensing, Llc User interface for selecting tracing origins for aggregating classes of trace data
US9864672B2 (en) 2013-09-04 2018-01-09 Microsoft Technology Licensing, Llc Module specific tracing in a shared module environment

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6230313B1 (en) * 1998-12-23 2001-05-08 Cray Inc. Parallelism performance analysis based on execution trace information
US20060037022A1 (en) * 2004-08-10 2006-02-16 Byrd Stephen A Apparatus, system, and method for automatically discovering and grouping resources used by a business process
US20060174165A1 (en) * 2005-02-03 2006-08-03 Cisco Technology, Inc. System and method for tracing and logging for software module
US20060190596A1 (en) * 2005-02-18 2006-08-24 Nec Corporation Bottleneck detection system, measurement object server, bottleneck detection method and program
US20060224375A1 (en) * 2005-03-11 2006-10-05 Barnett Paul T Method for building enterprise scalability models from load test and trace test data
US20080312980A1 (en) * 2007-06-13 2008-12-18 International Business Machines Corporation Method and system for staffing and cost estimation models aligned with multi-dimensional project plans for packaged software applications
US20110004443A1 (en) * 2008-02-22 2011-01-06 Takashi Horikawa It system behavior measurement and analysis system and method thereof
US20120017123A1 (en) * 2010-07-16 2012-01-19 International Business Machines Corporation Time-Based Trace Facility
US20120060142A1 (en) * 2010-09-02 2012-03-08 Code Value Ltd. System and method of cost oriented software profiling

Family Cites Families (449)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4907151A (en) 1988-09-30 1990-03-06 Digital Equipment Corporation System and method for garbage collection with ambiguous roots
JP2765969B2 (en) 1989-07-31 1998-06-18 日立ソフトウエアエンジニアリング株式会社 Graphical data-driven program development support device
US5179702A (en) 1989-12-29 1993-01-12 Supercomputer Systems Limited Partnership System and method for controlling a highly parallel multiprocessor using an anarchy based scheduler for parallel execution thread scheduling
CA2078315A1 (en) 1991-09-20 1993-03-21 Christopher L. Reeve Parallel processing apparatus and method for utilizing tiling
US5369570A (en) 1991-11-14 1994-11-29 Parad; Harvey A. Method and system for continuous integrated resource management
DE4332993C1 (en) 1993-09-28 1994-11-24 Siemens Ag Tracer system for fault analysis in running real-time systems
US5606688A (en) 1994-08-31 1997-02-25 International Business Machines Corporation Method and apparatus for dynamic cache memory allocation via single-reference residency times
US5778004A (en) 1995-06-02 1998-07-07 Unisys Corporation Vector translator
US7091948B2 (en) 1997-04-25 2006-08-15 Immersion Corporation Design of force sensations for haptic feedback computer interfaces
US5870606A (en) 1996-05-01 1999-02-09 International Business Machines Corp. Data triggered trace technique for debugging software programs
US5758183A (en) 1996-07-17 1998-05-26 Digital Equipment Corporation Method of reducing the number of overhead instructions by modifying the program to locate instructions that access shared data stored at target addresses before program execution
US6591414B2 (en) 1996-10-28 2003-07-08 Fujitsu Limited Binary program conversion apparatus, binary program conversion method and program recording medium
JP3730740B2 (en) 1997-02-24 2006-01-05 株式会社日立製作所 Parallel job multiple scheduling method
JPH10240813A (en) 1997-02-26 1998-09-11 Honda Motor Co Ltd Work management system
US5937194A (en) 1997-03-12 1999-08-10 International Business Machines Corporation Method of, system for, and article of manufacture for providing a generic reduction object for data parallelism
US6892226B1 (en) 1997-03-27 2005-05-10 Intel Corporation System for delivery of dynamic content to a client device
US5953736A (en) 1997-04-23 1999-09-14 Sun Microsystems, Inc. Write barrier system and method including pointer-specific instruction variant replacement mechanism
US6032201A (en) 1997-06-19 2000-02-29 Cirrus Logic, Inc. Plug and play system using proxy for retrieving correct information about current device from system registry when current device is not the newly installed device
US6658447B2 (en) 1997-07-08 2003-12-02 Intel Corporation Priority based simultaneous multi-threading
US6282701B1 (en) 1997-07-31 2001-08-28 Mutek Solutions, Ltd. System and method for monitoring and analyzing the execution of computer programs
WO2000007100A1 (en) 1998-07-30 2000-02-10 Mutek Solutions, Ltd. System and method for remotely analyzing the execution of computer programs
US6202199B1 (en) 1997-07-31 2001-03-13 Mutek Solutions, Ltd. System and method for remotely analyzing the execution of computer programs
US6286130B1 (en) 1997-08-05 2001-09-04 Intel Corporation Software implemented method for automatically validating the correctness of parallel computer programs
US6083281A (en) 1997-11-14 2000-07-04 Nortel Networks Corporation Process and apparatus for tracing software entities in a distributed system
GB9725742D0 (en) 1997-12-04 1998-02-04 Hewlett Packard Co Object gateway
US6553564B1 (en) 1997-12-12 2003-04-22 International Business Machines Corporation Process and system for merging trace data for primarily interpreted methods
US6662358B1 (en) 1997-12-12 2003-12-09 International Business Machines Corporation Minimizing profiling-related perturbation using periodic contextual information
US6059842A (en) 1998-04-14 2000-05-09 International Business Machines Corp. System and method for optimizing computer software and hardware
US6158049A (en) 1998-08-11 2000-12-05 Compaq Computer Corporation User transparent mechanism for profile feedback optimization
US6381735B1 (en) 1998-10-02 2002-04-30 Microsoft Corporation Dynamic classification of sections of software
US6826752B1 (en) 1998-12-17 2004-11-30 California Institute Of Technology Programming system and thread synchronization mechanisms for the development of selectively sequential and multithreaded computer programs
US6378066B1 (en) 1999-02-04 2002-04-23 Sun Microsystems, Inc. Method, apparatus, and article of manufacture for developing and executing data flow programs, and optimizing user input specifications
US6321240B1 (en) 1999-03-15 2001-11-20 Trishul M. Chilimbi Data structure partitioning with garbage collection to optimize cache utilization
US7185367B2 (en) 1999-05-11 2007-02-27 Cylant, Inc. Method and system for establishing normal software system behavior and departures from normal behavior
US6397382B1 (en) 1999-05-12 2002-05-28 Wind River Systems, Inc. Dynamic software code instrumentation with cache disabling feature
US6636242B2 (en) 1999-08-31 2003-10-21 Accenture Llp View configurer in a presentation services patterns environment
US6856950B1 (en) 1999-10-15 2005-02-15 Silicon Graphics, Inc. Abstract verification environment
US6584487B1 (en) 1999-11-16 2003-06-24 Hewlett-Packard Development Company, L.P. Method, system, and apparatus for managing tasks
US6629128B1 (en) 1999-11-30 2003-09-30 Recursion Software, Inc. System and method for distributed processing in a computer network
US7058928B2 (en) 1999-12-23 2006-06-06 Identify Software Ltd. System and method for conditional tracing of computer programs
US8312435B2 (en) 2000-12-26 2012-11-13 Identify Software Ltd. (IL) System and method for conditional tracing of computer programs
US20020087949A1 (en) 2000-03-03 2002-07-04 Valery Golender System and method for software diagnostics using a combination of visual and dynamic tracing
US7254607B2 (en) 2000-03-30 2007-08-07 United Devices, Inc. Dynamic coordination and control of network connected devices for large-scale network site testing and associated architectures
JP3641997B2 (en) 2000-03-30 2005-04-27 日本電気株式会社 Program conversion apparatus and method and recording medium
GB0011020D0 (en) 2000-05-09 2000-06-28 Ibm Intercepting system API calls
US6735687B1 (en) 2000-06-15 2004-05-11 Hewlett-Packard Development Company, L.P. Multithreaded microprocessor with asymmetrical central processing units
US7958194B2 (en) 2008-08-25 2011-06-07 Massively Parallel Technologies, Inc. System and method for parallel processing using a Type I Howard Cascade
US6704024B2 (en) 2000-08-07 2004-03-09 Zframe, Inc. Visual content browsing using rasterized representations
US20020112033A1 (en) 2000-08-09 2002-08-15 Doemling Marcus F. Content enhancement system and method
CA2315449A1 (en) 2000-08-10 2002-02-10 Ibm Canada Limited - Ibm Canada Limitee Generation of runtime execution traces of applications and associated problem determination
GB2366879B (en) 2000-09-16 2005-02-16 Ibm Tracing the execution path of a computer program
US7065763B1 (en) 2000-09-29 2006-06-20 Emc Corporation Method of reducing contention of a highly contended lock protecting multiple data items
US20040205718A1 (en) 2000-12-11 2004-10-14 Sun Microsystems, Inc. Self-tuning object libraries
US7058927B2 (en) * 2000-12-21 2006-06-06 Veritas Operating Corporation Computer software run-time analysis systems and methods
US7197505B2 (en) 2000-12-22 2007-03-27 Star Bridge Systems, Inc. Multi-dimensional recursive wavefront behavioral synthesis
US7730001B2 (en) 2001-02-09 2010-06-01 International Business Machines Corporation Computer system program and method to characterize each of a plurality of objects used at runtime to determine a lowest cost property among a plurality of potential alternative properties for each of said objects minimizing total cost of interaction among components during program execution
US6813731B2 (en) 2001-02-26 2004-11-02 Emc Corporation Methods and apparatus for accessing trace data
US6598141B1 (en) 2001-03-08 2003-07-22 Microsoft Corporation Manipulating interior pointers on a stack during garbage collection
US20020184615A1 (en) 2001-04-25 2002-12-05 Sumner William Earl System and method for selectively and automatically modifying the source code of a computer program
US7047521B2 (en) 2001-06-07 2006-05-16 Lynoxworks, Inc. Dynamic instrumentation event trace system and methods
EP1412832A4 (en) 2001-06-15 2007-10-03 Cadence Design Systems Inc Procedure for optimizing mergeability and datapath widths of data flow graphs
US20020199179A1 (en) 2001-06-21 2002-12-26 Lavery Daniel M. Method and apparatus for compiler-generated triggering of auxiliary codes
US6593883B2 (en) 2001-06-25 2003-07-15 Motorola, Inc. Timing estimation method and apparatus for a location system
US20020196229A1 (en) 2001-06-26 2002-12-26 Frank Chen Graphics-based calculator capable of directly editing data points on graph
US6928488B1 (en) 2001-06-27 2005-08-09 Microsoft Corporation Architecture and method for serialization and deserialization of objects
US7117504B2 (en) 2001-07-10 2006-10-03 Microsoft Corporation Application program interface that enables communication for a network software platform
WO2003007134A1 (en) * 2001-07-13 2003-01-23 Koninklijke Philips Electronics N.V. Method of running a media application and a media system with job control
US7020659B2 (en) 2001-08-15 2006-03-28 Oic Acquistion I Corporation System and method for managing bi-directional relationships between objects
US7093234B2 (en) 2001-08-24 2006-08-15 International Business Machines Corporation Dynamic CPU usage profiling and function call tracing
US6954924B2 (en) 2001-09-20 2005-10-11 International Business Machines Corporation System and method for employing externalized, dynamically configurable, cacheable trigger points
US7213240B2 (en) 2001-10-05 2007-05-01 Sun Microsystems, Inc. Platform-independent selective ahead-of-time compilation
US7499907B2 (en) 2001-10-12 2009-03-03 Teradata Us, Inc. Index selection in a database system
US7117497B2 (en) 2001-11-08 2006-10-03 Honeywell International, Inc. Budget transfer mechanism for time-partitioned real-time operating systems
US20030145314A1 (en) 2002-01-31 2003-07-31 Khoa Nguyen Method of efficient dynamic data cache prefetch insertion
US20040015600A1 (en) 2002-02-21 2004-01-22 Ashutosh Tiwary Workload post-processing and parameterization for a system for performance testing of N-tiered computer systems using recording and playback of workloads
US7275243B2 (en) 2002-03-22 2007-09-25 Sun Microsystems, Inc. Mobile download system
US20030231207A1 (en) 2002-03-25 2003-12-18 Baohua Huang Personal e-mail system and method
US7890771B2 (en) 2002-04-17 2011-02-15 Microsoft Corporation Saving and retrieving data based on public key encryption
EP1522191B1 (en) 2002-04-19 2013-07-17 Opentv, Inc. Supporting common interactive television functionality through presentation engine syntax
US7398531B2 (en) 2002-05-07 2008-07-08 Oracle International Corporation Providing common memory management code to objects that are instances of different classes
US7451206B2 (en) 2002-05-20 2008-11-11 Siemens Communications, Inc. Send of software tracer messages via IP from several sources to be stored by a remote server
JP4528116B2 (en) 2002-06-25 2010-08-18 インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation Method and system for monitoring the application of performance in a distributed environment
US7143412B2 (en) 2002-07-25 2006-11-28 Hewlett-Packard Development Company, L.P. Method and apparatus for optimizing performance in a multi-processing system
EP1540486A4 (en) 2002-08-09 2010-06-09 Reflexion Network Solutions In System and method for controlling access to an electronic message recipient
US7146607B2 (en) 2002-09-17 2006-12-05 International Business Machines Corporation Method and system for transparent dynamic optimization in a multiprocessing environment
US7310777B2 (en) 2002-10-18 2007-12-18 Computer Associates Think, Inc. User interface for viewing performance information about transactions
US7386839B1 (en) 2002-11-06 2008-06-10 Valery Golender System and method for troubleshooting software configuration problems using application tracing
US7143396B2 (en) 2002-11-06 2006-11-28 Sun Microsystems, Inc. System and method for measuring code segment performance
US7100151B2 (en) * 2002-11-22 2006-08-29 Texas Instruments Incorporated Recovery from corruption using event offset format in data trace
JP4436036B2 (en) 2002-12-18 2010-03-24 インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation The information processing apparatus, the trace processing method, program and recording medium
US20040154010A1 (en) 2003-01-31 2004-08-05 Pedro Marcuello Control-quasi-independent-points guided speculative multithreading
US7587584B2 (en) 2003-02-19 2009-09-08 Intel Corporation Mechanism to exploit synchronization overhead to improve multithreaded performance
US8032866B1 (en) 2003-03-27 2011-10-04 Identify Software Ltd. System and method for troubleshooting runtime software problems using application learning
US7334230B2 (en) 2003-03-31 2008-02-19 International Business Machines Corporation Resource allocation in a NUMA architecture based on separate application specified resource and strength preferences for processor and memory resources
US6915212B2 (en) 2003-05-08 2005-07-05 Moac, Llc Systems and methods for processing complex data sets
US20050015368A1 (en) 2003-07-15 2005-01-20 International Business Machines Corporation Query modelling tool having a dynamically adaptive interface
WO2005017735A1 (en) 2003-08-19 2005-02-24 Fujitsu Limited System and program for detecting bottleneck of disc array device
US7415044B2 (en) 2003-08-22 2008-08-19 Telefonaktiebolaget Lm Ericsson (Publ) Remote synchronization in packet-switched networks
US7194664B1 (en) 2003-09-08 2007-03-20 Poon Fung Method for tracing application execution path in a distributed data processing system
US20050066149A1 (en) 2003-09-22 2005-03-24 Codito Technologies Private Limited Method and system for multithreaded processing using errands
US7457872B2 (en) 2003-10-15 2008-11-25 Microsoft Corporation On-line service/application monitoring and reporting system
US7478371B1 (en) 2003-10-20 2009-01-13 Sun Microsystems, Inc. Method for trace collection
US7587709B2 (en) 2003-10-24 2009-09-08 Microsoft Corporation Adaptive instrumentation runtime monitoring and analysis
US7577943B2 (en) 2003-10-24 2009-08-18 Microsoft Corporation Statistical memory leak detection
JP2005149136A (en) 2003-11-14 2005-06-09 Fujitsu Ltd Information collection program, information collection method, information collection system and information collection device
US7389494B1 (en) 2003-11-14 2008-06-17 Sun Microsystems, Inc. Mechanism for statically defined trace points with minimal disabled probe effect
EP1690163A4 (en) 2003-11-17 2011-07-13 Virginia Tech Intell Prop Transparent checkpointing and process migration in a distributed system
US7584500B2 (en) 2003-11-19 2009-09-01 Hughes Network Systems, Llc Pre-fetching secure content using proxy architecture
US20050131995A1 (en) 2003-12-11 2005-06-16 International Business Machines Corporation Autonomic evaluation of web workload characteristics for self-configuration memory allocation
US7580905B2 (en) 2003-12-15 2009-08-25 Intel Corporation Adaptive configuration of platform
US6970805B1 (en) 2003-12-23 2005-11-29 Unisys Corporatiion Analysis of data processing system performance
US20050149912A1 (en) 2003-12-29 2005-07-07 Intel Corporation Dynamic online optimizer
US7526757B2 (en) 2004-01-14 2009-04-28 International Business Machines Corporation Method and apparatus for maintaining performance monitoring structures in a page table for use in monitoring performance of a computer program
US7490218B2 (en) 2004-01-22 2009-02-10 University Of Washington Building a wavecache
US7913305B2 (en) 2004-01-30 2011-03-22 Microsoft Corporation System and method for detecting malware in an executable code module according to the code module's exhibited behavior
US20050180330A1 (en) 2004-02-17 2005-08-18 Touchgraph Llc Method of animating transitions and stabilizing node motion during dynamic graph navigation
US7882546B2 (en) 2004-03-04 2011-02-01 International Business Machines Corporation Controlling access of a client system to an access protected remote resource
EP1580668B1 (en) 2004-03-25 2007-12-26 Software Engineering GmbH Provision of access paths to data within a database
US7631010B2 (en) 2004-04-16 2009-12-08 Microsoft Corporation Systems and methods in support of data base page synchronization
US7587721B2 (en) 2004-05-20 2009-09-08 Sap Ag Sharing objects in runtime systems
US7707583B2 (en) 2004-05-20 2010-04-27 Sap Ag Robust sharing of runtime systems
US7415704B2 (en) 2004-05-20 2008-08-19 Sap Ag Sharing objects in runtime systems
US7343521B2 (en) 2004-05-28 2008-03-11 International Business Machines Corporation Method and apparatus to preserve trace data
JP2005346414A (en) 2004-06-03 2005-12-15 Fujitsu Ltd Trace processing program, method, and device
US7827539B1 (en) 2004-06-25 2010-11-02 Identify Software Ltd. System and method for automated tuning of program execution tracing
US7954050B2 (en) 2004-06-25 2011-05-31 Icesoft Technologies Canada Corp. Systems and methods for rendering and increasing portability of document-based user interface software objects
US8200805B2 (en) 2004-06-28 2012-06-12 Neuse Douglas M System and method for performing capacity planning for enterprise applications
JP3901182B2 (en) 2004-06-30 2007-04-04 日本電気株式会社 Program parallelizing apparatus and method and program
JP3901180B2 (en) 2004-06-30 2007-04-04 日本電気株式会社 Program parallelizing apparatus and method and program
US7346809B2 (en) 2004-08-05 2008-03-18 International Business Machines Corporation Bootable post crash analysis environment
US20060047752A1 (en) 2004-08-27 2006-03-02 Reconda International Corp. A System and Method to Capture, Filter, and Statistically Analyze Electronic Messages
US8010337B2 (en) * 2004-09-22 2011-08-30 Microsoft Corporation Predicting database system performance
US20060101467A1 (en) 2004-10-18 2006-05-11 International Business Machines Corporation Process execution management based on resource requirements and business impacts
US8566326B2 (en) 2004-11-05 2013-10-22 Oracle International Corporation High-performance log-based processing
US7774295B2 (en) 2004-11-17 2010-08-10 Targit A/S Database track history
US7743380B2 (en) 2005-01-21 2010-06-22 Hewlett-Packard Development Company, L.P. Monitoring clustered software applications
US7409520B2 (en) 2005-01-25 2008-08-05 International Business Machines Corporation Systems and methods for time division multiplex multithreading
US7606168B2 (en) 2005-01-28 2009-10-20 Attenex Corporation Apparatus and method for message-centric analysis and multi-aspect viewing using social networks
US7543200B2 (en) 2005-02-17 2009-06-02 Advantest Corporation Method and system for scheduling tests in a parallel test system
US8266608B2 (en) 2005-02-18 2012-09-11 Green Hills Software, Inc. Post-compile instrumentation of object code for generating execution trace data
US7685561B2 (en) 2005-02-28 2010-03-23 Microsoft Corporation Storage API for a common data platform
US20060200738A1 (en) 2005-03-02 2006-09-07 Tira Wireless Inc. System and method for modifying a mobile device application
US20060230319A1 (en) 2005-04-12 2006-10-12 Ryali Jogarao M Automated migration of software instructions
KR101023274B1 (en) 2005-04-20 2011-03-18 더 보드 오브 리전츠 오브 더 유니버시티 오브 텍사스 시스템 Channel information feedback system and method for cellular communication
US7810075B2 (en) 2005-04-29 2010-10-05 Sap Ag Common trace files
US7681188B1 (en) 2005-04-29 2010-03-16 Sun Microsystems, Inc. Locked prefetch scheduling in general cyclic regions
US7797585B1 (en) * 2005-05-09 2010-09-14 Emc Corporation System and method for handling trace data for analysis
US8527958B2 (en) 2005-05-16 2013-09-03 Texas Instruments Incorporated Profiling operating context and tracing program on a target processor
US7493400B2 (en) 2005-05-18 2009-02-17 Oracle International Corporation Creating and dissolving affinity relationships in a cluster
US20060277477A1 (en) 2005-06-02 2006-12-07 Christenson Mark G K System and method for generating enhanced depiction of electronic files such as web files
US8239939B2 (en) 2005-07-15 2012-08-07 Microsoft Corporation Browser protection module
US7239980B2 (en) 2005-08-30 2007-07-03 International Business Machines Corporation Method and apparatus for adaptive tracing with different processor frequencies
US20070061241A1 (en) 2005-09-15 2007-03-15 Jovanovic Vladan D Method for trading securities
US8037465B2 (en) 2005-09-30 2011-10-11 Intel Corporation Thread-data affinity optimization using compiler
US20070089094A1 (en) 2005-10-13 2007-04-19 Levine Frank E Temporal sample-based profiling
JP4918544B2 (en) 2005-10-28 2012-04-18 パナソニック株式会社 Obfuscation evaluation method, obfuscation evaluation device, obfuscation evaluation program, storage medium, and an integrated circuit
EP1783604A3 (en) 2005-11-07 2007-10-03 Slawomir Adam Janczewski Object-oriented, parallel language, method of programming and multi-processor computer
US20070168992A1 (en) 2005-11-17 2007-07-19 International Business Machines Corporation Method of tracing back the execution path in a debugger
US8176081B2 (en) 2005-11-18 2012-05-08 International Business Machines Corporation Forms integration of an external data model not implemented through a document object model (DOM) accessible application programming interface (API)
WO2007067562A3 (en) 2005-12-06 2007-10-25 Boston Circuits Inc Methods and apparatus for multi-core processing with dedicated thread management
US20070136201A1 (en) 2005-12-12 2007-06-14 Google Inc. Customized container document modules using preferences
US8185819B2 (en) 2005-12-12 2012-05-22 Google Inc. Module specification for a module to be incorporated into a container document
US7730082B2 (en) 2005-12-12 2010-06-01 Google Inc. Remote module incorporation into a container document
US20070204010A1 (en) 2005-12-12 2007-08-30 Steven Goldberg Remote Module Syndication System and Method
US7725530B2 (en) 2005-12-12 2010-05-25 Google Inc. Proxy server collection of data for module incorporation into a container document
US9294334B2 (en) 2005-12-12 2016-03-22 Google Inc. Controlling communication within a container document
WO2007070711A3 (en) 2005-12-15 2009-05-07 Alain Cohen Interactive network monitoring and analysis
US7987452B2 (en) 2005-12-15 2011-07-26 International Business Machines Corporation Profile-driven lock handling
US20070143795A1 (en) 2005-12-20 2007-06-21 Duong-Han Tran Application trace for distributed systems environment
US7739662B2 (en) 2005-12-30 2010-06-15 Intel Corporation Methods and apparatus to analyze processor systems
US20070180147A1 (en) 2006-02-01 2007-08-02 Connect It, Llc System for insertion of advertising content in user-requested internet web pages
US20070226696A1 (en) 2006-02-03 2007-09-27 Dell Products L.P. System and method for the execution of multithreaded software applications
WO2007090205A3 (en) 2006-02-04 2008-04-17 James D Keeler System and method for providing advertising and content in a distributed internet access environment
US20070198524A1 (en) 2006-02-09 2007-08-23 International Business Machines Corporation Maintaining connections between application servers and databases in a multitier computer architecture
US8769511B2 (en) 2006-02-16 2014-07-01 The Regents Of The University Of California Dynamic incremental compiler and method
US20070204223A1 (en) 2006-02-27 2007-08-30 Jay Bartels Methods of and systems for personalizing and publishing online content
US20070214333A1 (en) 2006-03-10 2007-09-13 Dell Products L.P. Modifying node descriptors to reflect memory migration in an information handling system with non-uniform memory access
GB0604991D0 (en) 2006-03-11 2006-04-19 Slam Games Ltd Instrumentation for real-time performance profiling
US20070220513A1 (en) 2006-03-15 2007-09-20 International Business Machines Corporation Automatic detection of hang, bottleneck and deadlock
US9146789B2 (en) 2006-03-21 2015-09-29 Oracle America, Inc. Method and apparatus for generating and using location-independent distributed object references
US7954094B2 (en) 2006-03-27 2011-05-31 International Business Machines Corporation Method for improving performance of executable code
US20070239528A1 (en) 2006-03-29 2007-10-11 Reachlocal, Inc. Dynamic proxy method and apparatus for an online marketing campaign
US7552308B2 (en) 2006-04-04 2009-06-23 International Business Machines Corporation Method and apparatus for temporary mapping of executable program segments
US20070260849A1 (en) 2006-05-05 2007-11-08 Chen Wen-Tzer T Method and apparatus for executing instrumentation code using a target processor
US7979245B1 (en) 2006-05-17 2011-07-12 Quest Software, Inc. Model-based systems and methods for monitoring computing resource performance
US7543184B2 (en) 2006-05-23 2009-06-02 The Mathworks, Inc. System and method for distributing system tests in parallel computing environments
US20080126828A1 (en) 2006-06-07 2008-05-29 Janice Marie Girouard Dynamic enablement and customization of tracing information in a data processing system
US20080005281A1 (en) 2006-06-29 2008-01-03 Microsoft Corporation Error capture and reporting in a distributed computing environment
US8112756B2 (en) 2006-07-20 2012-02-07 Hewlett-Packard Development Company, L.P. System and method for evaluating a workload and its impact on performance of a workload manager
FR2904499B1 (en) 2006-07-27 2009-01-09 Commissariat Energie Atomique Method for decoding a message passing with scheduling in a neighborhood of reliability.
KR101495575B1 (en) 2006-08-10 2015-02-25 아브 이니티오 테크놀로지 엘엘시 Distributing services in graph-based computations
US8166462B2 (en) 2006-09-07 2012-04-24 Oracle America, Inc. Method and apparatus for sorting and displaying costs in a data space profiler
US8028200B2 (en) 2006-09-29 2011-09-27 Sap Ag Tracing operations in multiple computer systems
US7941789B2 (en) 2006-09-29 2011-05-10 Sap Ag Common performance trace mechanism
US8037457B2 (en) 2006-09-29 2011-10-11 Sap Ag Method and system for generating and displaying function call tracker charts
US7640459B2 (en) 2006-09-30 2009-12-29 Sap Ag Performing computer application trace with other operations
US7934208B2 (en) 2006-10-13 2011-04-26 International Business Machines Corporation Method for transparent on-line dynamic binary optimization
US7861042B2 (en) 2006-10-23 2010-12-28 Hewlett-Packard Development Company, L.P. Processor acquisition of ownership of access coordinator for shared resource
US20080104362A1 (en) 2006-10-25 2008-05-01 Buros William M Method and System for Performance-Driven Memory Page Size Promotion
US7954095B2 (en) 2006-11-01 2011-05-31 International Business Machines Corporation Analysis and selection of optimal function implementations in massively parallel computer
US8037471B2 (en) 2006-11-16 2011-10-11 International Business Machines Corporation Systems and methods for constructing relationship specifications from component interactions
WO2008064363A3 (en) 2006-11-22 2008-08-21 Take Two Interactive Software System and method for real-time pose-based deformation of character models
GB0623355D0 (en) 2006-11-23 2007-01-03 Ibm Software tracing
US8032875B2 (en) 2006-11-28 2011-10-04 Oracle America, Inc. Method and apparatus for computing user-specified cost metrics in a data space profiler
CN101595457A (en) 2006-12-06 2009-12-02 艾利森电话股份有限公司 Load balanced profiling
US20080163183A1 (en) 2006-12-29 2008-07-03 Zhiyuan Li Methods and apparatus to provide parameterized offloading on multiprocessor architectures
WO2008080780A1 (en) * 2007-01-05 2008-07-10 International Business Machines Corporation Recording execution information for a software application
US8214807B2 (en) 2007-01-10 2012-07-03 International Business Machines Corporation Code path tracking
US9589115B2 (en) 2007-01-18 2017-03-07 Panasonic Intellectual Property Management Co., Ltd. Obfuscation assisting apparatus
US7500216B1 (en) 2007-02-07 2009-03-03 Altera Corporation Method and apparatus for performing physical synthesis hill-climbing on multi-processor machines
US20080243970A1 (en) 2007-03-30 2008-10-02 Sap Ag Method and system for providing loitering trace in virtual machines
WO2008128476A1 (en) 2007-04-18 2008-10-30 Mediatek Inc. Data access tracing
US8543711B2 (en) * 2007-04-30 2013-09-24 Hewlett-Packard Development Company, L.P. System and method for evaluating a pattern of resource demands of a workload
US20080276129A1 (en) 2007-05-02 2008-11-06 International Business Machines Corporation Software tracing
US8214806B2 (en) 2007-05-09 2012-07-03 International Business Machines Corporation Iterative, non-uniform profiling method for automatically refining performance bottleneck regions in scientific code
US7957934B2 (en) 2007-05-15 2011-06-07 Dynatrace Software Gmbh Method and system for processing application performance data ouside of monitored applications to limit overhead caused by monitoring
US7698602B2 (en) 2007-06-13 2010-04-13 International Business Machines Corporation Systems, methods and computer products for trace capability per work unit
US8132162B2 (en) 2007-07-05 2012-03-06 International Business Machines Corporation Runtime machine analysis of applications to select methods suitable for method level caching
KR20090005921A (en) 2007-07-10 2009-01-14 삼성전자주식회사 Load balancing method and apparatus in symmetric multi-processor system
US8276117B2 (en) 2007-08-03 2012-09-25 International Business Machines Corporation Displaying and refactoring programs that include database statements
US7975262B2 (en) 2007-08-16 2011-07-05 Microsoft Corporation Error tracing with context history
WO2009029357A3 (en) 2007-08-24 2009-07-30 Peter Anthony Crosby Selective monitoring of software applications
US8745606B2 (en) 2007-09-28 2014-06-03 Intel Corporation Critical section ordering for multiple trace applications
US8307343B2 (en) 2007-10-19 2012-11-06 Microsoft Corporation Application and database context correlation for database application developers
US20090125519A1 (en) 2007-11-13 2009-05-14 Intel Corporation Device, system, and method for regulating software lock elision mechanisms
US7430733B1 (en) 2007-11-15 2008-09-30 International Business Machines Corporation Method for validation of binary code transformations
US8826242B2 (en) 2007-11-27 2014-09-02 Microsoft Corporation Data driven profiling for distributed applications
US8527959B2 (en) 2007-12-07 2013-09-03 International Business Machines Corporation Binary programmable method for application performance data collection
US8301755B2 (en) 2007-12-14 2012-10-30 Bmc Software, Inc. Impact propagation in a directed acyclic graph
CN101222328B (en) 2007-12-14 2010-11-03 西安西电捷通无线网络通信股份有限公司 Entity bidirectional identification method
US8495636B2 (en) 2007-12-19 2013-07-23 International Business Machines Corporation Parallelizing single threaded programs by performing look ahead operation on the single threaded program to identify plurality of instruction threads prior to execution
US8225291B2 (en) 2008-01-04 2012-07-17 International Business Machines Corporation Automated detection of application performance bottlenecks
US8234105B1 (en) 2008-01-08 2012-07-31 The Mathworks, Inc. Mapping between code coverage and model coverage for a design
US20090193402A1 (en) 2008-01-28 2009-07-30 Guy Bashkansky Iterative Compilation Supporting Entity Instance-Specific Compiler Option Variations
US20090199047A1 (en) 2008-01-31 2009-08-06 Yahoo! Inc. Executing software performance test jobs in a clustered system
JPWO2009119642A1 (en) 2008-03-26 2011-07-28 日本電気株式会社 Service response performance analysis apparatus, method, program, and recording medium recording it
US8117602B2 (en) 2008-04-01 2012-02-14 Kaspersky Lab, Zao Method and system for monitoring execution performance of software program product
US20090313600A1 (en) 2008-06-13 2009-12-17 Microsoft Corporation Concurrent code generation
US8245200B2 (en) 2008-07-11 2012-08-14 International Business Machines Corporation Method, system, and apparatus for dynamically injecting logging statements into web 2.0 javascript applications
JP5386905B2 (en) 2008-09-25 2014-01-15 富士通セミコンダクター株式会社 Profiling methods and profiling program
US20100115172A1 (en) 2008-11-04 2010-05-06 Mosaid Technologies Incorporated Bridge device having a virtual page buffer
US9117094B2 (en) 2008-10-29 2015-08-25 Microsoft Technology Licensing, Llc Data location obfuscation
US8621184B1 (en) 2008-10-31 2013-12-31 Netapp, Inc. Effective scheduling of producer-consumer processes in a multi-processor system
US7681182B1 (en) 2008-11-06 2010-03-16 International Business Machines Corporation Including function call graphs (FCG) generated from trace analysis data within a searchable problem determination knowledge base
US8423534B2 (en) 2008-11-18 2013-04-16 Teradata Us, Inc. Actively managing resource bottlenecks in a database system
US20100125838A1 (en) 2008-11-19 2010-05-20 Nokia Corporation Method and Apparatus for Optimizing a Program
US20100123717A1 (en) 2008-11-20 2010-05-20 Via Technologies, Inc. Dynamic Scheduling in a Graphics Processor
US9189233B2 (en) 2008-11-24 2015-11-17 Intel Corporation Systems, apparatuses, and methods for a hardware and software system to automatically decompose a program to multiple parallel threads
US8645922B2 (en) 2008-11-25 2014-02-04 Sap Ag System and method of implementing a concurrency profiler
US9875241B2 (en) 2008-12-02 2018-01-23 Ab Initio Technology Llc Visualizing relationships between data elements and graphical representations of data element attributes
US8359581B2 (en) 2008-12-10 2013-01-22 International Business Machines Corporation Automatic collection of diagnostic traces in an automation framework
US8327321B2 (en) 2009-01-31 2012-12-04 Ted J. Biggerstaff Synthetic partitioning for imposing implementation design patterns onto logical architectures of computations
US9323647B2 (en) 2009-02-10 2016-04-26 Sap Se Request-based activation of debugging and tracing
US9076125B2 (en) 2009-02-27 2015-07-07 Microsoft Technology Licensing, Llc Visualization of participant relationships and sentiment for electronic messaging
US8789032B1 (en) 2009-02-27 2014-07-22 Google Inc. Feedback-directed inter-procedural optimization
KR101581001B1 (en) 2009-03-30 2015-12-30 삼성전자주식회사 Dynamic analysis method and apparatus of the program
US20100257019A1 (en) 2009-04-02 2010-10-07 Microsoft Corporation Associating user-defined descriptions with objects
US8595327B2 (en) 2009-04-10 2013-11-26 Microsoft Corporation Obtaining instrumentation data
JP5428075B2 (en) 2009-04-17 2014-02-26 株式会社日立製作所 Performance monitoring system, the bottleneck determination method and the management computer
US8327377B2 (en) 2009-04-30 2012-12-04 Ca, Inc. Detecting, logging and tracking component dependencies in web service transactions
US8327351B2 (en) 2009-04-30 2012-12-04 Sap Ag Application modification framework
US8423973B2 (en) 2009-05-08 2013-04-16 Ca, Inc. Instrumenting an application with flexible tracers to provide correlation data and metrics
US8332854B2 (en) 2009-05-19 2012-12-11 Microsoft Corporation Virtualized thread scheduling for hardware thread optimization based on hardware resource parameter summaries of instruction blocks in execution groups
US20100306854A1 (en) 2009-06-01 2010-12-02 Ab Initio Software Llc Generating Obfuscated Data
CN102460408B (en) 2009-06-01 2014-08-06 惠普开发有限公司 System and method for collecting application performance data
US8352907B2 (en) * 2009-08-10 2013-01-08 International Business Machines Corporation Software application recreation
US8566804B1 (en) 2009-08-13 2013-10-22 The Mathworks, Inc. Scheduling generated code based on target characteristics
EP2290562A1 (en) 2009-08-24 2011-03-02 Amadeus S.A.S. Segmented main-memory stored relational database table system with improved collaborative scan algorithm
US8448142B2 (en) 2009-08-25 2013-05-21 International Business Machines Corporation Incremental runtime compliance validation of renderable objects
US9529694B2 (en) 2009-09-14 2016-12-27 Oracle International Corporation Techniques for adaptive trace logging
KR101645035B1 (en) 2009-09-22 2016-08-16 삼성전자주식회사 Apparatus and Method for controlling parallel programming
US20110078029A1 (en) 2009-09-25 2011-03-31 National Electronics Warranty, Llc Systems and methods for hosting, updating, and sending a webpage
US8856794B2 (en) 2009-10-13 2014-10-07 Empire Technology Development Llc Multicore runtime management using process affinity graphs
US8627300B2 (en) 2009-10-13 2014-01-07 Empire Technology Development Llc Parallel dynamic optimization
US8543907B1 (en) 2009-10-16 2013-09-24 Google Inc. Context-sensitive optimization level selection
US20110098973A1 (en) 2009-10-23 2011-04-28 Computer Associates Think, Inc. Automatic Baselining Of Metrics For Application Performance Management
US8275816B1 (en) 2009-11-06 2012-09-25 Adobe Systems Incorporated Indexing messaging events for seeking through data streams
US8356354B2 (en) 2009-11-23 2013-01-15 Kaspersky Lab, Zao Silent-mode signature testing in anti-malware processing
US8676949B2 (en) 2009-11-25 2014-03-18 Citrix Systems, Inc. Methods for interfacing with a virtualized computing service over a network using a lightweight client
US8490087B2 (en) 2009-12-02 2013-07-16 International Business Machines Corporation System and method for transforming legacy desktop environments to a virtualized desktop model
US8584098B2 (en) 2009-12-04 2013-11-12 Sap Ag Component statistics for application profiling
US8527960B2 (en) 2009-12-04 2013-09-03 Sap Ag Combining method parameter traces with other traces
US20110153603A1 (en) 2009-12-17 2011-06-23 Yahoo! Inc. Time series storage for large-scale monitoring system
US8359584B2 (en) 2009-12-18 2013-01-22 Microsoft Corporation Debugging from a call graph
EP2348418A1 (en) 2009-12-18 2011-07-27 Siemens Aktiengesellschaft Multi trace parser
US20110154289A1 (en) 2009-12-18 2011-06-23 Sandya Srivilliputtur Mannarswamy Optimization of an application program
US9639446B2 (en) * 2009-12-21 2017-05-02 International Business Machines Corporation Trace monitoring
US8336056B1 (en) 2009-12-22 2012-12-18 Gadir Omar M A Multi-threaded system for data management
US8645930B2 (en) 2010-01-04 2014-02-04 Apple Inc. System and method for obfuscation by common function and common function prototype
US8826249B2 (en) 2010-02-18 2014-09-02 Oracle International Corporation Method and system for optimizing code for a multi-threaded application
US20110225458A1 (en) 2010-03-09 2011-09-15 Microsoft Corporation Generating a debuggable dump file for an operating system kernel and hypervisor
US20130132780A1 (en) 2010-03-26 2013-05-23 Software Diagnostics Technology Gmbh Method for Automatically Detecting and Excluding a Tracing Instruction from Further Trace Data Generation for a Software System, a Computer System, and a Computer Program Product
CN102222037B (en) 2010-04-15 2014-04-02 国际商业机器公司 Method and equipment for positioning bottleneck of JAVA program
US9189367B2 (en) 2010-04-20 2015-11-17 Salesforce.Com, Inc. Methods and systems for debugging bytecode in an on-demand service environment
US8522217B2 (en) 2010-04-20 2013-08-27 Microsoft Corporation Visualization of runtime analysis across dynamic boundaries
US8719804B2 (en) 2010-05-05 2014-05-06 Microsoft Corporation Managing runtime execution of applications on cloud computing systems
US8473925B2 (en) 2010-05-11 2013-06-25 Ca, Inc. Conditional dynamic instrumentation of software in a specified transaction context
US8566800B2 (en) 2010-05-11 2013-10-22 Ca, Inc. Detection of method calls to streamline diagnosis of custom code through dynamic instrumentation
US8726240B2 (en) 2010-05-12 2014-05-13 Salesforce.Com, Inc. Capturing replayable information at software defect locations in a multi-tenant environment
WO2011142720A1 (en) 2010-05-14 2011-11-17 Chee Kien Gabriyel Wong A self-organizing and contextual graphical user interface
WO2011146750A3 (en) 2010-05-19 2012-01-26 Google Inc. Bug clearing house
US20110289485A1 (en) 2010-05-21 2011-11-24 International Business Machines Corporation Software Trace Collection and Analysis Utilizing Direct Interthread Communication On A Network On Chip
EP2390790A1 (en) 2010-05-27 2011-11-30 Fujitsu Limited Profiling of software applications
US8844042B2 (en) 2010-06-16 2014-09-23 Microsoft Corporation System state based diagnostic scan
US8966447B2 (en) 2010-06-21 2015-02-24 Apple Inc. Capturing and displaying state of automated user-level testing of a graphical user interface application
US8549532B2 (en) 2010-07-12 2013-10-01 International Business Machines Corporation Parallel checkpointing for migration of workload partitions
US20120042212A1 (en) 2010-08-10 2012-02-16 Gilbert Laurenti Mixed Mode Processor Tracing
US8380812B2 (en) 2010-08-12 2013-02-19 International Business Machines Corporation Source identification for multipart content validation
US8327373B2 (en) 2010-08-24 2012-12-04 Novell, Inc. System and method for structuring self-provisioning workloads deployed in virtualized data centers
US9177041B2 (en) 2010-09-03 2015-11-03 Robert Lewis Jackson, JR. Automated stratification of graph display
US8713163B2 (en) 2010-09-17 2014-04-29 Microsoft Corporation Monitoring cloud-runtime operations
US8972940B2 (en) 2010-09-23 2015-03-03 International Business Machines Corporation Systems and methods for identifying software performance influencers
KR20120031834A (en) 2010-09-27 2012-04-04 삼성전자주식회사 Apparatus and method for instrumentation
CN103180826B (en) 2010-10-25 2017-04-05 起元技术有限责任公司 Managing sets of data objects in the data flow diagram representative of computer program
US9015676B2 (en) 2010-10-29 2015-04-21 International Business Machines Corporation Varying removal of internal breakpoints during debugging of code
US8583978B2 (en) 2010-11-09 2013-11-12 Cisco Technology, Inc. Multicast message retransmission
US8938720B2 (en) 2010-11-30 2015-01-20 Sap Se Trace visualization for object oriented programs
US20120151396A1 (en) 2010-12-09 2012-06-14 S Ramprasad Rendering an optimized metrics topology on a monitoring tool
US8997056B2 (en) 2010-12-15 2015-03-31 Hewlett-Packard Development Company, L. P. Directed graphs pertaining to read/write operations
KR101786871B1 (en) 2010-12-17 2017-11-15 한국전자통신연구원 Apparatus for processing remote page fault and method thereof
US8843852B2 (en) 2010-12-17 2014-09-23 Orca Health, Inc. Medical interface, annotation and communication systems
US20120159454A1 (en) * 2010-12-20 2012-06-21 Microsoft Corporation Probe insertion via background virtual machine
US8863138B2 (en) 2010-12-22 2014-10-14 Intel Corporation Application service performance in cloud computing
CN102567115B (en) * 2010-12-23 2016-04-06 伊姆西公司 Method and apparatus for cloud system resource allocation and utilization of information technology tracked
US9459983B2 (en) 2010-12-31 2016-10-04 Open Invention Network, Llc Method and apparatus of establishing customized network monitoring criteria
US8756581B2 (en) 2011-02-03 2014-06-17 International Business Machines Corporation Adaptive next-executing-cycle trace selection for trace-driven code optimizers
US9137136B2 (en) 2011-02-04 2015-09-15 Riverbed Technology, Inc. Overhead management for event tracing
GB201315674D0 (en) 2011-02-23 2013-10-16 Bottlenose Inc System and method for analyzing messages in a network or across networks
US8988998B2 (en) 2011-02-25 2015-03-24 International Business Machines Corporation Data processing environment integration control
US8756310B2 (en) 2011-03-09 2014-06-17 International Business Machines Corporation Comprehensive bottleneck detection in a multi-tier enterprise storage system
US20120246303A1 (en) 2011-03-23 2012-09-27 LogRhythm Inc. Log collection, structuring and processing
JP5874891B2 (en) 2011-03-30 2016-03-02 日本電気株式会社 Program test equipment, program testing method, and program
US20120254266A1 (en) 2011-03-31 2012-10-04 Oracle International Corporation Numa-aware garbage collection
US9170917B2 (en) 2011-04-01 2015-10-27 Paypal, Inc. Flow tracing though diverse logical and physical application and infrastructure layers/dependencies
US8380838B2 (en) 2011-04-08 2013-02-19 International Business Machines Corporation Reduction of alerts in information technology systems
US8438427B2 (en) 2011-04-08 2013-05-07 Ca, Inc. Visualizing relationships between a transaction trace graph and a map of logical subsystems
US20120266143A1 (en) * 2011-04-12 2012-10-18 Microsoft Corporation Resource cost correlation across different subsystems
US9165029B2 (en) 2011-04-12 2015-10-20 Microsoft Technology Licensing, Llc Navigating performance data from different subsystems
CA2775427A1 (en) 2011-04-27 2012-10-27 Perspecsys Inc. System and method of data interception and conversion in a proxy
US9032375B2 (en) 2011-04-27 2015-05-12 International Business Machines Corporation Performance bottleneck identification tool
US8856767B2 (en) 2011-04-29 2014-10-07 Yahoo! Inc. System and method for analyzing dynamic performance of complex applications
US9015311B2 (en) 2011-05-24 2015-04-21 Citrix Systems, Inc. Systems and methods for analyzing network metrics
US8533698B2 (en) 2011-06-13 2013-09-10 Microsoft Corporation Optimizing execution of kernels
KR101265099B1 (en) 2011-06-15 2013-05-20 주식회사 터보테크 Software security processing method and storage medium
US8756171B2 (en) 2011-06-15 2014-06-17 International Business Machines Corporation Generating predictions from a probabilistic process model
US8832775B2 (en) 2011-06-17 2014-09-09 Novell, Inc. Techniques for workload spawning
US20120330700A1 (en) * 2011-06-22 2012-12-27 International Business Machines Corporation Application placement among a set of consolidation servers utilizing license cost and application workload profiles as factors
US9015668B1 (en) 2011-08-10 2015-04-21 Interactive TKO, Inc. Instrumentation agent for manipulating component responses in a test
US8909996B2 (en) 2011-08-12 2014-12-09 Oracle International Corporation Utilizing multiple storage devices to reduce write latency for database logging
US20130086564A1 (en) 2011-08-26 2013-04-04 Cognitive Electronics, Inc. Methods and systems for optimizing execution of a program in an environment having simultaneously parallel and serial processing capability
US8621439B2 (en) 2011-09-06 2013-12-31 Microsoft Corporation Modern application tracing
US8312056B1 (en) 2011-09-13 2012-11-13 Xerox Corporation Method and system for identifying a key influencer in social media utilizing topic modeling and social diffusion analysis
US8918764B2 (en) 2011-09-21 2014-12-23 International Business Machines Corporation Selective trace facility
US9203894B1 (en) 2011-09-26 2015-12-01 Emc Corporation Methods and systems for building an application execution map
US9497136B1 (en) 2011-09-28 2016-11-15 Emc Corporation Method and system for providing usage metrics to manage utilzation of cloud computing resources
US8677331B2 (en) 2011-09-30 2014-03-18 Oracle International Corporation Lock-clustering compilation for software transactional memory
US8745591B2 (en) 2011-10-19 2014-06-03 Microsoft Corporation Data flow visualization and debugging
US20130145350A1 (en) 2011-12-05 2013-06-06 Microsoft Corporation Efficient, large scale trace storage system
US8732291B2 (en) 2012-01-13 2014-05-20 Accenture Global Services Limited Performance interference model for managing consolidated workloads in QOS-aware clouds
US20130185729A1 (en) 2012-01-13 2013-07-18 Rutgers, The State University Of New Jersey Accelerating resource allocation in virtualized environments using workload classes and/or workload signatures
US8819653B2 (en) 2012-01-30 2014-08-26 Cisco Technology, Inc. Automated improvement of executable applications based on evaluating independent execution heuristics
KR20130093995A (en) 2012-02-15 2013-08-23 한국전자통신연구원 Method for performance optimization of hierarchical multi-core processor and the multi-core processor system of performing the method
US9251039B2 (en) 2012-02-17 2016-02-02 Microsoft Technology Licensing, Llc Remote debugging as a service
US9396037B2 (en) 2012-02-27 2016-07-19 Microsoft Technology Licensing, Llc Model-based data pipeline system optimization
US9608893B2 (en) 2012-02-27 2017-03-28 The Boeing Company Methods and systems for parsing data objects
US9058198B2 (en) 2012-02-29 2015-06-16 Red Hat Inc. System resource sharing in a multi-tenant platform-as-a-service environment in a cloud computing system
US9170798B2 (en) 2012-03-02 2015-10-27 Vmware, Inc. System and method for customizing a deployment plan for a multi-tier application in a cloud infrastructure
US9032369B2 (en) 2012-03-26 2015-05-12 Software Ag Systems and/or methods for executing appropriate tests based on code modifications using live, distributed, real-time cache and feedback loop
US8495598B2 (en) 2012-05-01 2013-07-23 Concurix Corporation Control flow graph operating system configuration
US8650538B2 (en) 2012-05-01 2014-02-11 Concurix Corporation Meta garbage collection for functional code
US20120222043A1 (en) 2012-05-01 2012-08-30 Concurix Corporation Process Scheduling Using Scheduling Graph to Minimize Managed Elements
US8615766B2 (en) 2012-05-01 2013-12-24 Concurix Corporation Hybrid operating system
US8595743B2 (en) 2012-05-01 2013-11-26 Concurix Corporation Network aware process scheduling
US8726255B2 (en) 2012-05-01 2014-05-13 Concurix Corporation Recompiling with generic to specific replacement
US9417935B2 (en) 2012-05-01 2016-08-16 Microsoft Technology Licensing, Llc Many-core process scheduling to maximize cache usage
US20120324454A1 (en) 2012-05-04 2012-12-20 Concurix Corporation Control Flow Graph Driven Operating System
WO2013184133A1 (en) 2012-06-08 2013-12-12 Hewlett-Packard Development Company, L.P. Cloud application deployment portability
EP2859439A4 (en) 2012-06-08 2016-03-30 Hewlett Packard Development Co Cloud application deployment
US8881125B2 (en) 2012-06-11 2014-11-04 International Business Machines Corporation Indirect software performance analysis
US9146767B2 (en) 2012-06-19 2015-09-29 Raytheon Company Secure cloud hypervisor monitor
US20120317421A1 (en) 2012-06-19 2012-12-13 Concurix Corporation Fingerprinting Executable Code
US9047196B2 (en) 2012-06-19 2015-06-02 Concurix Corporation Usage aware NUMA process scheduling
US8700838B2 (en) 2012-06-19 2014-04-15 Concurix Corporation Allocating heaps in NUMA systems
CN102789409A (en) 2012-06-29 2012-11-21 惠州市德赛西威汽车电子有限公司 Embedded system automation module test method on basis of data communication monitoring
US8707326B2 (en) 2012-07-17 2014-04-22 Concurix Corporation Pattern matching process scheduler in message passing environment
US9575813B2 (en) 2012-07-17 2017-02-21 Microsoft Technology Licensing, Llc Pattern matching process scheduler with upstream optimization
US8793669B2 (en) 2012-07-17 2014-07-29 Concurix Corporation Pattern extraction from executable code in message passing environments
CN104488291A (en) 2012-07-27 2015-04-01 诺基亚公司 Methods and apparatuses for facilitating utilization of cloud services
US9152532B2 (en) 2012-08-07 2015-10-06 Advanced Micro Devices, Inc. System and method for configuring a cloud computing system with a synthetic test workload
US9262231B2 (en) 2012-08-07 2016-02-16 Advanced Micro Devices, Inc. System and method for modifying a hardware configuration of a cloud computing system
US9043788B2 (en) 2012-08-10 2015-05-26 Concurix Corporation Experiment manager for manycore systems
US20130080760A1 (en) 2012-08-10 2013-03-28 Concurix Corporation Execution Environment with Feedback Loop
US8966462B2 (en) 2012-08-10 2015-02-24 Concurix Corporation Memory management parameters derived from system modeling
US9003381B2 (en) 2012-08-14 2015-04-07 Derek J. Conrod Context-specific optimized code
US9135093B2 (en) 2012-08-31 2015-09-15 Sap Se Event-driven approach for collecting monitoring data of messaging systems
US8789030B2 (en) 2012-09-18 2014-07-22 Concurix Corporation Memoization from offline analysis
US20130085882A1 (en) 2012-09-18 2013-04-04 Concurix Corporation Offline Optimization of Computer Software
US9122841B2 (en) 2012-10-16 2015-09-01 Sap Se Providing remote application logs for cloud applications
US9378059B2 (en) 2012-10-19 2016-06-28 Argyle Data, Inc. Multi-threaded, lockless data parallelization
US8694574B2 (en) 2012-11-08 2014-04-08 Concurix Corporation Optimized settings in a configuration database with boundaries
US8752034B2 (en) 2012-11-08 2014-06-10 Concurix Corporation Memoization configuration file consumed at runtime
US20130074057A1 (en) 2012-11-08 2013-03-21 Concurix Corporation Selecting Functions for Memoization Analysis
US8656378B2 (en) 2012-11-08 2014-02-18 Concurix Corporation Memoization configuration file consumed at compile time
US9262416B2 (en) 2012-11-08 2016-02-16 Microsoft Technology Licensing, Llc Purity analysis using white list/black list analysis
US8752021B2 (en) 2012-11-08 2014-06-10 Concurix Corporation Input vector analysis for memoization estimation
US8656134B2 (en) 2012-11-08 2014-02-18 Concurix Corporation Optimized memory configuration deployed on executing code
US8656135B2 (en) 2012-11-08 2014-02-18 Concurix Corporation Optimized memory configuration deployed prior to execution
US8607018B2 (en) 2012-11-08 2013-12-10 Concurix Corporation Memory usage configuration based on observations
US8826254B2 (en) 2012-11-08 2014-09-02 Concurix Corporation Memoizing with read only side effects
US8839204B2 (en) 2012-11-08 2014-09-16 Concurix Corporation Determination of function purity for memoization
CN104813612A (en) 2012-11-28 2015-07-29 惠普发展公司,有限责任合伙企业 Determining at least one cost factor associated with using cloud to provide application component
US9021262B2 (en) 2013-01-25 2015-04-28 Concurix Corporation Obfuscating trace data
US9207969B2 (en) 2013-01-25 2015-12-08 Microsoft Technology Licensing, Llc Parallel tracing for performance and detail
US20140025572A1 (en) 2013-01-25 2014-01-23 Concurix Corporation Tracing as a Service
US8954546B2 (en) 2013-01-25 2015-02-10 Concurix Corporation Tracing with a workload distributor
US9135145B2 (en) 2013-01-28 2015-09-15 Rackspace Us, Inc. Methods and systems of distributed tracing
US9658941B2 (en) 2013-01-28 2017-05-23 Rackspace Us, Inc. Methods and systems of function-specific tracing
US20140019879A1 (en) 2013-02-01 2014-01-16 Concurix Corporation Dynamic Visualization of Message Passing Computation
US20130232433A1 (en) 2013-02-01 2013-09-05 Concurix Corporation Controlling Application Tracing using Dynamic Visualization
US20130232452A1 (en) 2013-02-01 2013-09-05 Concurix Corporation Force Directed Graph with Time Series Data
US9256969B2 (en) 2013-02-01 2016-02-09 Microsoft Technology Licensing, Llc Transformation function insertion for dynamically displayed tracer data
US9323863B2 (en) 2013-02-01 2016-04-26 Microsoft Technology Licensing, Llc Highlighting of time series data on force directed graph
US8924941B2 (en) 2013-02-12 2014-12-30 Concurix Corporation Optimization analysis using similar frequencies
US9021447B2 (en) 2013-02-12 2015-04-28 Concurix Corporation Application tracing by distributed objectives
US20130283281A1 (en) 2013-02-12 2013-10-24 Concurix Corporation Deploying Trace Objectives using Cost Analyses
US20130283102A1 (en) 2013-02-12 2013-10-24 Concurix Corporation Deployment of Profile Models with a Monitoring Agent
US8843901B2 (en) 2013-02-12 2014-09-23 Concurix Corporation Cost analysis for selecting trace objectives
US8997063B2 (en) 2013-02-12 2015-03-31 Concurix Corporation Periodicity optimization in an automated tracing system
US9665474B2 (en) 2013-03-15 2017-05-30 Microsoft Technology Licensing, Llc Relationships derived from trace data
US9575874B2 (en) 2013-04-20 2017-02-21 Microsoft Technology Licensing, Llc Error list and bug report analysis for configuring an application tracer
US20140317603A1 (en) 2013-04-20 2014-10-23 Concurix Corporation Multiple Tracer Configurations Applied on a Function-by-Function Level
US20140317604A1 (en) 2013-04-20 2014-10-23 Concurix Corporation Real Time Analysis of Tracer Summaries to Change Tracer Behavior
US20130283242A1 (en) 2013-04-20 2013-10-24 Concurix Corporation Tracing Closures in a Callback Environment
US20140013306A1 (en) 2013-04-20 2014-01-09 Concurix Corporation Computer Load Generator Marketplace
US20130282545A1 (en) 2013-04-20 2013-10-24 Concurix Corporation Marketplace for Monitoring Services
US8978016B2 (en) 2013-04-20 2015-03-10 Concurix Corporation Error list and bug report analysis for configuring an application tracer
US20140013308A1 (en) 2013-04-20 2014-01-09 Concurix Corporation Application Development Environment with Services Marketplace
US8966452B2 (en) 2013-04-20 2015-02-24 Concurix Corporation User interaction analysis of tracer data for configuring an application tracer
US9021445B2 (en) 2013-04-20 2015-04-28 Concurix Corporation Tracer list for automatically controlling tracer behavior
US20140189650A1 (en) 2013-05-21 2014-07-03 Concurix Corporation Setting Breakpoints Using an Interactive Graph Representing an Application
US9734040B2 (en) 2013-05-21 2017-08-15 Microsoft Technology Licensing, Llc Animated highlights in a graph representing an application
US8990777B2 (en) 2013-05-21 2015-03-24 Concurix Corporation Interactive graph for navigating and monitoring execution of application code
US20140189652A1 (en) 2013-05-21 2014-07-03 Concurix Corporation Filtering and Transforming a Graph Representing an Application
US9547599B2 (en) 2013-07-26 2017-01-17 Futurewei Technologies, Inc. System and method for predicting false sharing
US9311213B2 (en) 2013-09-04 2016-04-12 Microsoft Technology Licensing, Llc Module database with tracing options
US9298588B2 (en) 2013-09-04 2016-03-29 Microsoft Technology Licensing, Llc Tracing system for application and module tracing
US9292415B2 (en) 2013-09-04 2016-03-22 Microsoft Technology Licensing, Llc Module specific tracing in a shared module environment
CN105765528A (en) 2013-11-13 2016-07-13 微软技术许可有限责任公司 Application execution path tracing with configurable origin definition
US9459849B2 (en) 2014-01-17 2016-10-04 International Business Machines Corporation Adaptive cloud aware just-in-time (JIT) compilation

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6230313B1 (en) * 1998-12-23 2001-05-08 Cray Inc. Parallelism performance analysis based on execution trace information
US20060037022A1 (en) * 2004-08-10 2006-02-16 Byrd Stephen A Apparatus, system, and method for automatically discovering and grouping resources used by a business process
US20060174165A1 (en) * 2005-02-03 2006-08-03 Cisco Technology, Inc. System and method for tracing and logging for software module
US20060190596A1 (en) * 2005-02-18 2006-08-24 Nec Corporation Bottleneck detection system, measurement object server, bottleneck detection method and program
US20060224375A1 (en) * 2005-03-11 2006-10-05 Barnett Paul T Method for building enterprise scalability models from load test and trace test data
US20080312980A1 (en) * 2007-06-13 2008-12-18 International Business Machines Corporation Method and system for staffing and cost estimation models aligned with multi-dimensional project plans for packaged software applications
US20110004443A1 (en) * 2008-02-22 2011-01-06 Takashi Horikawa It system behavior measurement and analysis system and method thereof
US20120017123A1 (en) * 2010-07-16 2012-01-19 International Business Machines Corporation Time-Based Trace Facility
US20120060142A1 (en) * 2010-09-02 2012-03-08 Code Value Ltd. System and method of cost oriented software profiling

Cited By (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9286042B2 (en) 2012-05-01 2016-03-15 Microsoft Technology Licensing, Llc Control flow graph application configuration
US9417935B2 (en) 2012-05-01 2016-08-16 Microsoft Technology Licensing, Llc Many-core process scheduling to maximize cache usage
US9047196B2 (en) 2012-06-19 2015-06-02 Concurix Corporation Usage aware NUMA process scheduling
US8793669B2 (en) 2012-07-17 2014-07-29 Concurix Corporation Pattern extraction from executable code in message passing environments
US9747086B2 (en) 2012-07-17 2017-08-29 Microsoft Technology Licensing, Llc Transmission point pattern extraction from executable code in message passing environments
US9575813B2 (en) 2012-07-17 2017-02-21 Microsoft Technology Licensing, Llc Pattern matching process scheduler with upstream optimization
US9043788B2 (en) 2012-08-10 2015-05-26 Concurix Corporation Experiment manager for manycore systems
US9207969B2 (en) 2013-01-25 2015-12-08 Microsoft Technology Licensing, Llc Parallel tracing for performance and detail
US8954546B2 (en) 2013-01-25 2015-02-10 Concurix Corporation Tracing with a workload distributor
US9021262B2 (en) 2013-01-25 2015-04-28 Concurix Corporation Obfuscating trace data
US9256969B2 (en) 2013-02-01 2016-02-09 Microsoft Technology Licensing, Llc Transformation function insertion for dynamically displayed tracer data
US9323863B2 (en) 2013-02-01 2016-04-26 Microsoft Technology Licensing, Llc Highlighting of time series data on force directed graph
US9658936B2 (en) 2013-02-12 2017-05-23 Microsoft Technology Licensing, Llc Optimization analysis using similar frequencies
US9804949B2 (en) * 2013-02-12 2017-10-31 Microsoft Technology Licensing, Llc Periodicity optimization in an automated tracing system
US9021447B2 (en) 2013-02-12 2015-04-28 Concurix Corporation Application tracing by distributed objectives
US9767006B2 (en) 2013-02-12 2017-09-19 Microsoft Technology Licensing, Llc Deploying trace objectives using cost analyses
US8997063B2 (en) * 2013-02-12 2015-03-31 Concurix Corporation Periodicity optimization in an automated tracing system
US20160077951A1 (en) * 2013-02-12 2016-03-17 Microsoft Technology Licensing, Llc Periodicity optimization in an automated tracing system
US20130283102A1 (en) * 2013-02-12 2013-10-24 Concurix Corporation Deployment of Profile Models with a Monitoring Agent
US8924941B2 (en) 2013-02-12 2014-12-30 Concurix Corporation Optimization analysis using similar frequencies
US8843901B2 (en) * 2013-02-12 2014-09-23 Concurix Corporation Cost analysis for selecting trace objectives
US20130283246A1 (en) * 2013-02-12 2013-10-24 Concurix Corporation Cost Analysis for Selecting Trace Objectives
US20130283241A1 (en) * 2013-02-12 2013-10-24 Concurix Corporation Periodicity Optimization in an Automated Tracing System
US9436589B2 (en) 2013-03-15 2016-09-06 Microsoft Technology Licensing, Llc Increasing performance at runtime from trace data
US9323651B2 (en) 2013-03-15 2016-04-26 Microsoft Technology Licensing, Llc Bottleneck detector for executing applications
US9665474B2 (en) 2013-03-15 2017-05-30 Microsoft Technology Licensing, Llc Relationships derived from trace data
US9323652B2 (en) 2013-03-15 2016-04-26 Microsoft Technology Licensing, Llc Iterative bottleneck detector for executing applications
US9864676B2 (en) 2013-03-15 2018-01-09 Microsoft Technology Licensing, Llc Bottleneck detector application programming interface
US9575874B2 (en) 2013-04-20 2017-02-21 Microsoft Technology Licensing, Llc Error list and bug report analysis for configuring an application tracer
US9658943B2 (en) 2013-05-21 2017-05-23 Microsoft Technology Licensing, Llc Interactive graph for navigating application code
US9734040B2 (en) 2013-05-21 2017-08-15 Microsoft Technology Licensing, Llc Animated highlights in a graph representing an application
US9754396B2 (en) 2013-07-24 2017-09-05 Microsoft Technology Licensing, Llc Event chain visualization of performance data
US9864672B2 (en) 2013-09-04 2018-01-09 Microsoft Technology Licensing, Llc Module specific tracing in a shared module environment
US9772927B2 (en) 2013-11-13 2017-09-26 Microsoft Technology Licensing, Llc User interface for selecting tracing origins for aggregating classes of trace data
US9262274B2 (en) * 2013-12-24 2016-02-16 International Business Machines Corporation Persistent data across reboots
US20150178168A1 (en) * 2013-12-24 2015-06-25 International Business Machines Corporation Persistent Data Across Reboots

Also Published As

Publication number Publication date Type
CN105122234A (en) 2015-12-02 application
EP2956867A1 (en) 2015-12-23 application
EP2956867A4 (en) 2016-10-12 application
WO2014126603A1 (en) 2014-08-21 application
US9767006B2 (en) 2017-09-19 grant
US20150347273A1 (en) 2015-12-03 application

Similar Documents

Publication Publication Date Title
Vasić et al. Dejavu: accelerating resource allocation in virtualized environments
Kondo et al. The failure trace archive: Enabling comparative analysis of failures in diverse distributed systems
Novakovic et al. Deepdive: Transparently identifying and managing performance interference in virtualized environments
Geimer et al. Scalable parallel trace-based performance analysis
Herodotou et al. No one (cluster) size fits all: automatic cluster sizing for data-intensive analytics
US20090199196A1 (en) Automatic baselining of resource consumption for transactions
US7685251B2 (en) Method and apparatus for management of virtualized process collections
Maruster et al. Process mining: Discovering direct successors in process logs
Wang et al. Statistical techniques for online anomaly detection in data centers
US20080320269A1 (en) Method and apparatus for ranking of target server partitions for virtual server mobility operations
US20130074093A1 (en) Optimized Memory Configuration Deployed Prior to Execution
US20080320123A1 (en) Process and methodology for generic analysis of metrics related to resource utilization and performance
US20130073604A1 (en) Optimized Settings in a Configuration Database with Boundaries
US8607018B2 (en) Memory usage configuration based on observations
US20130074092A1 (en) Optimized Memory Configuration Deployed on Executing Code
US20120331439A1 (en) Software development automated analytics
Dean et al. Ubl: Unsupervised behavior learning for predicting performance anomalies in virtualized cloud systems
US8762951B1 (en) Apparatus and method for profiling system events in a fine grain multi-threaded multi-core processor
US20140359624A1 (en) Determining a completion time of a job in a distributed network environment
US20090177642A1 (en) Method and system for automated detection of application performance bottlenecks
Cherkasova et al. Automated anomaly detection and performance modeling of enterprise applications
US20130111267A1 (en) Optimizing regression testing based on code coverage analysis
US20120060142A1 (en) System and method of cost oriented software profiling
US20090249298A1 (en) Evaluation of Software based on Change History
Cotroneo et al. Software aging analysis of the linux operating system

Legal Events

Date Code Title Description
AS Assignment

Owner name: CONCURIX CORPORATION, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KRAJEC, RUSSELL S.;LI, YING;SIGNING DATES FROM 20130213 TO 20130214;REEL/FRAME:030243/0851

AS Assignment

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CONCURIX CORPORATION;REEL/FRAME:036139/0069

Effective date: 20150612