International Business Machines Corporation

Francis Nicholas Parr

Arun Kwangil Iyengar

Paul Michael Dantzig

Gong Su

Ambuj Goyal

Dakshi Agrawal

Daniel Manuel Dias

Sastry Duri

Rashed Z Bhatti

Joel Leonard Wolf

Donna N Dillenberger

Asit Dan

Robert O Dryfoos

Mark Richard Gambino

Anupam K Bhide

Hao Yang

Paul J Callaway

Stephen James Todd

James Thomas Rayfield

Avraham Leff

Agnes Shanthi Thiruthuvadoss

Andrew John Schofield

John Christopher Hawkins

Sunil Kiran Cutinho

Stephen M Goldman

Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Managing multileg transactions in distributed and parallel environments

Improved techniques are disclosed for processing transactions or requests in a data processing system. For example, a method for processing requests in a system including a plurality of nodes includes the following steps. At least two nodes of the plurality of nodes receive a plurality of requests. The two nodes exchange information to determine an order for processing requests. The two nodes process the requests in accordance with the order. The order may include a total order or a partial order.

Highly ordered transaction processing

Methods and systems for coordinated transactions in distributed and parallel environments

In a method for improving performance of a database, create, in a memory, an instance of a segment of data corresponding to a segment of data in a database on a persistent file system. The segment of data in the database on the persistent file system is expected to experience a high plurality of reads and writes during a certain time period. Receive a request to modify the segment of data in the database on the persistent file system. Modify the instance of the segment of data in the memory.

Access accelerator for active HBase database regions

A method for multicategory classification of streaming data records includes receiving a list of signature rules, each comprising a Boolean expression of a set of atomic recognizers (ARs) of one or more input fields of an input record and an assignment of a signature if the Boolean expression evaluates to TRUE, generating a list of all signature contexts from the list of signature rules, generating a context lookup table for each context, and processing a stream of input records on which signature detection is performed by using said ARs, said list of signature contexts, and said context lookup table for each context, wherein each input record in the stream of input records is classified into one of a plurality of categories based on the signature detection result, wherein an amount of processing grows sublinearly with a number of signature rules being processed.

Signature detection

A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.

Rapid searching and matching of data to a dynamic set of signatures facilitating parallel processing and hardware acceleration

Embodiments of the present invention manage multiple requests to allocate real world resources in a multi-user environment. A set of resource availability information is stored in a first durable data file for each resource in a plurality of resources provided by a database environment. The database environment is shared between a plurality of users. A decision context is associated with a second durable data file. The decision context is associated with a user interacting with the database environment. The decision context exists for a defined duration of time. A least one resource is determined to have been temporarily allocated to the decision context for the defined duration of time. The second durable data file is updated to indicate that the at least one resource has been temporarily allocated to the decision context. The first durable data file is updated to indicate that the at least one resource is currently unavailable.

Supporting linked multi-user decision making in environments with constrained shared resources utilizing durable files

Embodiments of the present invention manage multiple requests to allocate real world resources in a multi-user environment. A request for interacting with a database environment comprising records of allocations of a plurality of resources is received from a user in a plurality of users. The database environment is shared between the plurality of users. A set of action choices available for the request is provided to the user via the user interface. A set of resources required by each action choice is identified. The set of resources is associated with a decision context. The decision context exists for a period of time. The set of resources are allocated to the user for a duration of the decision context. The allocating prevents the set of resources from being allocated to other users for the duration of the decision context irrespective of a set of actions performed by the other users.

Supporting linked multi-user decision making in environments with constrained shared resources

A user is enabled to specify policy information for use by a persistence manager in determining how to persist information relating to a data item so as achieve a desired level of reliability. The user is permitted to specify at least two behavior requirements to be associated with information to be persisted. The first behavior requirement is specifiable for a first system state, and the second behavior state is specifiable for a second system state. The behavior requirements are interpretable by the persistence manager to determine a persistence behavior necessary to conform with the policy information.

Management of persistence in a data processing system

Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling compound requests, in a system comprising multiple nodes for executing requests in which an individual request is associated with a particular node, comprises the following steps. A compound request comprising at least two individual requests associated with a same node is received. It is determined if both of the at least two individual requests are executable. The compound request is executed if it is determined that all individual requests of the compound request can execute.

Methods and systems for coordinated financial transactions in distributed and parallel environments

Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling requests in a data processing system comprises the following steps. A compound request comprising at least two individual requests of different types is received. An individual request rof the compound request is placed on a queue for requests of type t, wherein tis the request type of r. After rhas reached the front of the queue, it is determined if at least one individual request of said compound request can execute. The compound request is executed if it is determined that all individual requests of the compound request can execute.

Growing community of inventors

New York, NY, United States of America

Francis Nicholas Parr