International Business Machines Corporation

Globalfoundries Inc.

Adam J Pilkington

Howard J Hellyer

Richard Nigel Chamberlain

Graham Castree Charters

Matthew Francis Peters

Timothy J Mitchell

Gordon Douglas Hutchison

Ian O Partridge

Lewis Evans

Andrew Taylor

David Seager Renshaw

Tim Mitchell

Katherine Elizabeth Stanley

Stuart P Wilkinson

Alexander Mitchell

George Hicken

Bret William Dixon

Benjamin T Horwood

Keira Louise Hopkins

Timothy McCormick

John A Kaputin

Craig A Carson

David Cousins

Dave Renshaw

Esther L Dovey

Emma L Grove

Simon C E Rowland

Andrew James Dunnings

Samuel B Hawker

Arthur J Barr

Thomas Van Der Veen

Christopher M Batey

Matthew Chirgwin

Blazej Czapp

Simon Charles Edward Rowland

In a service mesh, back-pressure is applied and relieved as needed by a control mechanism which is applied between pairs of services to control the rate at which service requests are made from one of service to the other via monitoring hardware and/or software metrics. A proxy of one service is monitored to observe the rate at which it receives service requests from the other service. If it is observed that the monitored metrics have breached allowable limits, back-pressure is applied to reduce the rate at which the other proxy transmits these service requests. Through continued monitoring of the proxy, the back-pressure can be later relieved when appropriate by increasing the permitted request rate.

Managing workload in a service mesh

A computer system hosting (micro)services that uses a service mesh to govern communication between the services. The services include consumer services and an event stream service, the latter directing an event stream from a producer service to the individual consumer services. The control plane of the service mesh has the role of creating and removing service instances. Based on a specified event capacity that is to be provided by the consumer services collectively, the control plane manages service provisioning by estimating the current event capacity of the system. This is done by measuring the event capacities of each consumer service instance and summing them, from which any shortfall or excess of the current event capacity in relation to the specified event capacity can be determined. Consumer service instances are then added in case of a shortfall or removed in case of an excess as needed to avoid over or under-provisioning.

Dynamic load balancing in reactive systems

An apparatus for executing one or more commands, for use with a virtualization environment operable to execute one or more virtualization functions, the apparatus comprising: an interface operable to determine an identifier associated with a first virtualization function; a parser operable to determine one or more commands available for execution using the first virtualization function; a store for storing each determined command with the first virtualization function identifier; a searcher, responsive to input of a first command, for matching the first command with each determined command in order to determine one or more matching commands; and an executor, responsive to selection of a first matching command, for executing the associated first virtualization function and the first matching command.

Executing commands in a virtual environment

A computer-implemented method, system, and computer program product for analyzing readability of a communication intended for a target audience includes: analyzing the communication to determine a first readability measure associated with the communication; determining a second readability measure associated with the target audience based on one or more historical communications previously transmitted or received by the target audience; and generating a readability feedback signal for the communication based on the first readability measure and the second readability measure.

Analyzing readability of communications

A system and related method for managing memory in data processing comprises allocating each of a plurality of application containers a respective portion of a memory communicatively coupled to a plurality of processing units. The method further comprises allocating each of the plurality of application containers a respective group of the plurality of processing units and allocating, to each of the plurality of application containers, nursery and tenured heap spaced in the memory. The method then comprises performing, responsive to a request from an application container, garbage collection from the nursery and tenured heap spaces allocated to the application container.

Data processing for allocating memory to application containers

Embodiments of the present invention provide methods, computer program products, and systems. One example comprises monitoring traffic between a plurality of microservices to determine a property of the traffic. Embodiments of the present invention can then, based on the determined property of the monitored traffic, relocate each of the plurality of microservices from its respective origin resource to a shared resource.

Managing communication between microservices

Systems, methods and computer program products are provided. An indication that a log of data entries has reached a size limit for the log is received. The data entries are continually stored in the log over time, and each entry comprises an associated log level. A threshold log level for data entries in the log is determined. At least one new data entry for the log is received. An existing data entry having a log level less than or equal to the threshold log level is overwritten by the new data entry, so that the size limit is not exceeded.

Optimizing data entries in a log

A computer-implemented method, apparatus, system and computer program product for optimizing parameter data passing between services in a service mesh, the method including receiving, at a first service, a request for the first service, the request including parameter data; storing the parameter data in a request parameter store, retrieving the parameter data from the request parameter store; the first service initiating a request for a second service, the parameter data in the request being replaced by a unique token identifying the parameter data in the request parameter store; and responsive to the second service using the parameter data, retrieving the parameter data from the request parameter store.

Optimizing large parameter passing in a service mesh

Collaborative help for user applications includes: generating a message, the message being reflective of a user's experience in using a user application; sending the message to a collaborative help server to share the message with other users; and receiving a response from the server providing information regarding one or more other users' experience similar to the user's experience reflected in the message.

Collaborative help for user applications

Method and system are provided for identifying a source file for use in debugging compiled code. The method includes referencing a compiled file for debugging and searching for potential source files of the compiled file from configured repositories. The method obtains the potential source files from the configured repositories and iterates over the obtained potential source files to compile and compare each potential source file to the compiled file. One or more matching source files are identified for use in debugging the compiled file.

Identifying a source file for use in debugging compiled code

A method for debugging asynchronous functions in a computer system that implements a runtime stack when executing a program includes, in response to an asynchronous called function being invoked by a calling function of a first execution thread, copying active stack frames of the runtime stack and storing the copied active stack frames as a duplicate stack.

Debugging asynchronous functions

A system, a method, and a computer program product for use with a virtualization environment operable to execute one or more virtualization functions. A computing device determines an identifier associated with a first virtualization function. The computing device determines one or more commands available for execution using the first virtualization function. The computing device stores each determined command with the first virtualization function identifier. The computing device responsive to an input of a first command, matches the first command with each determined command in order to determine one or more matching commands. Responsive to selection of a first matching command, the computing device executes the associated first virtualization function and the first matching command.

A method, computer system, and computer program product for generating an optimized managed runtime application is provided. Method invocation statistics for a managed runtime application are received. The managed runtime application comprises code defining a plurality of classes, each class including bytecode for one or more methods associated with the class. The method invocation statistics identify the methods invoked during at least one previous execution of the managed runtime application. An optimized version of the managed runtime application is generated based on the method invocation statistics. The managed runtime application is retrieved, and bytecode for at least one method of a class of the managed runtime application is selectively replaced with proxy code based on the method invocation statistics. The proxy code is configured for retrieving the replaced code.

Optimizing managed runtime applications for serverless environments

A method and system for which a service call is referred to as an event and processing the service call is referred to as an action. Traversal of a directed graph is monitored for an application during execution of the application. Traversal probabilities for events in the directed graph which may still occur during the execution of the application are continually revised. Decision logic is applied during the execution of the application to decide whether to pre-start one service in the directed graph that may still be called prior to an event in the directed graph calling the one service. The one service decided upon by the decision logic is pre-started.

Growing community of inventors

Winchester, United Kingdom

Adam J Pilkington