International Business Machines Corporation

Paul Michael Dantzig

Arun Kwangil Iyengar

Francis Nicholas Parr

Gong Su

Sastry Duri

James R H Challenger

Robert O Dryfoos

Daniel Manuel Dias

Daniel Manual Dias

Gerald A Spivak

Eric Michel Levy-Abegnoli

Donna N Dillenberger

George Prentice Copeland

Robert Filepp

Richard Pervin King

Matthew McClain

Mark Richard Gambino

James Robert Harold Challenger

Philip Shi-lung Yu

Paul J Callaway

Ronald Mraz

Nagui Halim

Agnes Shanthi Thiruthuvadoss

James R Challenger

Junehwa Song

Sunil Kiran Cutinho

Stephen M Goldman

Yew-Huey Liu

Arun Kwangil Ivengar

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

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

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.

Methods and systems for coordinated transactions

Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.

Managing concurrent accesses to a cache

A reservation management system includes at least one processing node that includes a memory and a processor. The at least one processing node further includes a set of reservation processing and transaction modules that manage and process reservation requests and inquiries. At least one general purpose database is communicatively coupled to the at least one processing node. The at least one general purpose database includes a set of pre-allocated tables of fixed length records. At least one persistent storage device is communicatively coupled to the at least one processing node. The general purpose database persistently stores the set of pre-allocated tables of fixed length records on the at least one persistent storage device.

Two-layer data architecture for reservation management systems

Systems and methods for processing compound requests by computing nodes in distributed and parrallel environments by assigning commonly occuring pairs of individual requests in compound requests to a same computing node

Growing community of inventors

Scarsdale, NY, United States of America

Paul Michael Dantzig