Abstract: An administrator agent and local worker agents are provided in nodes of a distributed system to support dynamic tracing of runtime data. Trace profiles are associated with the nodes on which the local worker agents reside. The local worker agents monitor the runtime data for an error, and the administrator agent adjusts the trace profile(s) in response to the error(s). The administrator agent sends the adjusted trace profile(s) to the local worker agents, so as to enable trace output data of traces performed by the nodes to be increased or decreased.

Abstract: An instrumentation analysis system processes data streams by executing instructions specified using a data stream language program. A user interface allows users to specify data stream language programs. The user interface presents widgets to the user to specify various components of a data stream language program, including a filter expression, an analytical function representing an aggregation or transformation, and so on. The user interface allows users to specify an expression based on results of previously specified data stream language programs. The instrumentation analysis system processes the data stream language programs specified by the user to generate a set of result data streams and plots the result data streams, for example, on a screen of a client device.

Abstract: The current document is directed to methods and systems that employ call traces collected by one or more call-trace services to generate call-trace-classification rules to facilitate root-cause analysis of distributed-application operational problems and failures. In a described implementation, a set of automatically labeled call traces is partitioned by the generated call-trace-classification rules. Call-trace-classification-rule generation is constrained to produce relatively simple rules with greater-than-threshold confidences and coverages. The call-trace-classification rules may point to particular services and service failures, which provides useful information to distributed-application and distributed-computer-system managers and administrators attempting to diagnose operational problems and failures that arise during execution of distributed applications within distributed computer systems.

Abstract: The current document is directed to methods and systems that employ call traces collected by one or more call-trace services to generate call-trace-classification rules to facilitate root-cause analysis of distributed-application operational problems and failures. In a described implementation, a set of automatically labeled call traces is partitioned by the generated call-trace-classification rules. Call-trace-classification-rule generation is constrained to produce relatively simple rules with greater-than-threshold confidences and coverages. The call-trace-classification rules may point to particular services and service failures, which provides useful information to distributed-application and distributed-computer-system managers and administrators attempting to diagnose operational problems and failures that arise during execution of distributed applications within distributed computer systems.

Abstract: The present application relates to managing memory of a KLL sketch for a streaming set. A computer system allocates an initial amount of memory from a computer memory to a buffer of a KLL sketch data structure based on a sparse sketch size independent of a data type of the streaming set. The system allocates an incremental amount of memory greater than or equal to the initial amount of memory from the computer memory to the buffer in response to a size of the streaming set exceeding a supported stream size of the KLL sketch data structure. The system determines a number of levels of the KLL sketch data structure based on a total allocated amount of memory and a size of the data type of the streaming set. The system adds new elements from the streaming set to the KLL sketch data structure based on the number of levels.

Abstract: A system and method for near-real-time communicating negative user experience of users interacting with a website are provided. The method includes identifying at least one interaction pattern by analyzing an in-page interaction information of a user interacting with at least one page of the website; computing a user experience score for each of the at least one identified interaction pattern; generating an alert indicating that the user experience score determined for a respective identified interaction pattern demonstrates a negative user experience; and sending the alert immediately upon identifying the interaction pattern demonstrating a negative user experience.

Abstract: Systems and methods for software management are described. One or more embodiments of the present disclosure receive first organization data about a first organization that uses a first software system and second organization data about a second organization that uses a second software system; receive first event data from the first organization and second event data from the second organization; generate first converted event data and second converted event data by converting the first event data and the second event data to a common data format; predict organization output based on using the first software system and based on using the second software system; compute a first rating for the first software system and a second rating for the second software system for use in the third organization; and installing the first software system in a computer system of a third organization based on the first rating.

Abstract: A method of analyzing a performance of a microservices-based application comprises generating a plurality of traces from a plurality of spans associated with the microservices-based application. The method also comprises generating a plurality of data sets each associated with a respective analysis mode of a plurality of analysis modes using the plurality of traces, wherein each analysis mode extracts a different level of detail for analyzing the performance of the services in the application from the plurality of spans. Further, the method comprises selecting, based on a first user query, a first analysis mode from the plurality of analysis modes for generating a response to the first user query. The method also comprises accessing a data set of the plurality of data sets that is associated with the first analysis mode and generating the response to the first user query using the data set associated with the first analysis mode.

Abstract: Automatic identification of execution behavior(s) of software. This automatic identification is based on analysis of historical execution records using machine learning to identify a particular pattern that corresponds to an execution behavior. In order to automatically identify an execution behavior present within particular software, an execution record of that particular software is accessed. The execution record includes an execution trace that reproducibly represents the execution of the software within a particular execution environment, such that the execution record is usable to rerun the execution of the software precisely as the software previously run. Based on finding the particular pattern within the execution record, the computing system automatically identifies that the execution behavior is present within the software.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for presenting I/O write records. The method includes: obtaining I/O write records for a file system within a time period; dividing the time period into a plurality of consecutive sub-time-periods based on a predetermined time interval; determining a plurality of I/O write numbers associated with the plurality of sub-time-periods based on the I/O write records; and graphically presenting the plurality of I/O write numbers in chronological order. Using the technical solution of the present disclosure, changes in the I/O write numbers over time can be presented to a user in a chronological, intuitive, and easily recognizable manner, so that the user can easily find a changing law of the I/O write numbers over time, and can further select data protection forms and schedules to be adopted, thereby improving user experience of the user with needs for data analysis and data protection.

Abstract: The discussion relates to automatically providing information about what code sequences contribute to a length of time a program takes to execute. One example can collect context switch and ready thread event tracing data from a program over a period of interest and identify time blocks of program threads from the period of interest. The example can distinguish individual time blocks that contribute to execution time for the period of interest from other individual time blocks that do not contribute to the execution time.

Abstract: A computer-implemented method for propagating queries across a plurality of datasources that includes receiving user input via an administrative user interface. The input at least in part defines a plurality of asset paths within the datasources. A plurality of adapters corresponding to the datasources is automatically invoked and the input is automatically consolidated via the adapters for collective invocation in response to queries. A search query is received via an application user interface and the datasources are automatically queried at least in part by invoking the adapters and passing the input and the search query to the adapters. Responsive results for the search query from at least one of the datasources are automatically presented at an end user computing device.

Abstract: Diffing a subject replayable trace against a plurality of comparison replayable traces includes identifying a set of mappings among the comparison replayable traces, each identifying corresponding comparison sections of consecutive instructions recorded in the comparison replayable traces that execute equivalently. A plurality of distinct comparison sections are identified within the comparison replayable traces. Each of a plurality of subject sections within the subject trace is compared against distinct comparison section(s) to determine a comparison status for each subject section, including whether each subject section is (i) equal to at least one corresponding distinct comparison section, or (ii) different than the distinct comparison sections.

Abstract: Techniques for visualizing dependent relationships in computer program analysis trace elements are described. A code analysis service analyzes computer code associated with a software application for at least one of errors or policy violations. The service outputs a trace log identifying a path within the computer code that results in an error or policy violation. The trace log includes a set of trace elements each corresponding to a line of the computer code. The output is displayed as a tree data structure including nodes. The nodes may include indentations indicating dependent relationships between and among variables initialized at lines in the computer code corresponding to the nodes. Alternatively, the nodes may be arranged as a hierarchy with edges connecting adjacent nodes, and nodes at different levels indicating dependent relationships. The tree data structure may include annotations providing additional contextual information about the actions performed at each node.

Abstract: Aspects of the invention include a computer-implemented method by executing, via a processor, a bottleneck model training process for microservices in a microservice system, wherein for each of the microservices the bottleneck model training process filters out a subset of training data based at least in part on a current situation setting. Building, via the processor, a bottleneck indicator model for each of the microservices using information from the bottleneck model training process, convergence points for an expected response time. Executing, via the processor, a bottleneck identification process for providing system alerts when a bottleneck is identified, wherein the bottleneck identification process uses analysis to monitor a data stream according to the bottleneck indicator model which uses the convergence points for response times.

Abstract: Methods, systems, and apparatus, for defining and monitoring an event for a physical entity and the performance of an action in response to the occurrence of the event. A method includes receiving data indicating an event for a physical entity, the event specified in part by a physical environment feature for which the occurrence of the event is to be monitored by the data processing apparatus; receiving data indicating an action associated with the event and to be taken in response to the occurrence of the event; monitoring for the occurrence of the event for the physical entity; and in response to the occurrence of the event, causing the action associated with the event to be performed.

Abstract: Functionality is provided for profiling code by unwinding stacks in frame-pointer omitted executables using C++ exception stack unwinding information. Information is extracted from executable files, and used to optimize stack unwinding operations. In at least one embodiment, the system uses information that has been included for exception handling. Storage of such information can be optimized by exploiting patterns in stack deltas.

Abstract: Disclosed techniques relate to tracing a subsidiary thread of a web page application. In an example, a method includes providing a web page application to a web browser. The method further includes creating, from the web page application, a global tracer configured to log tracing data for the web page application and a span. The method further includes instantiating, from the web page application, a wrapper for a subsidiary thread. The wrapper is configured to execute shim code before executing the subsidiary thread. The method further includes passing, from the wrapper to the shim code, configuration data of the global tracer. The method further includes creating a subsidiary tracer from the shim code and the configuration data. The subsidiary tracer configured to log tracing data for the subsidiary thread and a thread span.

Abstract: Embodiments of the present disclosure describe selective discovery, management, and deletion of personal data. The method accesses a set of data on a networked resource. The data is formed of a plurality of data elements which are arranged in at least one data table. The method identifies one or more sensitive data elements within the set of data related to one or more individuals. The method determines a sensitivity level of the one or more sensitive data elements and generates a catalogue including at least one new data element representative of the one or more sensitive data elements and based on the sensitivity level of the one or more sensitive data elements. The method tags the one or more sensitive data elements within the catalogue based on the sensitivity level of the one or more sensitive data elements corresponding to the new data element.

Abstract: An example memory sub-system to receive a request to execute a read operation associated with data of a memory unit of a memory sub-system. A time after program associated with the data is determined. The time after program is compared to a threshold time level to determine if a first condition is satisfied or a second condition is satisfied. The memory sub-system selects one of a first set of read offset values based on the time after program in response to satisfying the first condition, or a second set of read offset values based on a data state metric measurement in response to satisfying the second condition.

Abstract: Methods and systems for providing distributed tracing for application performance monitoring utilizing a distributed search engine in a microservices architecture. An example method comprises providing a user interface (UI) including a distributed trace indicating in real time the services invoked to serve an incoming HTTP request including dependent services, the UI further including, in a single view, associated execution times for the services and dependent services shown as a timeline waterfall. The distributed trace automatically propagates a trace ID to link services end-to-end in real time until a response to the request is served. Spans associated with the services and dependent can be compressed using various techniques provided for herein.

Abstract: An information processing apparatus includes: a memory and a processor. The processor, coupled to the memory, is configured to: determine, for each task of a plurality of tasks executed in a distributed stream data processing platform, a log score based on an indication associated with easiness of occurrence of a failure; and output a log message for each task of the plurality of tasks at an output frequency based on a log score of each task and a log score of at least one of an upstream task located upstream of each task and a downstream task located downstream of each task.

Abstract: Aspect of the present disclosure provide a device that includes an array of subarrays (AoSA) comprising a plurality of subarrays, each subarray including a plurality of antenna elements and a reconfigurable intelligent surface (RIS) that includes a plurality of configurable elements. The AoSA and the RIS are spaced apart from one another such that each subarray and a corresponding subset of the plurality of configurable elements are in each other's near field. Some embodiments described in the disclosure allow large spacing between antenna elements of the AoSA, thereby enabling lower complexity in circuit implementation for power amplification and phase shifting that may be associated with each antenna element, especially as high frequencies where spacing between antenna elements decreases and in some embodiments, reduces the number of antennas that are used.

Abstract: Certain aspects of the present disclosure provide techniques for determining crash similarity based on stack traces and user actions associated with a crash event and handling crash events based on the determined crash similarity. An example method generally includes receiving a crash report for a crash event recorded during execution of a software application. A similarity score is generated between the received crash report and one or more historical crash reports associated with historical crash events recorded during execution of the software application. A target set of historical crash reports is selected based on the generated similarity scores for each respective historical crash report. The target set of historical crash reports generally includes crash reports having generated similarity scores exceeding a threshold similarity score. One or more actions are taken to process the received crash report based on the target set of historical crash reports.

Abstract: The present disclosure describes methods, systems, and computer program products for providing additional stack trace information for time-based sampling (TBS) in asynchronous execution environments. One computer-implemented method includes determining whether time-based sampling is activated to capture a time-based sampling data during execution of a JavaScript function; in response to determining that the time-based sampling is activated to capture the time-based sampling data, determining whether a callback stack trace is active; in response to determining that the callback stack trace is active, loading the callback stack trace; retrieving a current stack trace of the JavaScript function; and saving the loaded callback stack trace and the current stack trace of the JavaScript function as the time-based sampling data.

Abstract: The current document is directed to methods and systems that employ distributed-computer-system metrics collected by one or more distributed-computer-system metrics-collection services, call traces collected by one or more call-trace services, and attribute values for distributed-computer-system components to identify attribute dimensions related to anomalous behavior of distributed-computer-system components. In a described implementation, nodes correspond to particular types of system components and node instances are individual components of the component type corresponding to a node. Node instances are associated with attribute values and node are associated with attribute-value spaces defined by attribute dimensions. A set of call traces is partitioned, by clustering.

Abstract: Techniques are described for predicting test scenarios and generating test case documents and/or automation scripts using machine-learning algorithms. For example, input may be received representing a web page, and an HTML Document Object Model (DOM) of the web page may be analyzed. From the DOM, a plurality of HTML elements may be extracted and processed by a machine-learning algorithm. Based on the processed plurality of HTML elements, a plurality of predictions for test case scenarios may be generated, and converted into a set of human-readable instructions, such as a test case document, and/or a set of machine-readable instructions, such as an automation script. In some instances, a user selection of at least one predicted test scenario from a displayed list of one or more predicted test scenarios is received and corresponding human-readable instructions and/or machine-readable instructions are generated for the selected scenario(s).

Abstract: A system for communicating and managing messaging between a source system and a destination system including a publisher module, a topic module that receives the message from the publisher module and including one or more subscription modules, a queue module that receives the message from the topic module, a success queue module, an error queue module, and a subscriber module that receives the message from the queue module, then decompresses, decrypts, calculates the check sum, then prepares the message for transmission to the destination system and transmits the message to the destination system.

Abstract: A lighting device according to an embodiment of the present invention comprises: a light source unit; a first communication unit for receiving library data from a mobile terminal; a storage unit for storing the library data; a second communication unit for receiving a control message indicating an execution command of a library corresponding to the library data from a control device; and a processor for controlling the light source unit such that the library is executed according to the control message, wherein the processor can control operation timing of the light source unit by sequentially receiving the control message at least a predetermined number of times at the initiation of the execution of the library.

Abstract: The present disclosure provides an apparatus for analyzing trace information. The apparatus includes one or more storage devices that store a set of instructions, and one or more processors. The one or more processors are configured to execute the set of instructions to cause the apparatus to: obtain, from servers, processor instruction traces corresponding to workloads performed by the servers; generate address traces based on the processor instruction traces; and perform a workload analysis in accordance with the address traces to model resource demands of the workloads.

Abstract: Embodiments for providing critical path analysis of active trace files in a cloud computing environment. A critical path may be identified using a trace of time spans and activities of a plurality of applications, wherein the critical path is a set of activities having time spans free of overlap with other activities.

Abstract: A test environment availability system is disclosed that comprises test servers that include JAVA virtual machines (JVMs), applications executing on the JVMs, and monitoring tools. The system comprises a server including an application that receives a mapping of each function to applications executing on one or more of the test servers that enable an end-to-end journey of the function, obtains operational statuses of the JVMs and the applications on the test servers from the monitoring tools, coalesces each of the operational statuses with a corresponding function based on the mapping to create a coalesced operational statuses mapping, applies a rules set to the coalesced operational statuses mapping, determines whether each function is operational based on the application of the rules set, and creates and provides a dashboard based on the determination that illustrates each function and each function's operational status to an electronic device for display on the electronic device.

Abstract: A method, system and computer program product for facilitating remote debugging of parallel regions in stream computing applications. A stream computing management server (SCMS) communicates a list of processing elements to a debugging interface. Responsive to setting a debugging breakpoint for a processing element of the list of processing elements, the SCMS receives a command to enable remote debugging for the selected processing element. In this regard, the processing element is a part of a parallel channel in a distributed processing environment. The SCMS maps the processing element to an attachment information in the distributed environment. The SCMS dynamically attaches a remote debugger to the processing element based on the attachment information.

Abstract: A tracing operation is initiated on a service, wherein the service comprises a plurality of method calls. A span is generated comprising timing information associated with the service, wherein the span comprises a plurality of nested spans associated with the plurality of method calls. A determination is made as to whether one or more method calls of the plurality of method calls are causing the service to underperform in view of the plurality of nested spans. In response to determining that the one or more method calls of the plurality of method calls are causing the service to underperform, a remedial action associated with the one or more method calls is performed.

Abstract: Systems and methods for mobile application accessibility testing are disclosed. According to one embodiment, in a test bench comprising at least one computer processor, a method for mobile application accessibility testing may include: (1) identifying an accessibility checkpoint for testing; (2) generating a test command for the accessibility checkpoint; (3) communicating the test command to a mobile electronic device, the mobile electronic device having a mobile application to be tested, an instrument application, and probe application in a memory thereof; (4) executing the test command on the mobile application to be tested using the instrument application; and (5) collecting results of the execution using the probe application.

Abstract: Methods, systems, and computer-readable storage media for receiving, by a web browser executing on a client-side device, a response from a server, the response provided in a taint-enhanced data format, processing, by a Javascript framework executed by the web browser, the response to parse data within the response and, for any data values marked as tainted, providing respective taint string Javascript objects as sanitized data, and providing the sanitized data to a document object model (DOM).

Abstract: In one embodiment, a processor comprises a fabric interconnect to couple a first cache agent to at least one of a memory controller or an input/output (I/O) controller; and a first cache agent comprising a cache controller coupled to a cache; and a trace and capture engine to periodically capture a snapshot of state information associated with the first cache agent; trace events to occur at the first cache agent in between captured snapshots; and send the captured snapshots and traced events via the fabric interconnect to the memory controller or I/O controller for storage at a system memory or storage device.

Abstract: A notification of a problem associated with an application may be received. A difference may be determined between a problem version of the application and an operational version of the application to identify a change associated with the problem. A person associated with the change may be determined. A task of resolving the problem may be assigned to the person associated with the change. A person may be notified of the problem and of the assigning of the task based on the identified change. A modification may be performed to resolve the problem associated with the change based on the determining of the difference.

Abstract: According to one aspect, a computer-implemented method of discovering processes for robotic process automation (RPA) includes: recording a plurality of event streams, each event stream corresponding to a human user interacting with a computing device to perform one or more tasks; concatenating the event streams; segmenting some or all of the concatenated event streams to generate one or more individual traces performed by the user interacting with the computing device, each trace corresponding to a particular task; clustering the traces according to a task type; identifying, from among some or all of the clustered traces, one or more candidate processes for robotic automation; prioritizing the candidate processes; and selecting at least one of the prioritized candidate processes for robotic automation. Further aspects building upon the above include generating RPA models to perform tasks determined to be processes for RPA. Corresponding systems and computer program products are also described.

Abstract: A method includes retrieving vendor specific data from one or more message oriented middleware servers of a message oriented middleware infrastructure, and inputting the vendor specific data from the one or more message oriented middleware servers into a back-end database. The vendor specific data is converted into commonly formatted data, and the commonly formatted data is inputted into a front-end database. The method also includes retrieving the commonly formatted data from the front-end database, and displaying the commonly formatted data on a user interface providing a visualization of a topology of the message oriented middleware infrastructure.

Abstract: Diffing subject and comparison traces. The subject and comparison traces can be matched based on identifying similar work being performed by their represented entities. The diffing includes identifying first function calls from the subject trace and identifying second function calls the comparison trace. First and second call trees are created from these function calls; parent-to-child node relationships in the call trees represent caller-to-callee function relationships. A differencing tree is created from the call trees; differencing tree nodes indicate a differencing status between the first and second call trees, and a differencing cost based on the nodes' differencing status pus an aggregation of the node's descendants' differencing costs. A differencing tree node is identified based on following nodes that most contribute to differences between the first and second call trees, and it is used to provide an indicia of a difference between the first and second function calls.

Abstract: Methods and systems for providing distributed tracing for application performance monitoring utilizing a distributed search engine in a microservices architecture. An example method comprises providing a user interface (UI) including a distributed trace indicating in real time the services invoked to serve an incoming HTTP request, the UI further including, in a single view, associated execution times for the services shown as a timeline waterfall. The distributed trace automatically propagates a trace ID to link services end-to-end in real time until a response to the request is served. The single view also provides graphs of response time information and the distribution of response times for the services. In response to selection of a particular element of the distribution, the UI provides respective timing details. The graphs and data shown on the single view can be filtered based on metadata input into a search field of the single view.

Abstract: Various methods are provided for quantum computing (QC) based code-optimization. One example method may comprise identifying one or more runtime hotspots in executed code based on one or more QC algorithms and application performance monitoring, evaluating performance of the one or more runtime hotspots, selecting one QC algorithm for each identified runtime hotspot of the one or more identified runtime hotspots, and for each identified runtime hotspot, testing the selected QC algorithm to optimize the identified runtime hotspot.

Abstract: A system includes a processor and a memory accessible by the processor. The memory stores instructions that, when executed by the processor, cause the processor to receive an industrial automation project code file, wherein the industrial automation project code file defines one or more operations of an industrial automation system during performance of an industrial automation process, retrieve a set of industrial automation rules associated with a set of best practices for project code files, analyze the industrial automation project code file based on the set of industrial automation rules, including identifying one or more instances of inefficient tag usage, and identifying one or more sets of parallel overlapping tasks, and generate a report based the analysis of the industrial automation project code file based on the set of industrial automation rules.

Abstract: An automation control and monitoring system is provided that includes an automation control component and a data store. The automation control component is configured to store measurement data acquired from a sensing component of the automation control system. Metadata is dynamically associated with the measurement data, such that at least a portion of both the data and the metadata may be accessed using a name reference that provides an indication of particular data from the one or more data fields and particular metadata associated with the particular data.

Abstract: An information-technology (IT) blueprint is an executable document that, when executed, can be used to create an IT application such as an e-commerce site. An IT lifecycle blueprint can further be used to manage (e.g., modify) and, ultimately, destroy such an IT application. To this end, an IT lifecycle blueprint can include idempotent methods that achieve the same result whether starting from a blank (real or virtual) infrastructure or from a previously populated infrastructure. In other words, the same method that created an IT application can be used to modify it. A request for a post-deployment modification can be made using a topological representation of a blueprint and highlighting the representations of components to which a selected modification could be applied.

Abstract: Disclosed are examples of systems, apparatus, methods and computer program products for providing components for building web applications within remote systems. A component database for web application components and an application database for web applications can be maintained in a multi-tenant database system. A first request can be processed to provide a web application for use at a remote site associated with a developer. Authorization of the remote site by the multi-tenant database can be determined based on a list of allowed remote sites for web applications. Data associated with the web application can then be sent to the remote site. A second request can be processed to provide a component for use at the remote site, indicating a component location of the remote site. Data associated with the first component can then be sent to the remote site. The data can be capable of causing an instance of the first component to be included at the component location of the remote site.

Abstract: A method for cache allocation to a plurality of virtual machines. The method includes sequentially receiving a sequence of requests, detecting a plurality of access sequences to a plurality of data elements, calculating a reuse distance of a plurality of reuse distances by calculating a number of distinctive data elements of the plurality of data elements, estimating an optimal cache size based on the plurality of reuse distances, and assigning the optimal cache size to a virtual machine. Each request of the sequence of requests is associated with an access of a plurality of accesses to the data element. The plurality of accesses include a plurality of read accesses and a plurality of write accesses.

Abstract: Deterministic memory allocation for real-time applications. In an embodiment, bitcode is scanned to detect calls by a memory allocation function to a dummy function. Each call uses parameters comprising an identifier of a memory pool and a size of a data type to be stored in the memory pool. For each detected call, an allocation record, comprising the parameters, is generated. Then, a header file is generated based on the allocation records. The header file may comprise a definition of bucket(s) and a definition of memory pools. Each definition of a memory pool may identify at least one bucket.

Abstract: Computer-implemented techniques are provided for in-device real time application program performance feature testing by test devices of an independent test device system of a performance test system. The performance test system includes an access control program that limits access to certain performance data that is automatically generated by the test devices, at test. A client device communicatively coupled to the performance test system via an internetwork installs program instructions of a performance test that may be iteratively executed to test an application program under test (APUT) in a test device. Different test conditions adapted to different performance feature testing identifying result data that is processed to determine the performance feature being tested. A test result is determined based on each performance test iteration and the test result, in addition to other test data is displayed on a user interface.