International Business Machines Corporation

Nicholas Matthew Mitchell

Peter Francis Sweeney

Stephen Fink

Erik Richter Altman

Patrick Joseph O'Sullivan

Hitham Ahmed Assem Aly Salama

Andres Omar Portillo Dominguez

Gary Seth Sevitsky

David Frederick Bantz

Indrajit Poddar

Rafah A Hosn

Daby Mousse Sow

Rodric Rabbah

Matthew R Arnold

Edith Gail Schonberg

Jeremy Brand Sussman

Harini Srinivasan

John Sidney Davis, Ii

Olivier L J Tardieu

Herbert G Derby

Veronique Perret

Nedumaran Palani Kumanan

Techniques that facilitate re-hosting a subset of a serverless application are provided. In one example, a system includes an interface component, a rewriter component and a broker component. The interface component receives identifier data from a computing device that identifies a portion of a serverless application to be re-hosted by the computing device. The computing device is in communication with the serverless computing system via a network device. The rewriter component rewrites the serverless application to allow the first portion of the serverless application to be executed by the computing device and another portion of the serverless application to be executed by the serverless computing system. The interface component re-routes the first portion of the serverless application to the computing device to facilitate a debugging session for the first portion of the serverless application that is performed by the computing device.

Facilitating debugging serverless applications via graph rewriting

A processor may receive a query from a user. The query may include one or more portions. The processor may identify a primary function. The processor may determine to segment the primary function into two or more subsidiary functions. The processor may process a first portion of the query with a first subsidiary function. The processor may display a processed outcome of the query to the user.

Serverless composition of functions into applications

A non-transitory, computer readable, storage medium storing a program of instructions executable by a machine to perform a method of gauging a benefit of a tuning action, the method includes acquiring a set of time series data sampled from an environment of an application, using a processor.

Tuning resources based on queuing network model

Dynamically identifying performance anti-patterns in a software system is based on a set of documented symptoms that are evaluated in real-time. The evaluation is based on the observed system behavior and its comparison against the documented symptoms of different types of performance issues.

Dynamically identifying performance anti-patterns

An improvement to the process for identifying software problems in performance testing is achieved by dynamically adjusting workloads in real-time to stress the functionality of an application suspected of causing a software problem.

Dynamically adapting a test workload to accelerate the identification of performance issues

A method for dynamically and adaptively monitoring a system based on its running behavior adjusts monitoring levels of the monitored application in real-time. A rules-based mechanism dynamically adjusts monitoring levels in real-time, based on the system's performance observed during a workload run, whether in a production or test environment.

Rule-based adaptive monitoring of application performance

A computer program product for automatically gauging a benefit of a tuning action. The computer program product including a computer readable storage medium having computer readable program code embodied therewith. The computer readable program code including computer readable program code configured to collect a plurality of observations of a running state of a plurality of threads in a computer system. Computer readable program code configured to identify a plurality of resources of the computer system and a capacity of each resource of the plurality of resources. Computer readable program code configured to map an observation of the running state of each thread of the plurality of threads to a resource that the observation of each thread uses, respectively, and computer readable program code configured to apply the tuning action to a first resource of the plurality of resources to determine an impact on the performance of the computer system.

Finding resource bottlenecks with low-frequency sampled data

A method for automatically gauging a benefit of a tuning action. The method including collecting a plurality of observations of a running state of a plurality of threads in a computer system, as executed by a processing in a computer system. Identifying a plurality of resources the computer system and a capacity of each resource of the plurality of resources. Mapping an observation of the running state of each thread of the plurality of threads to a resource that the observation of each thread uses, respectively. Applying the tuning action to a first resource of the plurality of resources to determine an impact on the performance of the computer system.

A method (and system) of modeling runtime behavior for a software application includes limiting a portion of a run to be analyzed using criteria that define an analysis scenario, structuring events of the analysis scenario as a flow of logical content through a plurality of transformations, applying labels to elements of the flow, and generating a behavior signature for the analysis scenario based on the labels.

Method and system for modeling runtime behavior

Execution states of tasks are inferred from collection of information associated with runtime execution of a computer system. Collection of information may include infrequent samples of executing tasks, the samples which may provide inaccurate executing states. One or more tasks may be aggregated by one or more execution states for determining execution time, idle time, or system policy violations, or combinations thereof.

Automatic identification of bottlenecks using rule-based expert knowledge

Techniques for assessing the utilization efficiency of a portion of memory are provided. One or more images of a portion of memory are obtained. The one or more memory elements found within each image are categorized into one or more application-neutral categories, wherein the one or more categories distinguish between data and structural overhead. At least one analysis is performed on the one or more categorized memory elements of the one or more images using a measure representative of the efficiency of utilization of the portion of memory. The one or more results of the analysis step are outputted.

Growing community of inventors

White Plains, NY, United States of America

Nicholas Matthew Mitchell