Home
THAT MAY BE ACCESSED
|
|
Technical Examples
- Provided are a method, system, and program for processing packets from an Input/Output (I/O) device. Information is maintained indicating a first buffer and second buffer for use with each descriptor, wherein one of the first and second buffers is assigned to the descriptor used by the I/O device, and wherein the I/O device write packets to the buffers assigned to the descriptors. The first buffer including a packet from the I/O device is accessed, wherein the accessed first buffer is assigned to an accessed descriptor. The packet in the accessed first buffer is processed and if the second buffer assigned to the accessed descriptor is available, then information for the accessed descriptor is updated to indicate that the second buffer is assigned to the accessed descriptor before completing the processing of the packet in the first buffer.
- A caching manager calculates cache priories for accessed items, including items not currently stored in the cache. The cache manager determines an item's cache priority as a function of the item's access frequency, retrieval cost and size. The cache manager dynamically updates cache priorities as items are accessed. When the cache is full and a non-cached item is accessed, the cache manager uses cache priorities to determine whether to overwrite a cached item with the non-cached accessed item. If the accessed item has a lower cache priority than all of the items in the cache, then the non-cached item is not stored in the cache. If any item in the cache has a lower cache priority than the accessed item, then the cache manager stores the accessed item in the cache, overwriting the cached item with the lowest cache priority.
- A method is provided for handling errors in a data storage system. The method includes determining a number of sectors to be accessed. Also, all sectors from the number of sectors are accessed during a first access routine. Next, error sectors are identified and the error sectors are accessed during a second access routine.
- Provided is a method, system, and program for verifying a network address. A network address included within a file is accessed. At least one context term is provided. Content is accessed at the network address in the file and a determination is made as to whether the accessed content satisfies a qualifying threshold with respect to the at least one context term.
- A method of assigning transaction timestamps for use with a database that includes temporal data and may include non-temporal data. In the method, a lock is placed on a resource accessed by a first transaction to prevent conflicts with concurrently executing transactions. An access record of the lock mode and a timestamp of the first transaction is created for the resource accessed by the first transaction. The access record is accessed to determine whether a resource that a subsequent transaction accesses conflicts with the resource accessed by the first transaction. A timestamp lower bound or floor is identified for the subsequent transaction when the subsequent transaction accesses a resource that conflicts with the resource access of the first transaction. A timestamp is assigned to the subsequent transaction that is greater than the lower bound. The access record of a lock mode and a transaction timestamp may be created each time a resource is accessed, may be created for resources accessed after a request for CURRENT TIME is made, and/or may be made for resources accessed after an end time of a time interval defined by a request for CURRENT TIME.
Thank you for using Findownersearch.com. If you have any comments or suggestions, please contact us.