International Business Machines Corporation

Mark Richard Gambino

Robert O Dryfoos

Roy Frank Brabson

Linwood Hugh Overby, Jr

Christopher Daniel Filachek

Michael J Shershin

Robert A Blackburn

Daniel Howard Jacobs

Arun Kwangil Iyengar

Paul Michael Dantzig

Sastry Duri

Francis Nicholas Parr

James V Farmer

Daniel L Yee

Jamie V Farmer

Judy Marie Kearney

Shawfu Chen

Bradd A Kadlecik

Steven Edwin Roach

Barry M Baker

Leslie F Sutton

Evan Jennings

Shu-Hui Warner

Claire Durant

Jarred Durant

Robert Ochs Dryfoos

Michael J Shersin

According to at least one embodiment, a method, a computer system, and a computer program product for minimizing I/O operations when validating databases are provided. The present invention may include creating a corresponding system-managed chain database for an application database, the chain database comprising a list of one or more dynamically allocated records, if present, for one or more fixed entries in the application database, wherein each of the fixed entries comprises a respective chain database array item in the chain database; scanning, via a validation utility, one or more chain database array items; marking each of the one or more dynamically allocated records listed in the chain database for the fixed entries as found; and checking, via an indicator with various states, if the one or more dynamically allocated records for the one or more fixed entries are listed in the respective chain database array item.

Minimizing I/O operations when validating flat databases

A computer-implemented method for storing documents in a centralized database system based on geographical data localization includes receiving, by a database manager, a request to update a document according to a data localization criterion, the document stored in a local storage device of the centralized database system. The method further includes determining, by the database manager, a geographical location for a local copy of the document based on an attribute of the document matching the localization criterion. The method further includes creating, by the database manager, a remote copy of the document on a storage device that is physically located in the geographical location. The method further includes modifying, by the database manager, the local copy of the document to include a location information of the remote copy.

Centralized database system with geographically partitioned data

Technical solutions are described for reading HTTP responses in separate processes being executed by a client computing device. An example method includes sending an HTTP request from an application program executed by a first process, the HTTP request being sent for receipt by a server. The method further includes storing application identification associated with the HTTP request, and terminating the first process. The method further includes, in response to receiving a HTTP reply from the server, determining that the HTTP reply is corresponding to the HTTP request based on the application identification, and passing the HTTP reply to the application program.

Asynchronously reading HTTP responses in separate process

A system includes a memory system with a shared memory resource and a processor with multiple processor cores operably coupled to the memory system. A lock requesting core is configured to access a shared location of the shared memory resource to determine whether a lockable portion of the shared memory resource is in a locked state. The lock requesting core adds a memory lock request to a lock waiting list associated with the lockable portion based on the shared location indicating the locked state. A lock granted location dedicated to the lock requesting core is monitored for an indication that the lock requesting core has been granted the locked state from a previous locking core of the processor cores. The lock requesting core performs one or more updates to the lockable portion based on determining that the lock requesting core has been granted the locked state.

Memory lock serialization

Technical solutions are described for sharing HTTP client sessions among multiple processes being executed by a client computing device. An example method includes creating a set of HTTP client sessions for a remote server. The method further includes, in response to receiving an HTTP request from an application process, the HTTP request is for communicating with the remote server, assigning an HTTP client session from the set of HTTP client sessions to the application process, and sending the HTTP request from the application process to the remote server via the HTTP client session that is assigned. The method further includes, in response to receiving a reply from the remote server, deselecting the HTTP client session from the application process, and sending the reply from the remote server to the application process.

Sharing system managed HTTP client sessions across processes

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 method and system is disclosed for dispatching tasks to multiple processors that all share a shared memory. A composite queue size for multiple work queues each having an associated processor is determined. A queue availability flag is stored in shared memory for each processor work queue and is set based upon the composite queue size and the size of the work queue for that processor. Each queue availability flag indicates availability or unavailability of the work queue to accept new tasks. A task is placed in a selected work queue based on that work queue having an associated queue availability flag indicating availability to accept new tasks. The data associated with task dispatching is maintained so as to increase the likelihood that valid copies of the data remain present in each processor's local cache without requiring updating do to their being changed by other processors.

Task dispatching based on composite queue size and upper and lower compare values

A method and system is disclosed for selecting a work queue associated with a processor within a multiple processor architecture to assign a new task. A local and a remote queue availability flag is maintained to indicate a relative size of work queues, in relationship to a mean queue size, for each processor in a multiple processor architecture. In determining to which processor to assign a task, the processor evaluates its own queue size by examining its local queue availability flag and evaluates other processor's queue sizes by examining their remote queue availability flags. The local queue availability flags are maintained asynchronously from task assignment. Remote flags are maintained at time of task assignment. The presented algorithm provides improved local processor queue size determinations in systems where task distribution processes execute with lower priorities that other tasks.

Work queue selection on a local processor within a multiple processor architecture

A method for selecting a processor to be acquired in a virtual, shared computing environment includes initiating a first selection phase to attempt to acquire a last relinquished processor of the shared computing environment, and initiating a second selection phase in the event of a failure of the first selection phase in acquiring the last relinquished processor. The second selection phase further includes a round-robin selection process for presently relinquished processors.

Method for efficient utilization of processors in a virtual shared environment

Improvements in security processing are disclosed which enable security processing to be transparent to the application. Security processing (such as Secure Sockets Layer, or 'SSL', or Transport Layer Security, or 'TLS') is performed in (or controlled by) the stack. A decision to enable security processing on a connection can be based on configuration data or security policy, and can also be controlled using explicit enablement directives. Directives may also be provided for allowing applications to communicate with the security processing in the stack for other purposes. Functions within the protocol stack that need access to clear text can now be supported without loss of security processing capability. No modifications to application code, or in some cases only minor modifications (such as inclusion of code to invoke directives), are required to provide this security processing. Improved offloading of security processing is also disclosed, which provides processing efficiencies over prior art offloading techniques. Offload components can be controlled from the kernel, an SSL layer or an application.

Offload processing for secure data transfer

Discloses is a method of selective activation of server applications in a computer network system. The computer network system includes a server computer, a plurality of client computers, a set of server applications loaded on the server computer, and a given protocol stack for managing activation of the server applications. The method comprises the steps of a system administrator defining a plurality of states for the network system and specifying conditions to determine whether or not each of the server applications can be activated in each of said states. The given protocol stack then manages activation of the server applications in accordance with said specified conditions.

Selective activation of TCP/IP link and traffic

An operating system allows assignment of an input message priority to a particular socket. This priority is used by the operating system to determine what socket's inbound packets get discarded when the server resources are constrained. Sockets of a lower priority than another will have its inbound packets discarded before higher priority sockets. This allows an application to give selected sockets higher inbound message priority over other sockets.

Growing community of inventors

Brewster, NY, United States of America

Mark Richard Gambino