Abstract: Disclosed method, system and computer readable storage medium embodiments for providing hardware-efficient universal hashing functions include performing a first hash function on a received input key or a bit sequence derived from the received input key to generate a hashed input key, selecting a plurality of input key portions from the hashed input key, accessing, a respective permutation table for each of the input key portions from a group of permutation tables to generate a permuted key portion, and combining at least the generated permuted key portions to form a hash value.

Abstract: Disclosed method, system and computer readable storage medium embodiments for providing hardware-efficient universal hashing functions include performing a first hash function on a received input key or a bit sequence derived from the received input key to generate a hashed input key, selecting a plurality of input key portions from the hashed input key, accessing, a respective permutation table for each of the input key portions from a group of permutation tables to generate a permuted key portion, and combining at least the generated permuted key portions to form a hash value.

Abstract: Methods, systems, and computer program products are provided for efficient packet replication. In an embodiment, a packet is stored as a linked list of at least one page. Replicating the packet comprises creating a new header page and linking it to the first page of the linked list. Each replica packet may be transmitted independently and concurrently. In an embodiment where packets are stored in queues, each replica packet may be dequeued for transmission independently and concurrently. After all references to a page have been transmitted (or dequeued), the page may be freed.

Abstract: A method for classifying an incoming packet. The method includes maintaining a database associated with patterns of fields, where the fields can be network addresses. The database can be developed by mapping each pattern to a unique numeric identifier. The number of unique numeric identifiers is equal to the number of patterns, and the size of each unique numeric identifier is substantially smaller than the field of each pattern. The database can be further developed by determining a range of one or more of the unique numeric identifiers to be associated with each pattern. The range for each pattern can be bounded by a minimum unique numeric identifier and a maximum unique numeric identifier. The method also includes using a field of the incoming packet to determine an associated identifier for that field, where the associated identifier is equal to one of the unique numeric identifiers.

Abstract: A method for classifying an incoming packet. The method includes maintaining a database associated with patterns of fields, where the fields can be network addresses. The database can be developed by mapping each pattern to a unique numeric identifier. The number of unique numeric identifiers is equal to the number of patterns, and the size of each unique numeric identifier is substantially smaller than the field of each pattern. The database can be further developed by determining a range of one or more of the unique numeric identifiers to be associated with each pattern. The range for each pattern can be bounded by a minimum unique numeric identifier and a maximum unique numeric identifier. The method also includes using a field of the incoming packet to determine an associated identifier for that field, where the associated identifier is equal to one of the unique numeric identifiers.

Abstract: Methods, systems, and computer program products are provided for efficient packet replication. In an embodiment, a packet is stored as a linked list of at least one page. Replicating the packet comprises creating a new header page and linking it to the first page of the linked list. Each replica packet may be transmitted independently and concurrently. In an embodiment where packets are stored in queues, each replica packet may be dequeued for transmission independently and concurrently. After all references to a page have been transmitted (or dequeued), the page may be freed.

Abstract: A method for classifying an incoming packet. The method includes maintaining a database associated with patterns of fields, where the fields can be network addresses. The database can be developed by mapping each pattern to a unique numeric identifier. The number of unique numeric identifiers is equal to the number of patterns, and the size of each unique numeric identifier is substantially smaller than the field of each pattern. The database can be further developed by determining a range of one or more of the unique numeric identifiers to be associated with each pattern. The range for each pattern can be bounded by a minimum unique numeric identifier and a maximum unique numeric identifier. The method also includes using a field of the incoming packet to determine an associated identifier for that field, where the associated identifier is equal to one of the unique numeric identifiers.

Abstract: A method for classifying an incoming packet. The method includes maintaining a database associated with patterns of fields, where the fields can be network addresses. The database can be developed by mapping each pattern to a unique numeric identifier. The number of unique numeric identifiers is equal to the number of patterns, and the size of each unique numeric identifier is substantially smaller than the field of each pattern. The database can be further developed by determining a range of one or more of the unique numeric identifiers to be associated with each pattern. The range for each pattern can be bounded by a minimum unique numeric identifier and a maximum unique numeric identifier. The method also includes using a field of the incoming packet to determine an associated identifier for that field, where the associated identifier is equal to one of the unique numeric identifiers.

Abstract: A non-volatile storage subsystem comprises a media I/O controller, a media access channel, and movable storage media. A non-volatile disk storage subsystem bas a read channel coupling a disk controller to a disk head assembly. A read channel interfacing subsystem is provided as part of the storage subsystem, and the read channel interfacing subsystem interfaces a disk controller to the read channel. The read channel interfacing subsystem comprises a set of process units and a pipeline manager.

Abstract: A method of storing data on a surface of a storage disk, the data being capable of verifying an identity of the surface, includes determining first check data from first alignment correction data associated with a first storage surface. The method also includes determining second check data from second alignment correction data associated with a second storage surface such that the second check data is different from the first check data if the first and second alignment correction data are identical. The method further includes writing the first and second check data to the first and second storage surfaces in association with the first and second alignment correction data, respectively.

Abstract: A method and circuit for controlling a FIFO buffer such that the buffer can accommodate more than one data block simultaneously without overlapping data between adjacent data blocks. The FIFO buffer has a read-pointer address register and a write-pointer address register and a bank of write-capture registers including at least a first pair and a second pair. The first pair of registers captures and saves the write-pointer addresses associated with the beginning and ending of a first data block written to the FIFO buffer register while the second pair of registers captures and saves the write-pointer addresses associated with the beginning and ending of a second data block written to the FIFO buffer. The first pair and second pair alternate in capturing and saving beginning and ending addresses of a plurality of data blocks written to the FIFO buffer.

Abstract: A method and circuit for controlling a FIFO buffer such that the buffer can accommodate more than one data block simultaneously without overlapping data between adjacent data blocks. The FIFO buffer has a read-pointer address register and a write-pointer address register and a bank of write-capture registers including at least a first pair and a second. The first pair of registers captures and saves the write-pointer addresses associated with the beginning and ending of a first data block written to the FIFO buffer register while the second pair of registers captures and saves the write-pointer addresses associated with the beginning and ending of a second data block written to the FIFO buffer. The first pair and second pair alternate in capturing and saving beginning and ending addresses of a plurality of data block written to the FIFO buffer.

Abstract: A method of data transfer in a data processing system having at least one source buffer and at least one destination buffer. The source buffer includes a plurality of data blocks, each data block having an address and being for storage of data including an identifier uniquely identifying that data block. The destination buffer includes a plurality of data blocks corresponding to the data blocks of the source buffer, each destination block having an address and being for storage of data. Each source block identifier is a function of a corresponding destination block address.

Abstract: Momentary contact with a defect site of a data storage disk or free particle by a magnetoresistive read element of a flying head causes momentary heating and unwanted increase in element resistance (thermal asperity) which can disrupt hard disk drive data reading operations. Since the disk carries a predetermined data format, the disk drive controller correlates location of a thermal asperity to the format and thereupon selects from several available thermal asperity recovery methods a method most likely to minimize thermal asperity effect upon disk drive operation during rereading of data at the thermal asperity location.