Abstract: An example method includes providing at least two data storage areas in a memory, providing a first amount of over-provisioning for a first of the at least two data storage areas and a second amount of over-provisioning for a second of the at least two data storage areas, categorizing data based on a characteristic of the data, and storing the data in one of the at least two data storage areas based on the categorization.

Abstract: Method and apparatus for using block level quality of service (QOS) data in a data storage device. A memory space is provided with a plurality of physical data storage blocks, such as data sectors on a magnetic disc. The QOS data identify at least one QOS characteristic for each of the available blocks. Transfers of user data between the blocks and a host device are preferably carried out in relation to the QOS data. In some preferred embodiments, the QOS data identifies a certification state for each of the blocks. In this way, the device is manufactured with less than all of the blocks having been successfully certified, and the remaining blocks are certified by the device during field use. In other preferred embodiments, the QOS data include a virus scan status, an access history, a write status, or an overlapped track indication for each said block.

Abstract: A method includes programming a non-volatile memory. The memory includes a plurality of cells, wherein each cell is configured to store a plurality of values, wherein each of value is represented by N digits where N is an integer greater than 1, wherein each of the plurality of cells is further configured to store electric charge representing a plurality of voltage levels, and wherein each of the plurality of voltage levels represents one of the plurality of values. Programming comprises providing the plurality of voltage levels into a first group of voltage levels and a second group of voltage levels in one of the plurality of cells, wherein a highest voltage level of the first group is less than or substantially equal to a lowest voltage level of the second group, and storing, in the first group of voltage levels, electric charge representing a value comprising, at most, N-1 digits.

Abstract: A method of identifying a string or chain of efficient or “good enough” disc operations for processing (a pseudo optimal chain) is provided. A “pseudo optimal chain” comprises a string or chain of operations that, while not necessarily the optimal string or chain, provides an efficient sequence of operations that can be determined by comparing individual operations to predetermined selection criteria. In contrast to a true optimization technique that can require computing up to N! combinations for N operations, the string or chain of efficient or “good enough” disc operations allows for relatively simpler computations.

Abstract: A method includes programming a non-volatile memory. The memory includes a plurality of cells, wherein each cell is configured to store a plurality of values, wherein each of value is represented by N digits where N is an integer greater than 1, wherein each of the plurality of cells is further configured to store electric charge representing a plurality of voltage levels, and wherein each of the plurality of voltage levels represents one of the plurality of values. Programming comprises providing the plurality of voltage levels into a first group of voltage levels and a second group of voltage levels in one of the plurality of cells, wherein a highest voltage level of the first group is less than or substantially equal to a lowest voltage level of the second group, and storing, in the first group of voltage levels, electric charge representing a value comprising, at most, N?1 digits.

Abstract: Methods and systems are disclosed to generate a data map for a data storage device. A data map may be generated by scanning, during a power-on initialization process, data units of data stored on a data storage medium of a data storage device. The scanning may start from a selected data unit and proceed through the data units in an order opposite to a write order to identify a first data unit that is not fully erased. Also. an error recovery status of the first data unit may be determined based on an error correction code. A likely erased status of the first data unit may be assigned when the determined error recovery status is unrecoverable.

Abstract: The present disclosure describes various techniques resolving block boundary issues and reconstructing logical blocks in a block access storage device when there are resulting mismatches between logical and physical block sizes or alignments, such that logical blocks span multiple physical block boundaries in irregular ways. In one example, a method comprises the following features: receiving logical block addresses that are associated with a sequence of logical blocks; and locating a first portion of a logical block within a first physical block that is stored in a block access storage device based upon a logical block address of the logical block, wherein the logical block is part of the sequence of logical blocks, and wherein at least two logical blocks within the sequence of logical blocks have different sizes.

Abstract: A storage device, e.g., an SSD, is configured to enable spanning for a logical block between pages of the device. In one example, a device includes a data storage module to receive data to be stored, wherein the data comprises a plurality of logical blocks, and wherein a size of the plurality of logical blocks exceeds a size of a first page of the device, and a spanning determination module to determine whether to partition one of the plurality of logical blocks into a first partition and a second partition, wherein the data storage module is configured to partition the one of the plurality of logical blocks into the first partition and the second partition and to store the first partition in the first page and the second partition in a second, different page when the spanning determination module determines to partition the one of the plurality of logical blocks.

Abstract: Embodiments of the disclosure include multilevel memory cell devices that utilize reference point cells to determine the states of other cells. Embodiments of the disclosure also include methods of storing data to and retrieving data from multilevel memory cell devices utilizing reference point cells. In one embodiment, a multilevel memory cell device includes user data cells, a reference point cell, and a controller. The user data cells each has one of a plurality of states. The reference point cell has a first state. The controller determines the states of the user data cells based at least in part on the first state of the reference point cell.

Abstract: The application relates to defect management using mutable logical to physical association. Embodiments disclosed utilize mutable mapping between logical blocks and physical blocks. Dynamically updated mapping data, which mutably associates the logical blocks and the physical blocks, also includes physical block defect allocations.

Abstract: The application relates to defect management using mutable logical to physical association. Embodiments disclosed utilize mutable mapping between logical blocks and physical blocks. Dynamically updated mapping data, which mutably associates the logical blocks and the physical blocks, also includes physical block defect allocations.

Abstract: A method and apparatus for managing a buffer memory in a disc drive. An arbitrated buffer stores data read from, or to be written to, the disc. Sequential entries (that store pointers to the data) in the buffer, corresponding to a requested traversal, are traversed prior to voluntarily relinquishing ownership of the buffer.

Abstract: Method and apparatus for using block level quality of service (QOS) data in a data storage device. A memory space is provided with a plurality of physical data storage blocks, such as data sectors on a magnetic disc. The QOS data identify at least one QOS characteristic for each of the available blocks. Transfers of user data between the blocks and a host device are preferably carried out in relation to the QOS data. In some preferred embodiments, the QOS data identifies a certification state for each of the blocks. In this way, the device is manufactured with less than all of the blocks having been successfully certified, and the remaining blocks are certified by the device during field use. In other preferred embodiments, the QOS data include a virus scan status, an access history, a write status, or an overlapped track indication for each said block.

Abstract: Aspects of the invention include a method and apparatus to manage the cache memory of a disc drive. In one aspect the data rates of different file read and write threads are used to determine the minimum seek time to allow the cache to be used more efficiently. In another aspect, the read/write cache segments are adjusted by determining the summation of the ratio between read/write cache segment sizes and the respective data rates and then adjusting the segment sizes to minimize the seek times for the data streams.

Abstract: Aspects of the invention include a method and apparatus to manage the cache memory of a disc drive. In one aspect the data rates of different file read and write threads are used to determine the minimum seek time to allow the cache to be used more efficiently. In another aspect, the read/write cache segments are adjusted by determining the summation of the ratio between read/write cache segment sizes and the respective data rates and then adjusting the segment sizes to minimize the seek times for the data streams.

Abstract: A method and apparatus for managing a buffer memory in a disc drive. An arbitrated buffer stores data read from, or to be written to, the disc. Sequential entries (that store pointers to the data) in the buffer, corresponding to a requested traversal, are traversed prior to voluntarily relinquishing ownership of the buffer.

Abstract: A method of controlling an actuator in a disc drive to perform a seek operation prior to a read operation is disclosed. A radial distance between the initial track and the target track is determined. A rotational distance between the initial head rotational position and the target rotational position is also determined. The magnitude of the performance benefit to be gained by reading pre-fetch and post-fetch data is estimated. Then a seek velocity profile is selected based on the radial distance, the rotational distance and the estimated magnitude of the performance benefit that would be gained by reading pre-fetch and post-fetch data. The actuator then is controlled using the selected seek profile. A disc drive for implementing this method is also provided.