摘要:
Changed data of castout classes of a coupling facility cache are managed in order to be able to efficiently determine the age of the oldest changed data in the cache. A directory entry representing a changed datum is placed in a data structure corresponding to the castout class of the changed datum. The data structure includes an order queue ordered by timestamps and a process queue, having an ordered portion and an unordered portion. When the directory entry is to be added to the data structure, an attempt is first made to place the entry on the order queue. If the entry is not placed on the order queue within a predefined amount of time, then the entry is placed on the process queue, the order of which is maintained by background tasks. In order to return the oldest entry of the data structure, the smallest entry of the process queue is determined and that entry is then compared to the smallest entry of the order queue. The smaller of those two entries corresponds to the oldest entry for the castout class.
摘要:
Storage structures of a shared storage processor of a computing environment are copied. A copy operation for a storage structure of the shared storage processor is initiated. Although the storage structure is owned by an exploiter of the storage structure, at least a portion of the contents of the storage structure is copied via an operating system of the computing environment. The at least a portion of the contents are copied from the storage structure to another storage structure of the computing environment. Both storage structures may be located within the same shared storage processor or within different shared storage processors.
摘要:
Fully-associative non-linear collections of items are browsed. At least a portion of a fully-associative non-linear collection of items is segmented into a plurality of segments. This segmenting is transparent to any browsers of the fully-associative non-linear collection of items. The plurality of segments is then browsed by multiple browsers.
摘要:
Cache structures of a shared storage processor of a computing environment are copied. A copy operation for a cache structure of the shared storage processor is initiated. Although the cache structure is owned by an exploiter of the cache structure, one or more objects of the cache structure are copied via an operating system of the computing environment. The one or more objects are copied from the cache structure to another cache structure of the computing environment. Both cache structures may be located within the same shared storage processor or within different shared storage processors.
摘要:
A method and apparatus for dynamically controlling the dispatching of a coupling facility operating in a logical partition sharing a processor resource with one or more other logical partitions issuing requests to the coupling facility. A plurality of coupling facility dispatching modes differing in their relative dispatch duration are defined. One dispatching mode is initially selected, and the number of requests received from the other logical partitions within a predetermined interval while in a selected dispatching mode is determined. Transitions between the defined dispatching modes are made in accordance with the number of requests received within the sampling interval in the selected dispatching mode. The method and apparatus are especially suitable for controlling the dispatching of a backup coupling facility, whose polling loop would otherwise consume processor resources usable by other logical
摘要:
Restarting of coupling facility commands. A restart token is obtained from one coupling facility command and used to restart another coupling facility command. The command from which the restart token is obtained is a different command from the command being restarted. In one example, the command being restarted is a duplexed command.
摘要:
A coupling facility is coupled to one or more other coupling facilities via one or more peer links. The coupling of the facilities enables various functions to be supported, including the duplexing of structures of the coupling facilities. Duplexing is performed on a structure basis, and thus, a coupling facility may include duplexed structures, as well as non-duplexed or simplexed structures.
摘要:
A method and apparatus of assigning and releasing locks, in a network computing environment having a plurality of central processing units coupled to a high performance locking facility. The method comprises of the steps of first receiving and processing a lock operation synchronous to any requesting central processor unit requesting a lock and then recording lock names and lock states in entry records of a lock table based on the requests. When a request is being processed, providing high-speed searching to search any particular lock entry in the table and altering and modifying the table accordingly. Finally an appropriate response and the status of the lock state will be generated and sent to other requesters requesting the lock.
摘要:
A method of assigning and releasing locks, in a network computing environment having a plurality of central processing units coupled to a high performance locking facility. The method comprises of the steps of first processing multiple requests for locking operations simultaneously and then recording lock names and lock states in entry records of a lock table based on the requests. When a request is being processed, providing high-speed searching to search any particular lock entry in the table and altering and modifying the table accordingly. Finally an appropriate response and the status of the lock state will be generated and sent to other requestors requesting the lock.
摘要:
The present invention provides for a computer program product and device including instructions executable by a digital processing apparatus for conducting a high-performance locking facility. At first multiple requests for locking operations are processed and received simultaneously and their lock names and lock states are recorded in entry records of a lock table based on the requests. Next high-speed searching of any particular lock entry in this table is performed followed. The table can be altered and modified at this time as well accordingly depending upon lock status that is being processed. Finally an appropriate response is generated and the status of the lock state is provided to those requesting the lock.