Abstract: A method for implementing defragmentation of a data area is provided. The method includes receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.

Abstract: A method for implementing defragmentation of a data area is provided. The method includes receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.

Abstract: Techniques are provided for replicating database contents to network-enabled remote systems, and limiting such replication with respect to sensitive database contents. An indication is received that a subset of record fields in a database comprise sensitive data. The subset of indicated record fields are flagged based on the received indication. At least a portion of the database is replicated to multiple remote systems, such that for at least a first of the remote systems, data associated with a larger plurality of record fields is provided to the remote system. For at least a second of the remote systems, based on the flagging of the subset of indicated record fields, only data associated with record fields other than the flagged subset is provided to the remote system.

Abstract: A method for implementing defragmentation of a data area is provided. The method includes receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.

Abstract: Techniques are provided for replicating database contents to network-enabled remote systems, and limiting such replication with respect to sensitive database contents. An indication is received that a subset of record fields in a database comprise sensitive data. The subset of indicated record fields are flagged based on the received indication. At least a portion of the database is replicated to multiple remote systems, such that for at least a first of the remote systems, data associated with a larger plurality of record fields is provided to the remote system. For at least a second of the remote systems, based on the flagging of the subset of indicated record fields, only data associated with record fields other than the flagged subset is provided to the remote system.

Abstract: The disclosed herein provides a method, system, and/or computer program product for determining control of a processing resource. To determine control of the processing resource, the method, system, and/or computer program can set a control-loss flag indicating whether a process has control of the processing resource and check the control-loss flag to determine whether the process lost control of the processing resource.

Abstract: Embodiment herein relate to generating an offset information tree. The offset information tree includes a plurality of nodes. Each node further includes offset information that corresponds to a data portion of a data area. A node can be identified from the plurality of nodes in response to a request for access to the data area. Further, offset information can be determined from the node identified from the plurality of nodes and that the offset information can be utilized to directly access a desired data portion of the data area.

Abstract: Embodiment herein relate to generating an offset information tree. The offset information tree includes a plurality of nodes. Each node further includes offset information that corresponds to a data portion of a data area. A node can be identified from the plurality of nodes in response to a request for access to the data area. Further, offset information can be determined from the node identified from the plurality of nodes and that the offset information can be utilized to directly access a desired data portion of the data area.

Abstract: 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.

Abstract: 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.

Abstract: A method for implementing defragmentation of a data area is provided. The method includes receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.

Abstract: A method for implementing defragmentation of a data area is provided. The method may include receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.

Abstract: A method for implementing defragmentation of a data area is provided. The method may include receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.

Abstract: 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.

Abstract: A method of dynamic linkage including: receiving a request to launch a program; checking a system memory for the program; reserving a unique memory block of the system memory for the program and loading the program into the unique memory block if the program is not found in the memory of the system; performing internal memory relocations for the program if the program is not found in the memory of the system; ensuring that a library required by the program has been loaded into the system memory if the program is not found in the memory of the system; and invoking the program.

Abstract: 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.

Abstract: 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.

Abstract: A common symbol table is generated, which includes symbols of a plurality of independent applications. The symbols included in the common symbol table are common symbols of the applications. The bulky information associated with the common symbols are stored in the common symbol table, and stubs used to locate the common symbols are stored in local tables of the applications.

Abstract: 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.

Abstract: 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.