Ab Initio Technology LLC

International Business Machines Corporation

Atria Software, Inc.

Bryan Phil Douros

Joseph Skeffington Wholey, Iii

Craig W Stanfill

Matthew Darcy Atterbury

Geoffrey M Clemm

Tim Wakeling

Marshall Alan Isman

David B Leblang

Robert P Chase, Jr

Debra A Minard

Gordon D McLean, Jr

Larry W Allen

Carol D Yutkowitz

David E Jabs

Nathaniel W Mishkin

Timothy Wakeling

Ann M Wollrath

H Mark Bromley

Stephen A Revilak

Steven T Rehrauer

Ann M Johnson

Joseph Skeffington Wholey

Iii Wholey Joseph Skeffington

Joseph Skeffington Iii Wholey

Joseph Skeffington Wholey Iii

Mark H Bromley

An approach to parallel access of data from a distributed filesystem provides parallel access to one or more named units (e.g., files) in the filesystem by creating multiple parallel data streams such that all the data of the desired units is partitioned over the multiple streams. In some examples, the multiple streams form multiple inputs to a parallel implementation of a computation system, such as a graph-based computation system, dataflow-based system, and/or a (e.g., relational) database system.

Parallel access to data in a distributed file system

A method for managing a distributed data processing system, the method implementing counters to track durability states of data units in the distributed data processing system, wherein the counters are used to manage processing of the data units in the distributed data processing system.

Managing a computing cluster

A method for processing data using a distributed data processing system includes providing input data to the distributed data processing system from a distributed data processing system interface component in communication with the distributed data processing system. The distributed data processing system processes the input data to generate a response, which it provides to the distributed data processing system interface component. The distributed data processing system interface component holds the response in escrow until it receives an indication from the distributed data processing system that the response has reached a sufficient level of durability.

Managing a computing cluster interface

A computing system includes nodes executing data processing programs that each process at least one stream of data units. A data storage system stores shared data accessible by at least two of the programs. Processing at least one stream using a first data processing program includes: processing a first stream of data units that includes multiple subsets of contiguous data units; initiating termination of processing within the first data processing program, between processing a first subset of contiguous data units and processing a second subset of contiguous data units adjacent to the first subset of contiguous data units within the first stream of data units; durably storing at least some changes to the shared data caused by processing the first subset of contiguous data units after determining that the termination of processing within the first data processing program has completed; and resuming processing within the first data processing program.

Recoverable stream processing

Managing potentially concurrent transactions in a distributed database system includes: maintaining, at a first node, records of transactions executing on one or more nodes, each having a transaction state, execution of a first transaction at a second node including an operation for accessing a first data element stored on the second node and execution of a second transaction at the second node including an operation for accessing the first data element; receiving, at the second node from the first node, a list of transactions including any transactions executing on the second node and having a first transaction state at a time of initiation of the second transaction, and including the first transaction; determining that an outcome of the second transaction depends on an outcome of the first transaction based on the list; and suspending execution of the second transaction until after the first transaction is complete based on the determining.

Distributed database system

Embodiments of the present invention address deficiencies of the art in respect to software configuration management and provide a method, system and apparatus for producing audited builds based on separate class dependency records. In one embodiment, a software configuration management tool can be provided which can include build-audit logic programmed to produce separate configuration records for each target object in a build. Each configuration record can include a direct dependency reference for a corresponding target object. Moreover, each configuration record can include version information for a corresponding target object. Finally, the software configuration management tool can include a versioned object base storing different versions of source files and derived objects built from the source files.

Audited builds based upon separate class dependency records

Among other aspects disclosed are a method and system for processing a batch of input data in a fault tolerant manner. The method includes reading a batch of input data including a plurality of records from one or more data sources and passing the batch through a dataflow graph. The dataflow graph includes two or more nodes representing components connected by links representing flows of data between the components. At least one but fewer than all of the components includes a checkpoint process for an action performed for each of multiple units of work associated with one or more of the records. The checkpoint process includes opening a checkpoint buffer stored in non-volatile memory at the start of processing for the batch.

Fault tolerant batch processing

Techniques are disclosed that include a computer-implemented method, including storing information related to an initial state of a process upon being initialized, wherein execution of the process includes executing at least one execution phase and upon completion of the executing of the execution phase storing information representative of an end state of the execution phase; aborting execution of the process in response to a predetermined event; and resuming execution of the process from one of the saved initial and end states without needing to shut down the process.

Restarting processes

Techniques are disclosed that include a computer-implemented method including transmitting a message in response to a predetermined event through a process stage including at least first and second processes being executed as one or more tasks, the message instructing the abortion of the executing of the one or more tasks, and initiating abortion of execution of the one or more tasks by the one or more of the processes on receiving the messages.

Restarting data processing systems

A graph-based computation has a plurality of nodes representing graph components connected by one or more links representing data flows between the components. Preparing the computation includes: identifying at least a first set of components to process a plurality of transactions in the computation; and associating with a first transaction a first group of one or more data records and data operations corresponding to the data records, and associating with a second transaction a second group of one or more data records and data operations corresponding to the data records. Executing the computation to process at least the first and second transactions includes delaying execution by the first set of components of a data operation corresponding to an initial data record of the second group until after execution by the first set of components of a data operation corresponding to a final data record of the first group.

Processing transactions in graph-based applications

A computer method, system and apparatus for selecting version of a software program artifact includes history means and processor means. The history means indicate (a) a baseline version of each artifact in a given plurality of artifacts forming a subject software program configuration, and (b) respective change-set information per artifact. Different change sets correspond to different versions of the artifacts. The processor means determine version of an artifact in the subject software program configuration using the indicated baseline versions and change-set information. The processor means enable the configuration management system to display the determined version of the artifact to a user.

Computer method and apparatus for activity-based version selection in a configuration management system

Among other aspects disclosed are a method and system for processing a batch of input data in a fault tolerant manner. The method includes reading a batch of input data including a plurality of records from one or more data sources and passing the batch through a dataflow graph. The dataflow graph includes two or more nodes representing components connected by links representing flows of data between the components. At least one but fewer than all of the components includes a checkpoint process for an action performed for each of multiple units of work associated with one or more of the records. The checkpoint process includes opening a checkpoint buffer stored in non-volatile memory at the start of processing for the batch. For each unit of work from the batch, if a result from performing the action for the unit of work was previously saved in the checkpoint buffer, the saved result is used to complete processing of the unit of work without performing the action again. If a result from performing the action for the unit of work is not saved in the checkpoint buffer. The action is performed to complete processing of the unit of work and the result from performing the action is saved in the checkpoint buffer.

Growing community of inventors

Framingham, MA, United States of America

Bryan Phil Douros