International Business Machines Corporation

Doina Liliana Klinger

Rebecca M Quaggin-Mitchell

Chengxuan Xing

David James Nice

Fenglian Xu

Matthew J Clarke

Alexander Robert Wood

John Anthony Reeve

Ashley Donald Harrison

Martin Andrew Ross

James Stuart Taylor

Adrian David Dick

Vlad Balanescu

Tom Soal

George M Blue

Philip Jones

Mark Allman

Paul S Thorpe

Vernon Maurice Green

Samuel D Hughes

Andrew M Leonard

Andrew S Edwards

David Currie

Lucas William Partridge

David John Clark

Shanna Xu

Elisabetta Flamini

Paul S M Thorpe

Marc Stanley Carter

Xiaoming Zhang

Andrew S M Edwards

Peter Timothy Crocker

Anthony D Curcio

Laura Jane Cowen

Samuel S May

Thomas Soal

Nigel Daniels

A method for authorizing a pull request from a managed cluster may include generating an encrypted pull secret for a managed cluster, assigning the generated encrypted pull secret to the managed cluster, determining, responsive to receiving a pull request from a managed cluster at the service provider where the pull request has an accompanying encrypted pull secret, whether the pull request was initiated by an intended managed cluster by decrypting the encrypted pull secret assigned to the managed cluster using a decryption key, and authorizing the pull request based on whether the decrypted pull secret is assigned to an intended managed cluster.

Data cluster management

An approach to implement an extract, transform and load system, a queue is provided for holding units of data between extraction and transformation. When units of data suffer a rate limit error in the load phase, they are requeued so they can be resubmitted for transformation. The contents of the queue are monitored and, if too many requeued units of data are detected in the queue, then this is taken as an indicator of an unacceptable number of rate limit errors and active pacing management is triggered. A retry schedule is defined for the requeued units of data. Extraction is temporarily halted to allow the requeued units of data to be retransformed without more units of data queuing up. Then, after the suspension is lifted, a pacing delay is inserted between subsequent extract events to avoid the same load phase bottleneck recurring.

Managing extract, transform and load systems

A method, system, and computer program product are configured to: receive, from a user device of a user, input indicating that a first extract, transform, and load (ETL) flow is incorrect and that a second ETL flow is correct; in response to receiving the input, determine whether a change made by the first ETL flow is reversible; in response to determining the change made by the first ETL flow is reversible, generate a corrective ETL flow that is configured to reverse the change made by the first ETL flow; and in response to determining the change made by the first ETL flow is not reversible, notify a user that the change made by the first ETL flow is not reversible, and inform the user which records have been changed such that they can do a manual correction.

Correcting errors of a running extract, transform, load (ETL) process

An application configuration tool and associated method for supporting deployment of an application on a server that has a set of configurations available for applications deployed on the server. The method attempts to match every configuration required by the application to a configuration available on the server. In case of multiple candidates that match, one is selected. When there is no match an error message is generated. The method is iterated to inspect each selected configuration to identify any references contained in the selected configuration that themselves need further configurations. The iteration of inspecting and the matching to follow the references is continued until all such references are exhausted either by matching or failure to match and consequent error message generation. Finally, a configuration report is output specifying the selected configurations and, to the extent that not all required configurations have been matched to available configurations, the error messages.

Configuration tool for deploying an application on a server

A method, computer system, and computer program product for consolidating and recording elements on a physical display board is provided. The embodiment may include capturing an initial image of a visual display mechanism, whereby the initial image contains elements. The embodiment may also include determining an initial state of the visual display mechanism based on the captured image. The embodiment may further include recognizing characters of the elements in the initial state. The embodiment may also include capturing a subsequent image of the visual display mechanism, wherein an auditory cue is sent to a user when there is an unsuccessful attempt to capture the subsequent image. The embodiment may further include comparing the initial image and the subsequent image of the visual display mechanism. The embodiment may include identifying updates to the visual display mechanism based on the comparison of the initial image and the subsequent image.

Consolidation and history recording of a physical display board using an online task management system

A method, system, and computer program product for determining valid drop targets for nodes within an integration flow using mapping that includes: identifying a first node, identifying one or more input nodes, where the one or more input nodes are nodes within an integration flow of the first node, analyzing a mapping of the first node, where the analyzing includes determining whether the mapping contains one or more inputs from the one or more input nodes, and in response to determining that the mapping contains one or more inputs from an input node of the one or more input nodes, identifying valid drop points for the first node using the input node.

Determine valid drop targets for nodes from mapping

Methods and systems for identifying groups of related nodes in an integration flow are disclosed. A method includes: receiving, by a computing device, an integration flow document including information indicative of: (i) a plurality of nodes, with each node representing a processing step in an integration flow, (ii) a plurality of input parameters, and (iii) a plurality of input sources; determining, by the computing device, a plurality of mappings, with each mapping representing an association between an input parameter and an input source; determining, by the computing device, a plurality of grouped nodes of the plurality of nodes based upon the plurality of mappings; receiving, by the computing device, a request to perform a first operation on a first target node of the plurality of nodes; determining, by the computing device, that the first target node is included in the plurality of grouped nodes; and in response to determining that the first target node is included in the plurality of grouped nodes, performing, by the computing device, the first operation on each grouped node of the plurality of grouped nodes.

Identifying groups of related nodes in an integration flow

In an approach for providing navigational assistance to a target location in a vehicle parking facility, a processor accesses stored vehicle registration numbers each mapped to a location of a vehicle in a parking facility in a database. A processor associates a user with a target vehicle registration number. A processor receives input of a reference vehicle registration number from a mobile user device at a current location of the user using an input component of the mobile user device and references the database of vehicle registration numbers. A processor identifies a current location in the parking facility by look up of the reference registration number; identifies a user's target location in the parking facility by look up of the target registration number associated with the user; and generates dynamic navigational instructions from the current location to the user's target location for sending to the mobile user device.

Providing navigational assistance to target location in vehicle parking facility

Concepts for sharing processing resource of a multi-tenant extract transform load, ETL, system are presented. In such concepts, a total workload of the multi-tenant ETL system is considered along with the queued workload of tenant in order control deliver of the queued workload to the system. Such control is undertaken, for example, by delaying the work of the tenant. Proposed embodiments therefore seek to devise a policy to achieve fairness amongst tenants.

Multi-tenant extract transform load resource sharing

A facility for event failure management is provided, which includes providing a failed event database containing failed event information relating to failed events and one or more components associated with each of the failed events. Upon modification to a component associated with a failed event, the failed event is retried. Based on a result of retrying the failed event, failed event information of the failed event database is updated. The failed event database may therefore be dynamically and/or automatically updated so that it contains up-to-date and appropriate information for predicting and/or managing event failures.

Event failure management

Systems, methods and computer program products are provided. Metadata associated with an integration flow comprising a sequence of nodes are received. The metadata identifies data in one or more data objects used by the nodes of the integration flow. In response to initiation of the integration flow, an input data object is received. Initial context data for the integration flow are extracted, from the input data object, based on the metadata. The context data is processed at each of the nodes of the integration flow, wherein one or more of the nodes adds data from its output data object to the context data based on the metadata. Remaining data from the output data objects of one or more of the nodes which was not added to the context data based on the metadata is discarded.

Optimization of memory usage by integration flows

A mechanism is provided in a data processing system having a processor and a memory. The memory comprises instructions which are executed by the processor to cause the processor to implement a graphical editor for managing L-shaped swim lanes in a graphical view of an application process. The graphical editor receives a data serialization file representing a process flow of a software application. The graphical editor renders each synchronous node in the process flow in the graphical view of the application process. A swim lane rendering engine executing within the graphical editor creates an L-shaped swim lane for each asynchronous node in the process flow in the graphical view of the application process. The graphical editor presents the graphical view of the application process via an output device.

Management of L-shaped swim lanes of variable heights and widths in a graphical editor used to represent multiple asynchronous process in the same view

The present invention is a method and system for an application server to process failed events of a predetermined software flow. An event generator generates an event to include event data and a related processing flow of a software application which processes the event. Each processing flow has a unique flow ID. An event queue is populated with events, and the processing flow is processed by an event processor. When an event fails, the application server deletes the event and its related processing flow from the event queue, then inserts and links the failed event, its related software application and processing flow, and one or more reasons for failure into a failed event queue.

Processing failed events on an application server

Passing a result of batch processing into a data integration flow is provided. Each data record of a plurality of data records corresponding to a specified data record collection is processed within a different thread of a different execution branch in parallel. At an end of each processing of each different execution branch, a new value is computed for each processed data record based on a previously stored value and an execution branch context for each processed data record. It is determined whether all data records in the plurality of data records have been processed. In response to determining that all of the data records in the plurality of data records have been processed, a data accumulation object corresponding to the batch processing is updated within a data assembly context based on a computed new value for each processed data record to form an updated data assembly context.

Growing community of inventors

Winchester, United Kingdom

Doina Liliana Klinger