Data storage device shifting data chunks of alignment zone relative to sector boundaries

Information

  • Patent Grant
  • 9063838
  • Patent Number
    9,063,838
  • Date Filed
    Monday, January 23, 2012
    12 years ago
  • Date Issued
    Tuesday, June 23, 2015
    9 years ago
Abstract
A data storage device is disclosed comprising a non-volatile memory comprising a plurality of sectors. At least one alignment zone is defined in the non-volatile memory comprising a plurality of chunks including a plurality of data chunks and a plurality of pad chunks, wherein each chunk comprises a plurality of sectors. Each sector is operable to store X host blocks, the alignment zone comprises at least X−1 pad chunks, and control circuitry is operable to shift the data chunks of the alignment zone by a number of chunks equal to or less than X−1 plus a corresponding offset.
Description
BACKGROUND

A data storage device (e.g., a disk drive or a solid state drive) comprises control circuitry and a non-volatile memory, such as a disk or a flash memory. The non-volatile memory comprises a plurality of memory segments referred to as sectors. To facilitate defect mapping, the sectors are accessed indirectly through logical block addresses (LBAs). In this manner, if a sector degrades, the system/user data can be relocated to a spare sector and the corresponding LBA(s) remapped to the spare sector.


The LBAs of a data storage device may be divided into a number of partitions, wherein each partition stores a file system (e.g., a n-bit FAT file system, or a NT File System) identifying system files and user files. A partition may be bootable meaning that it stores a bootable operating system (OS) such as Windows OS or Mac OS. When a computer system is initially powered on, a master boot record (MBR) is read from the data storage device (typically stored in the first logical data sector). The MBR identifies a partition table that stores a partition map for each partition of the data storage device. The partition table typically includes up to four primary partition maps identifying up to four primary partitions, wherein a primary partition may be further subdivided into extended partitions. Each partition map (primary and extended) identifies a starting LBA and ending LBA of the corresponding partition, a file system type field, and a flag indicating whether the partition is bootable. When the computer system finds a bootable partition, it uses the file system type field to access the partition's file system in order to read and execute the OS files from the partition (i.e., boot the computer system).





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1A shows a data storage device according to an embodiment of the present invention comprising control circuitry and a non-volatile memory comprising a plurality of sectors.



FIG. 1B shows an embodiment of the present invention wherein each sector stores eight host blocks, and a chunk is defined as comprises a plurality of sectors.



FIG. 1C is a flow diagram according to an embodiment of the present invention wherein at least one alignment zone in the non-volatile memory is defined as having a plurality of data chunks and pad chunks, wherein the pad chunks facilitate shifting the data chunks within the alignment zone.



FIG. 1D illustrates an embodiment of the present invention wherein the data chunks of an alignment zone are shifted right by three chunks, then left by two chunks, then left by one chunk while maintaining a copy of the data chunks.



FIG. 2 illustrates in more detail the process of shifting the data chunks right by three chunks, then left by two chunks, then left by one chunk while maintaining a copy of the data chunks.



FIGS. 3A-3D illustrate an embodiment of the present invention wherein the data chunks are shifted right by seven chunks corresponding to an offset of seven host blocks.



FIG. 4 is a flow diagram according to an embodiment of the present invention wherein boundaries of alignment zones are modified relative to partitions.



FIGS. 5A-5C illustrate an embodiment of the present invention wherein the end boundary of a first alignment zone and the beginning boundary of a second alignment zone are modified relative to first and second partitions.



FIG. 6 illustrates an embodiment of the present invention wherein the data storage device comprises a disk drive.



FIG. 7 illustrates an embodiment of the present invention wherein the data storage device comprises a solid state drive.





DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION


FIG. 1A shows a data storage device 2 according to an embodiment of the present invention comprising a non-volatile memory 4 comprising a plurality of sectors. The data storage device 2 further comprises control circuitry 6 operable to define at least one alignment zone in the non-volatile memory comprising a plurality of chunks including a plurality of data chunks and a plurality of pad chunks (an example is shown in FIG. 1D), wherein each chunk comprises a plurality of sectors. Each sector is operable to store X host blocks (an example is shown in FIG. 1B), the alignment zone comprises at least X−1 pad chunks, and the control circuitry 6 is operable to shift the data chunks of the alignment zone by a number of chunks equal to or less than X−1 plus a corresponding offset.



FIG. 1C is a flow diagram illustrating an embodiment of the present invention wherein after defining at least one alignment zone (step 8), the data chunks are first shifted right by N1 chunks (e.g., three chunks in FIG. 1D) plus a first offset while maintaining at least one copy of the data chunks (step 10). The data chunks are then second shifted left by N2 chunks (e.g., two chunks in FIG. 1D) plus a second offset while maintaining at least one copy of the data chunks (step 12), and then the data chunks are third shifted left by N3 chunks (e.g., one chunk in FIG. 1D) plus a third offset while maintaining at least one copy of the data chunks (step 14), wherein the first, second, and third offsets represent different fractions of a sector, and the first, second, and third shifts are consecutive.


In the embodiment of FIG. 1B, each sector of the non-volatile memory 4 stores eight host blocks, wherein a logical block address (LBA) maps each host block to a physical block address (PBA) of a sector. In order to write a sector, the control circuitry writes eight host blocks (eight LBAs) to the corresponding PBA. If the LBAs of a write command do not align with the boundary of a sector, the control circuitry reads the sector, modifies the sector data with the new data, and then writes the modified sector data (read-modify-write). The read-modify-write operations are undesirable since it reduces the performance of the data storage device.


A write command may be misaligned with the sectors of the non-volatile memory 4 due to a number of reasons, such as if a host defines a file based on an LBA range that does not align with the sector boundaries. In one embodiment, a host accesses the data storage device based on a plurality of partitions defined in the non-volatile memory. If the boundaries of the partitions do not align with the boundaries of a sector, it is more likely the LBAs of the host files will also not align with the sector boundaries, thereby increasing the number of read-modify-write operations. Accordingly in one embodiment when a misalignment of write commands with the sector boundaries is detected, the data chunks of an alignment zone are shifted by an offset that corresponds to the misalignment. In the embodiment of FIG. 1B, the write commands may be misaligned with the sector boundaries by an offset of zero, one, two, three, four, five, six or seven host blocks (LBAs). In the embodiments of the present invention, each sector may store any suitable number of host blocks (e.g., four host blocks) so that there may be any suitable corresponding number of offsets (e.g., four offsets). In addition, in the embodiments of the present invention the offset for the write commands may change over time (e.g., if the partition boundaries are modified over time). When the offset of the write commands changes, the alignment zones are again shifted to account for the change in the offset.



FIG. 1D illustrates an example where an initial offset of three is detected for the write commands, and therefore the data chunks of the alignment zone are shifted right by three chunks. At some point a new offset of one is detected for the write commands, and therefore the data chunks of the alignment zone are shifted left by two chunks. Thereafter a new offset of zero is detected for the write commands, and therefore the data chunks of the alignment zone are shifted left again by one chunk. In the embodiments of the present invention, the pad chunks in the alignment zone enable the data chunks to be shifted right or left consecutively to accommodate any offset for the write commands that may be detected over time. The pad chunks also enable the data chunks to be shifted while maintaining a copy of the data chunks, thereby providing data protection during abnormal conditions, such as a power failure.



FIG. 2 shows further details of how the data chunks are shifted in an alignment zone for the example shown in FIG. 1D, including how a copy of the data chunks is maintained during the shifting operation. At step 16, the alignment zone begins with an offset of zero such that all of the pad chunks (seven in this example) are on the right side of the alignment zone. Step 18 shows the beginning of the shifting operation to align the alignment zone with an offset of three. The last data chunk 48 in the alignment zone is copied over pad chunk 50 (three chunks to the right). While copying data chunk 48 over pad chunk 50, data chunk 48 remains intact so that a copy of all the data chunks is maintained. The mapping information (LBA to PBA mapping) for accessing data chunk 48 also remains unchanged so that the original copy is used to service access requests (write/read) during the shift operation. After copying data chunk 48 over pad chunk 50 (step 20), the mapping information for data chunk 48 is changed to chunk 50, and chunk 48 is converted into a pad chunk. This process is repeated at steps 22 and 24 for data chunk 52 and pad chunk 54 and so on until all of the data chunks have been shifted right by three chunks as shown in step 26. After shifting the data chunks right by three chunks, there are three pad chunks on the left side of the alignment zone and four pad chunks on the right side of the alignment zone.


At step 28 a new offset of one is detected for the write commands, which means the data chunks need to be shifted left by two chunks. The shift procedure begins by copying the first data chunk 56 over pad chunk 58 (two pad chunks to the left). After copying data chunk 56 over pad chunk 58 (step 30), the mapping information (LBA to PBA mapping) for data chunk 56 is changed to chunk 58, and chunk 56 is converted into a pad chunk. This process is repeated at steps 32 and 34 for data chunk 60 and pad chunk 62 and so on until all of the data chunks have been shifted left by two chunks as shown in step 36. After shifting the data chunks left by two chunks, there is one pad chunk on the left side of the alignment zone and six pad chunks on the right side of the alignment zone.


At step 38 a new offset of zero is detected for the write commands, which means the data chunks need to be shifted left by one chunk. The shift procedure begins by copying the first data chunk 64 over pad chunk 66 (one pad chunk to the left). After copying data chunk 64 over pad chunk 66 (step 40), the mapping information (LBA to PBA mapping) for data chunk 64 is changed to chunk 66, and chunk 64 is converted into a pad chunk. This process is repeated at steps 42 and 44 for data chunk 68 and pad chunk 70 and so on until all of the data chunks have been shifted left by one chunk as shown in step 46. After shifting the data chunks left by one chunk, there are zero pad chunks on the left side of the alignment zone and seven pad chunks on the right side of the alignment zone.


In one embodiment of the present invention, the number of pad chunks in an alignment zone equals one less than the number of possible offsets that the data chunks may be shifted. In the example of FIGS. 1B and 1D, there are eight host blocks per sector and therefore there are eight possible offsets (0-7) and seven pad chunks to facilitate the offsets. In general, each sector is operable to store X host blocks, and an alignment zone comprises at least X−1 pad chunks. The control circuitry 6 is operable to shift the data chunks of an alignment zone by a number of chunks equal to or less than X−1 plus a corresponding offset. An alignment zone may comprise Y pad chunks at the beginning of the alignment zone and X−Y−1 pad chunks at the end of the alignment zone, where Y corresponds to a number of chunks the data chunks are shifted right in the alignment zone.



FIGS. 3A-3D illustrate an example embodiment wherein the offset detected for the write commands is seven meaning that the starting LBA of a write command is usually offset by seven host blocks (seven LBAs) relative to a sector as shown in FIG. 3B. In order to align subsequent write commands with a sector boundary, the LBA to PBA mapping of the alignment zone is shifted right by seven as shown in FIG. 3C meaning that the offset for the alignment zone is seven.



FIG. 3A shows the alignment zone prior to shifting the data chunks right by seven chunks. The alignment zone comprises a plurality of data chunks, each data chunk comprises a plurality of sectors, and each sector is accessed through LBAs 0 to N. In this example each sectors stores eight host blocks (accessed through eight LBAs) and therefore the alignment zone comprises at least seven pad chunks. The alignment zone also comprises an additional pad sector (PS) to facilitate shifting the LBA to PBA mapping. The pad sector (PS) is shown at the end of the alignment zone which corresponds to an offset of seven. If the offset is less than seven, the pad sector (PS) will be the first sector of the first pad chunk after performing the shift operation.



FIG. 3B shows further details of each sector accessed through a PBA (e.g., PBA0), wherein each LBA is mapped to an eighth of the sector (e.g., PBA0[0], PBA0[1] . . . PBA0[7] where PBA0 represents the first physical sector of a chunk). An “NA” is shown in place of the LBA for the sectors of the pad chunks and the pad sector meaning there is no LBA yet assigned to these sectors. FIG. 3C shows the LBA to PBA mapping after shifting the data chunks by seven chunks and after shifting the LBA to PBA mapping by seven LBAs. In the example of FIG. 3C, LBA 1 represents the start of a write command (e.g., at the start of a partition) which is aligned with the boundary of sector PBA1 of the first data chunk after shifting the data chunks. FIG. 3C also shows how the LBA sequence has been shifted into the sectors of the pad chunks as well as the pad sector (PS) (i.e., shifted by seven LBAs into the pad sector (PS) corresponding to the offset of seven).



FIG. 3D shows the alignment zone after shifting the data chunks right by seven chunks, wherein the last data chunk extends into the pad sector (PS). With an offset of seven, all seven pad chunks end up on the left side of the alignment zone. If, for example, an alignment zone is shifted with an offset of four, the data chunks would be shifted right by four chunks leaving four pad chunks on the left side of the alignment zone. The last data chunk of the alignment zone would extend into the first sector of the adjacent pad chunk by four host blocks (similar to the host blocks extending into the pad sector (PS) as shown in FIG. 3C).


Including at least X−1 pad chunks in an alignment zone (where X is the number of host blocks stored in a sector) enables the data chunks of the alignment zone to be shifted left or right corresponding to any offset (e.g., offset 0-7) while maintaining at least one copy of the data chunks. In this manner, any change to the offset of write commands that may occur over time can be accounted for in a fail safe manner since there is always at least one copy of the data chunks. For example, the offset of write commands may change over time due to the boundaries of a partition map being modified over time. In the example of FIG. 1D, the offset of a partition map may initially be zero, and then change to an offset of three, and then change to an offset of two, and then change back to an offset of zero. Accordingly, the data chunks can be shifted right, and then shifted left, and then shifted left again as illustrated in FIG. 1D and FIG. 2 due to having at least X−1 pad chunks in the alignment zone.



FIG. 4 is a flow diagram executed by the control circuitry 6 according to another embodiment of the present invention wherein a plurality of alignment zones are defined including a first alignment zone and a second alignment zone (step 72), wherein each alignment zone comprises a plurality of chunks including a plurality of data chunks and a plurality of pad chunks, and each chunk comprises a plurality of sectors. A partition map is evaluated that defines a plurality of partitions including a first partition and a second partition, and each partition defines a start LBA and an end LBA (step 74). A boundary of the first alignment zone is modified relative to the end LBA of the first partition (step 76).



FIG. 5A shows an example where four alignment zones are defined Z1-Z4 each comprising a plurality of data chunks and a plurality of pad chunks. FIG. 5A also shows an example where two partitions are defined by a partition map, where each partition defines a start LBA and an end LBA. In this example, each alignment zone initially has the same number of data chunks which are aligned with an offset of zero (the data chunks are all shifted to the left side of each alignment zone). FIG. 5A also shows how the number of data chunks in an alignment zone does not integer divide into the size of a partition which means at least one alignment zone will straddle a partition boundary. Accordingly, in an embodiment of the present invention the boundaries of the alignment zones as well as the number of data chunks within each alignment zone are modified so that the number of data chunks integer divides into each partition.



FIG. 5B shows an example of how the boundaries of the alignment zones may be modified by shifting the ending boundary of alignment zone Z1 and the beginning boundary of alignment zone Z2. To facilitate modifying the boundaries, a number of data chunks in alignment zone Z2 are reassigned to alignment zone Z1 as shown in FIG. 5B. Reassigning the data chunks may include copying data in the data chunks of alignment zone Z2 to alignment zone Z1, or the data chunks may be reassigned without copying data (e.g., if a data chunk in alignment zone Z2 is empty). After modifying the boundaries and reassigning the data chunks, the number of data chunks in alignment zone Z1 covers the LBAs of the first partition, and the number of data chunks in alignment zones Z2-Z4 cover the LBAs of the second partition. The boundaries of the alignment zones may be modified in any suitable manner to achieve a similar result, such as by modifying the boundaries so that alignment zones Z1-Z2 cover the first partition and alignment zones Z3-Z4 cover the second partition.


In one embodiment, the partitions may define a starting LBA that results in a different partition offset relative to the sectors. In the example of FIG. 5C, the first partition may have a partition offset of two, and the second partition may have a partition offset of six. Accordingly in this example embodiment, the data chunks in the first alignment zone Z1 are aligned relative to a first partition offset defined by the first partition, and the data chunks in the second alignment zone Z2 (and Z3-Z4) are aligned relative to a second partition offset defined by the second partition. Aligning the alignment zones relative to the partition offset is implemented by shifting the data chunks in each alignment zone as described above.


The flow diagrams disclosed herein may be carried out by a microprocessor executing code segments of a program stored on a computer readable medium. Any suitable computer readable storage medium capable of storing code segments may be employed, such as the data storage device being aligned, or a separate data storage device, such as a disk drive, or a flash memory, or a CD.


The embodiments of the present invention may be used to align a partition of any suitable data storage device. FIG. 6 shows a data storage device in the form of a disk drive comprising a head 78 actuated over a disk 80 having a plurality of tracks 82. The disk drive further comprises control circuitry 84 for receiving access commands from a host (write/read commands) and for generating a control signal applied to a voice coil motor (VCM) to rotate an actuator arm about a pivot in order to position the head 78 radially over the disk 80 to access a target track. Each track is divided into a number of sectors, wherein each sector is capable of storing multiple host blocks.



FIG. 7 shows a data storage device in the form of a solid state drive comprising a plurality of non-volatile semiconductor memories 86A, 86B, etc., such as flash memories, and control circuitry 88 for accessing the non-volatile semiconductor memories. In one embodiment, a sector of the solid state drive corresponds to a page of memory in a memory array, wherein each page stores a plurality of host blocks. A hybrid data storage device may also be employed comprising components of a disk drive shown in FIG. 6 combined with the non-volatile semiconductor memories shown in FIG. 7.

Claims
  • 1. A data storage device comprising a non-volatile memory comprising a plurality of sectors, and control circuitry operable to define at least one alignment zone comprising a plurality of chunks including a plurality of data chunks and a plurality of pad chunks, wherein: each chunk comprises a plurality of sectors;each sector is operable to store X host blocks, where X is an integer greater than one;the alignment zone comprises at least X−1 pad chunks; andthe control circuitry is operable to: shift the data chunks of the alignment zone by a non-zero integer number of chunks equal to or less than X−1 plus a corresponding offset;first shift the data chunks right by N1 chunks plus a first offset while maintaining at least one copy of the data chunks;after first shifting the data chunks right by N1 chunks, second shift the data chunks left by N2 chunks plus a second offset while maintaining at least one copy of the data chunks; andafter second shifting the data chunks left by N2 chunks, third shift the data chunks left by N3 chunks plus a third offset while maintaining at least one copy of the data chunks,wherein the first, second, and third offsets represent different fractions of a sector.
  • 2. The data storage device as recited in claim 1, wherein the first, second, and third shifts are consecutive.
  • 3. The data storage device as recited in claim 2, wherein: the alignment zone comprises Y pad chunks at the beginning of the alignment zone and X−Y−1 pad chunks at the end of the alignment zone, where Y is an integer greater than zero; andY corresponds to a number of chunks the data chunks are shifted right in the alignment zone.
  • 4. The data storage device as recited in claim 2, wherein the control circuitry is further operable to: map a plurality of logical block addresses (LBAs) to the sectors storing the data chunks of the alignment zone; andafter shifting the data chunks right by N1 chunks plus the first offset, remap the LBAs to the corresponding sectors.
  • 5. The data storage device as recited in claim 1, wherein X equals eight.
  • 6. The data storage device as recited in claim 5, wherein the control circuitry is operable to: shift the data chunks of the alignment zone right by one chunk plus one-eighth of a sector;shift the data chunks of the alignment zone right by two chunks plus two-eighths of a sector;shift the data chunks of the alignment zone right by three chunks plus three-eighths of a sector;shift the data chunks of the alignment zone right by four chunks plus four-eighths of a sector;shift the data chunks of the alignment zone right by five chunks plus five-eighths of a sector;shift the data chunks of the alignment zone right by six chunks plus six-eighths of a sector; andshift the data chunks of the alignment zone right by seven chunks plus seven-eighths of a sector.
  • 7. A data storage device comprising a non-volatile memory comprising a plurality of sectors, and control circuitry operable to: define a plurality of alignment zones including a first alignment zone and a second alignment zone, wherein each alignment zone comprises a plurality of chunks including a plurality of data chunks and a constant number of pad chunks, and each chunk comprises a plurality of sectors;evaluate a partition map that defines a plurality of partitions including a first partition and a second partition, wherein each partition defines a start logical block address (LBA) and an end LBA and at least one of the partitions comprises more than one of the alignment zones; andmodify a boundary of the first alignment zone relative to the end LBA of the first partition.
  • 8. The data storage device as recited in claim 7, wherein the control circuitry is further operable to modify the boundary of the first alignment zone by changing the number of data chunks in the first alignment zone.
  • 9. The data storage device as recited in claim 8, wherein the control circuitry is further operable to modify the boundary of the first alignment zone by reassigning a plurality of data chunks from the second alignment zone to the first alignment zone.
  • 10. The data storage device as recited in claim 7, wherein the control circuitry is further operable to: align the data chunks in the first alignment zone relative to a first partition offset defined by the first partition; andalign the data chunks in the second alignment zone relative to a second partition offset defined by the second partition,wherein the first and second partition offsets represent different fractions of a sector.
  • 11. A method of operating a data storage device, the data storage device comprising a non-volatile memory comprising a plurality of sectors, the method comprising defining at least one alignment zone comprising a plurality of chunks including a plurality of data chunks and a plurality of pad chunks, wherein: each chunk comprises a plurality of sectors;each sector is operable to store X host blocks, where X is an integer greater than one;the alignment zone comprises at least X−1 pad chunks; andthe method further comprises: shifting the data chunks of the alignment zone by a non-zero integer number of chunks equal to or less than X−1 plus a corresponding offset;first shifting the data chunks right by N1 chunks plus a first offset while maintaining at least one copy of the data chunks;after first shifting the data chunks right by N1 chunks, second shifting the data chunks left by N2 chunks plus a second offset while maintaining at least one copy of the data chunks; andafter second shifting the data chunks left by N2 chunks, third shifting the data chunks left by N3 chunks plus a third offset while maintaining at least one copy of the data chunks,wherein the first, second, and third offsets represent different fractions of a sector.
  • 12. The method as recited in claim 11, wherein the first, second, and third shifting are consecutive.
  • 13. The method as recited in claim 12, wherein: the alignment zone comprises Y pad chunks at the beginning of the alignment zone and X−Y−1 pad chunks at the end of the alignment zone, where Y is an integer greater than zero; andY corresponds to a number of chunks the data chunks are shifted right in the alignment zone.
  • 14. The method as recited in claim 12, further comprising: mapping a plurality of logical block addresses (LBAs) to the sectors storing the data chunks of the alignment zone; andafter shifting the data chunks right by N1 chunks plus the first offset, remapping the LBAs to the corresponding sectors.
  • 15. The method as recited in claim 11, wherein X equals eight.
  • 16. The method as recited in claim 15, further comprising: shifting the data chunks of the alignment zone right by one chunk plus one-eighth of a sector;shifting the data chunks of the alignment zone right by two chunks plus two-eighths of a sector;shifting the data chunks of the alignment zone right by three chunks plus three-eighths of a sector;shifting the data chunks of the alignment zone right by four chunks plus four-eighths of a sector;shifting the data chunks of the alignment zone right by five chunks plus five-eighths of a sector;shifting the data chunks of the alignment zone right by six chunks plus six-eighths of a sector; andshifting the data chunks of the alignment zone right by seven chunks plus seven-eighths of a sector.
  • 17. A method of operating a data storage device, the data storage device comprising a non-volatile memory comprising a plurality of sectors, the method comprising: defining a plurality of alignment zones including a first alignment zone and a second alignment zone, wherein each alignment zone comprises a plurality of chunks including a plurality of data chunks and a constant number of pad chunks, and each chunk comprises a plurality of sectors;evaluating a partition map that defines a plurality of partitions including a first partition wherein a second partition, and each partition defines a start logical block address (LBA) and an end LBA and at least one of the partitions comprises more than one of the alignment zones; andmodifying a boundary of the first alignment zone relative to the end LBA of the first partition.
  • 18. The method as recited in claim 17, further comprising modifying the boundary of the first alignment zone by changing the number of data chunks in the first alignment zone.
  • 19. The method as recited in claim 18, further comprising modifying the boundary of the first alignment zone by reassigning a plurality of data chunks from the second alignment zone to the first alignment zone.
  • 20. The method as recited in claim 17, further comprising: aligning the data chunks in the first alignment zone relative to a first partition offset defined by the first partition; andaligning the data chunks in the second alignment zone relative to a second partition offset defined by the second partition,wherein the first and second partition offsets represent different fractions of a sector.
US Referenced Citations (498)
Number Name Date Kind
5325526 Cameron et al. Jun 1994 A
5613066 Matsushima et al. Mar 1997 A
5675769 Ruff et al. Oct 1997 A
5813025 Murphy et al. Sep 1998 A
5822142 Hicken Oct 1998 A
6018789 Sokolov et al. Jan 2000 A
6035351 Billings et al. Mar 2000 A
6065095 Sokolov et al. May 2000 A
6078452 Kittilson et al. Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6092149 Hicken et al. Jul 2000 A
6092150 Sokolov et al. Jul 2000 A
6092231 Sze Jul 2000 A
6094707 Sokolov et al. Jul 2000 A
6105104 Guttmann et al. Aug 2000 A
6111717 Cloke et al. Aug 2000 A
6112277 Bui et al. Aug 2000 A
6125435 Estakhri et al. Sep 2000 A
6145052 Howe et al. Nov 2000 A
6175686 Noda Jan 2001 B1
6175893 D'Souza et al. Jan 2001 B1
6178056 Cloke et al. Jan 2001 B1
6178487 Ruff et al. Jan 2001 B1
6185666 Murray et al. Feb 2001 B1
6191712 Still Feb 2001 B1
6191909 Cloke et al. Feb 2001 B1
6195218 Guttmann et al. Feb 2001 B1
6205494 Williams Mar 2001 B1
6208477 Cloke et al. Mar 2001 B1
6223303 Billings et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6246346 Cloke et al. Jun 2001 B1
6249393 Billings et al. Jun 2001 B1
6256695 Williams Jul 2001 B1
6262857 Hull et al. Jul 2001 B1
6263459 Schibilla Jul 2001 B1
6272694 Weaver et al. Aug 2001 B1
6278568 Cloke et al. Aug 2001 B1
6279089 Schibilla et al. Aug 2001 B1
6289484 Rothberg et al. Sep 2001 B1
6292912 Cloke et al. Sep 2001 B1
6310740 Dunbar et al. Oct 2001 B1
6317850 Rothberg Nov 2001 B1
6324604 Don et al. Nov 2001 B1
6327106 Rothberg Dec 2001 B1
6337778 Gagne Jan 2002 B1
6369969 Christiansen et al. Apr 2002 B1
6384999 Schibilla May 2002 B1
6385711 Colligan May 2002 B1
6388833 Golowka et al. May 2002 B1
6405342 Lee Jun 2002 B1
6408357 Hanmann et al. Jun 2002 B1
6408406 Parris Jun 2002 B1
6411452 Cloke Jun 2002 B1
6411458 Billings et al. Jun 2002 B1
6412083 Rothberg et al. Jun 2002 B1
6415349 Hull et al. Jul 2002 B1
6425128 Krapf et al. Jul 2002 B1
6441981 Cloke et al. Aug 2002 B1
6442328 Elliott et al. Aug 2002 B1
6445524 Nazarian et al. Sep 2002 B1
6449767 Krapf et al. Sep 2002 B1
6453115 Boyle Sep 2002 B1
6453383 Stoddard et al. Sep 2002 B1
6470420 Hospodor Oct 2002 B1
6480020 Jung et al. Nov 2002 B1
6480349 Kim et al. Nov 2002 B1
6480932 Vallis et al. Nov 2002 B1
6483986 Krapf Nov 2002 B1
6487032 Cloke et al. Nov 2002 B1
6490635 Holmes Dec 2002 B1
6493173 Kim et al. Dec 2002 B1
6499083 Hamlin Dec 2002 B1
6519104 Cloke et al. Feb 2003 B1
6525892 Dunbar et al. Feb 2003 B1
6532517 Wagner et al. Mar 2003 B1
6545830 Briggs et al. Apr 2003 B1
6546489 Frank, Jr. et al. Apr 2003 B1
6550021 Dalphy et al. Apr 2003 B1
6552880 Dunbar et al. Apr 2003 B1
6553457 Wilkins et al. Apr 2003 B1
6578106 Price Jun 2003 B1
6580573 Hull et al. Jun 2003 B1
6594183 Lofgren et al. Jul 2003 B1
6600620 Krounbi et al. Jul 2003 B1
6601137 Castro et al. Jul 2003 B1
6603622 Christiansen et al. Aug 2003 B1
6603625 Hospodor et al. Aug 2003 B1
6604220 Lee Aug 2003 B1
6606682 Dang et al. Aug 2003 B1
6606714 Thelin Aug 2003 B1
6606717 Yu et al. Aug 2003 B1
6611393 Nguyen et al. Aug 2003 B1
6615312 Hamlin et al. Sep 2003 B1
6639748 Christiansen et al. Oct 2003 B1
6647481 Luu et al. Nov 2003 B1
6654193 Thelin Nov 2003 B1
6657810 Kupferman Dec 2003 B1
6661591 Rothberg Dec 2003 B1
6665772 Hamlin Dec 2003 B1
6687073 Kupferman Feb 2004 B1
6687078 Kim Feb 2004 B1
6687850 Rothberg Feb 2004 B1
6690523 Nguyen et al. Feb 2004 B1
6690882 Hanmann et al. Feb 2004 B1
6691198 Hamlin Feb 2004 B1
6691213 Luu et al. Feb 2004 B1
6691255 Rothberg et al. Feb 2004 B1
6693760 Krounbi et al. Feb 2004 B1
6694477 Lee Feb 2004 B1
6697914 Hospodor et al. Feb 2004 B1
6704153 Rothberg et al. Mar 2004 B1
6708251 Boyle et al. Mar 2004 B1
6710951 Cloke Mar 2004 B1
6711628 Thelin Mar 2004 B1
6711635 Wang Mar 2004 B1
6711660 Milne et al. Mar 2004 B1
6715044 Lofgren et al. Mar 2004 B2
RE38502 Yonemitsu Apr 2004 E
6724982 Hamlin Apr 2004 B1
6725329 Ng et al. Apr 2004 B1
6735650 Rothberg May 2004 B1
6735693 Hamlin May 2004 B1
6744772 Eneboe et al. Jun 2004 B1
6745283 Dang Jun 2004 B1
6751402 Elliott et al. Jun 2004 B1
6751686 Takasugi et al. Jun 2004 B2
6757481 Nazarian et al. Jun 2004 B1
6772281 Hamlin Aug 2004 B2
6781826 Goldstone et al. Aug 2004 B1
6782449 Codilian et al. Aug 2004 B1
6791779 Singh et al. Sep 2004 B1
6792486 Hanan et al. Sep 2004 B1
6799274 Hamlin Sep 2004 B1
6811427 Garrett et al. Nov 2004 B2
6826003 Subrahmanyam Nov 2004 B1
6826614 Hanmann et al. Nov 2004 B1
6832041 Boyle Dec 2004 B1
6832929 Garrett et al. Dec 2004 B2
6845405 Thelin Jan 2005 B1
6845427 Atai-Azimi Jan 2005 B1
6850443 Lofgren et al. Feb 2005 B2
6851055 Boyle et al. Feb 2005 B1
6851063 Boyle et al. Feb 2005 B1
6853731 Boyle et al. Feb 2005 B1
6854022 Thelin Feb 2005 B1
6862660 Wilkins et al. Mar 2005 B1
6880043 Castro et al. Apr 2005 B1
6882486 Kupferman Apr 2005 B1
6884085 Goldstone Apr 2005 B1
6888831 Hospodor et al. May 2005 B1
6892217 Hanmann et al. May 2005 B1
6892249 Codilian et al. May 2005 B1
6892313 Codilian et al. May 2005 B1
6895455 Rothberg May 2005 B1
6895500 Rothberg May 2005 B1
6898730 Hanan May 2005 B1
6910099 Wang et al. Jun 2005 B1
6928470 Hamlin Aug 2005 B1
6931439 Hanmann et al. Aug 2005 B1
6934104 Kupferman Aug 2005 B1
6934713 Schwartz et al. Aug 2005 B2
6940873 Boyle et al. Sep 2005 B2
6943978 Lee Sep 2005 B1
6948165 Luu et al. Sep 2005 B1
6950267 Liu et al. Sep 2005 B1
6954733 Ellis et al. Oct 2005 B1
6961814 Thelin et al. Nov 2005 B1
6965489 Lee et al. Nov 2005 B1
6965563 Hospodor et al. Nov 2005 B1
6965966 Rothberg et al. Nov 2005 B1
6967799 Lee Nov 2005 B1
6968422 Codilian et al. Nov 2005 B1
6968450 Rothberg et al. Nov 2005 B1
6973495 Milne et al. Dec 2005 B1
6973570 Hamlin Dec 2005 B1
6976190 Goldstone Dec 2005 B1
6983316 Milne et al. Jan 2006 B1
6986007 Procyk et al. Jan 2006 B1
6986154 Price et al. Jan 2006 B1
6988178 Shirai et al. Jan 2006 B1
6995933 Codilian et al. Feb 2006 B1
6996501 Rothberg Feb 2006 B1
6996669 Dang et al. Feb 2006 B1
7002926 Eneboe et al. Feb 2006 B1
7003674 Hamlin Feb 2006 B1
7006316 Sargenti, Jr. et al. Feb 2006 B1
7009820 Hogg Mar 2006 B1
7023639 Kupferman Apr 2006 B1
7024491 Hanmann et al. Apr 2006 B1
7024549 Luu et al. Apr 2006 B1
7024614 Thelin et al. Apr 2006 B1
7027716 Boyle et al. Apr 2006 B1
7028174 Atai-Azimi et al. Apr 2006 B1
7031902 Catiller Apr 2006 B1
7046465 Kupferman May 2006 B1
7046488 Hogg May 2006 B1
7050252 Vallis May 2006 B1
7054937 Milne et al. May 2006 B1
7055000 Severtson May 2006 B1
7055167 Masters May 2006 B1
7057836 Kupferman Jun 2006 B1
7062398 Rothberg Jun 2006 B1
7075746 Kupferman Jul 2006 B1
7076603 Chheda Jul 2006 B1
7076604 Thelin Jul 2006 B1
7082494 Thelin et al. Jul 2006 B1
7088538 Codilian et al. Aug 2006 B1
7088545 Singh et al. Aug 2006 B1
7092186 Hogg Aug 2006 B1
7095577 Codilian et al. Aug 2006 B1
7099095 Subrahmanyam et al. Aug 2006 B1
7099993 Keeler Aug 2006 B2
7106537 Bennett Sep 2006 B1
7106947 Boyle et al. Sep 2006 B2
7110202 Vasquez Sep 2006 B1
7111116 Boyle et al. Sep 2006 B1
7114029 Thelin Sep 2006 B1
7120737 Thelin Oct 2006 B1
7120806 Codilian et al. Oct 2006 B1
7126776 Warren, Jr. et al. Oct 2006 B1
7129763 Bennett et al. Oct 2006 B1
7133600 Boyle Nov 2006 B1
7136244 Rothberg Nov 2006 B1
7146094 Boyle Dec 2006 B1
7149046 Coker et al. Dec 2006 B1
7150036 Milne et al. Dec 2006 B1
7155616 Hamlin Dec 2006 B1
7171108 Masters et al. Jan 2007 B1
7171110 Wilshire Jan 2007 B1
7194576 Boyle Mar 2007 B1
7200698 Rothberg Apr 2007 B1
7205805 Bennett Apr 2007 B1
7206497 Boyle et al. Apr 2007 B1
7215496 Kupferman et al. May 2007 B1
7215771 Hamlin May 2007 B1
7237054 Cain et al. Jun 2007 B1
7240161 Boyle Jul 2007 B1
7249365 Price et al. Jul 2007 B1
7263709 Krapf Aug 2007 B1
7274639 Codilian et al. Sep 2007 B1
7274659 Hospodor Sep 2007 B2
7275116 Hanmann et al. Sep 2007 B1
7280302 Masiewicz Oct 2007 B1
7292774 Masters et al. Nov 2007 B1
7292775 Boyle et al. Nov 2007 B1
7296284 Price et al. Nov 2007 B1
7302501 Cain et al. Nov 2007 B1
7302579 Cain et al. Nov 2007 B1
7318088 Mann Jan 2008 B1
7319806 Willner et al. Jan 2008 B1
7325244 Boyle et al. Jan 2008 B2
7330117 Ferguson et al. Feb 2008 B2
7330323 Singh et al. Feb 2008 B1
7330417 Billau et al. Feb 2008 B2
7346790 Klein Mar 2008 B1
7366641 Masiewicz et al. Apr 2008 B1
7369340 Dang et al. May 2008 B1
7369343 Yeo et al. May 2008 B1
7372650 Kupferman May 2008 B1
7380147 Sun May 2008 B1
7392340 Dang et al. Jun 2008 B1
7395404 Gorobets et al. Jul 2008 B2
7404013 Masiewicz Jul 2008 B1
7406545 Rothberg et al. Jul 2008 B1
7415571 Hanan Aug 2008 B1
7436610 Thelin Oct 2008 B1
7437502 Coker Oct 2008 B1
7440214 Ell et al. Oct 2008 B1
7451344 Rothberg Nov 2008 B1
7461202 Forrer, Jr. et al. Dec 2008 B2
7471483 Ferris et al. Dec 2008 B1
7471486 Coker et al. Dec 2008 B1
7486060 Bennett Feb 2009 B1
7496493 Stevens Feb 2009 B1
7518819 Yu et al. Apr 2009 B1
7526184 Parkinen et al. Apr 2009 B1
7539924 Vasquez et al. May 2009 B1
7543117 Hanan Jun 2009 B1
7551383 Kupferman Jun 2009 B1
7562282 Rothberg Jul 2009 B1
7574558 Morley et al. Aug 2009 B2
7577973 Kapner, III et al. Aug 2009 B1
7596797 Kapner, III et al. Sep 2009 B1
7599139 Bombet et al. Oct 2009 B1
7619841 Kupferman Nov 2009 B1
7647544 Masiewicz Jan 2010 B1
7649704 Bombet et al. Jan 2010 B1
7653927 Kapner, III et al. Jan 2010 B1
7656603 Xing Feb 2010 B1
7656763 Jin et al. Feb 2010 B1
7657149 Boyle Feb 2010 B2
7672072 Boyle et al. Mar 2010 B1
7673075 Masiewicz Mar 2010 B1
7688540 Mei et al. Mar 2010 B1
7724461 McFadyen et al. May 2010 B1
7725584 Hanmann et al. May 2010 B1
7730295 Lee Jun 2010 B1
7760458 Trinh Jul 2010 B1
7768776 Szeremeta et al. Aug 2010 B1
7804657 Hogg et al. Sep 2010 B1
7813954 Price et al. Oct 2010 B1
7827320 Stevens Nov 2010 B1
7839588 Dang et al. Nov 2010 B1
7843660 Yeo Nov 2010 B1
7852596 Boyle et al. Dec 2010 B2
7859782 Lee Dec 2010 B1
7872822 Rothberg Jan 2011 B1
7898756 Wang Mar 2011 B1
7898762 Guo et al. Mar 2011 B1
7900037 Fallone et al. Mar 2011 B1
7907364 Boyle et al. Mar 2011 B2
7929234 Boyle et al. Apr 2011 B1
7933087 Tsai et al. Apr 2011 B1
7933090 Jung et al. Apr 2011 B1
7934030 Sargenti, Jr. et al. Apr 2011 B1
7940491 Szeremeta et al. May 2011 B2
7944639 Wang May 2011 B1
7945727 Rothberg et al. May 2011 B2
7949564 Hughes et al. May 2011 B1
7974029 Tsai et al. Jul 2011 B2
7974039 Xu et al. Jul 2011 B1
7982993 Tsai et al. Jul 2011 B1
7984200 Bombet et al. Jul 2011 B1
7990648 Wang Aug 2011 B1
7992179 Kapner, III et al. Aug 2011 B1
8004785 Tsai et al. Aug 2011 B1
8006027 Stevens et al. Aug 2011 B1
8014094 Jin Sep 2011 B1
8014977 Masiewicz et al. Sep 2011 B1
8019914 Vasquez et al. Sep 2011 B1
8040625 Boyle et al. Oct 2011 B1
8046533 Kompella et al. Oct 2011 B2
8051044 Dyatlov et al. Nov 2011 B1
8055842 Iyer Nov 2011 B1
8078943 Lee Dec 2011 B1
8079045 Krapf et al. Dec 2011 B2
8082433 Fallone et al. Dec 2011 B1
8085487 Jung et al. Dec 2011 B1
8089719 Dakroub Jan 2012 B1
8090902 Bennett et al. Jan 2012 B1
8090906 Blaha et al. Jan 2012 B1
8091112 Elliott et al. Jan 2012 B1
8094396 Zhang et al. Jan 2012 B1
8094401 Peng et al. Jan 2012 B1
8116020 Lee Feb 2012 B1
8116025 Chan et al. Feb 2012 B1
8134793 Vasquez et al. Mar 2012 B1
8134798 Thelin et al. Mar 2012 B1
8139301 Li et al. Mar 2012 B1
8139310 Hogg Mar 2012 B1
8144419 Liu Mar 2012 B1
8145452 Masiewicz et al. Mar 2012 B1
8149528 Suratman et al. Apr 2012 B1
8154812 Boyle et al. Apr 2012 B1
8159768 Miyamura Apr 2012 B1
8161328 Wilshire Apr 2012 B1
8164849 Szeremeta et al. Apr 2012 B1
8174780 Tsai et al. May 2012 B1
8190575 Ong et al. May 2012 B1
8194338 Zhang Jun 2012 B1
8194340 Boyle et al. Jun 2012 B1
8194341 Boyle Jun 2012 B1
8201066 Wang Jun 2012 B1
8271692 Dinh et al. Sep 2012 B1
8279550 Hogg Oct 2012 B1
8281218 Ybarra et al. Oct 2012 B1
8285923 Stevens Oct 2012 B2
8285965 Karr et al. Oct 2012 B2
8289656 Huber Oct 2012 B1
8305705 Roohr Nov 2012 B1
8307156 Codilian et al. Nov 2012 B1
8310775 Boguslawski et al. Nov 2012 B1
8315006 Chahwan et al. Nov 2012 B1
8316263 Gough et al. Nov 2012 B1
8320067 Tsai et al. Nov 2012 B1
8324974 Bennett Dec 2012 B1
8332695 Dalphy et al. Dec 2012 B2
8341337 Ong et al. Dec 2012 B1
8350628 Bennett Jan 2013 B1
8356184 Meyer et al. Jan 2013 B1
8370683 Ryan et al. Feb 2013 B1
8375225 Ybarra Feb 2013 B1
8375274 Bonke Feb 2013 B1
8380922 DeForest et al. Feb 2013 B1
8390948 Hogg Mar 2013 B2
8390952 Szeremeta Mar 2013 B1
8392689 Lott Mar 2013 B1
8407393 Yolar et al. Mar 2013 B1
8413010 Vasquez et al. Apr 2013 B1
8417566 Price et al. Apr 2013 B2
8421663 Bennett Apr 2013 B1
8422172 Dakroub et al. Apr 2013 B1
8427771 Tsai Apr 2013 B1
8429343 Tsai Apr 2013 B1
8433937 Wheelock et al. Apr 2013 B1
8433977 Vasquez et al. Apr 2013 B1
8458526 Dalphy et al. Jun 2013 B2
8462466 Huber Jun 2013 B2
8467151 Huber Jun 2013 B1
8489841 Strecke et al. Jul 2013 B1
8493679 Boguslawski et al. Jul 2013 B1
8495289 Moyer Jul 2013 B2
8498074 Mobley et al. Jul 2013 B1
8499198 Messenger et al. Jul 2013 B1
8512049 Huber et al. Aug 2013 B1
8514506 Li et al. Aug 2013 B1
8531791 Reid et al. Sep 2013 B1
8554741 Malina Oct 2013 B1
8560759 Boyle et al. Oct 2013 B1
8565053 Chung Oct 2013 B1
8576511 Coker et al. Nov 2013 B1
8578100 Huynh et al. Nov 2013 B1
8578126 Gaonkar et al. Nov 2013 B1
8578242 Burton et al. Nov 2013 B1
8589773 Wang et al. Nov 2013 B1
8593753 Anderson Nov 2013 B1
8595432 Vinson et al. Nov 2013 B1
8599510 Fallone Dec 2013 B1
8601248 Thorsted Dec 2013 B2
8611032 Champion et al. Dec 2013 B2
8612650 Carrie et al. Dec 2013 B1
8612706 Madril et al. Dec 2013 B1
8612798 Tsai Dec 2013 B1
8619383 Jung et al. Dec 2013 B1
8621115 Bombet et al. Dec 2013 B1
8621133 Boyle Dec 2013 B1
8626463 Stevens et al. Jan 2014 B2
8630052 Jung et al. Jan 2014 B1
8630056 Ong Jan 2014 B1
8631188 Heath et al. Jan 2014 B1
8634158 Chahwan et al. Jan 2014 B1
8635412 Wilshire Jan 2014 B1
8640007 Schulze Jan 2014 B1
8654619 Cheng Feb 2014 B1
8661193 Cobos et al. Feb 2014 B1
8667248 Neppalli Mar 2014 B1
8670205 Malina et al. Mar 2014 B1
8683295 Syu et al. Mar 2014 B1
8683457 Hughes et al. Mar 2014 B1
8687306 Coker et al. Apr 2014 B1
8693133 Lee et al. Apr 2014 B1
8694841 Chung et al. Apr 2014 B1
8699159 Malina Apr 2014 B1
8699171 Boyle Apr 2014 B1
8699172 Gunderson et al. Apr 2014 B1
8699175 Olds et al. Apr 2014 B1
8699185 Teh et al. Apr 2014 B1
8700850 Lalouette Apr 2014 B1
8743502 Bonke et al. Jun 2014 B1
8749910 Dang et al. Jun 2014 B1
8751699 Tsai et al. Jun 2014 B1
8755141 Dang Jun 2014 B1
8755143 Wilson et al. Jun 2014 B2
8756361 Pruett et al. Jun 2014 B1
8756382 Carlson et al. Jun 2014 B1
8769593 Elliott et al. Jul 2014 B1
8773802 Anderson et al. Jul 2014 B1
8780478 Huynh et al. Jul 2014 B1
8782334 Boyle et al. Jul 2014 B1
8793532 Tsai et al. Jul 2014 B1
8797669 Burton et al. Aug 2014 B1
8799977 Kapner, III et al. Aug 2014 B1
20040019718 Schauer et al. Jan 2004 A1
20040255093 Forrer, Jr. et al. Dec 2004 A1
20050036381 Hassner et al. Feb 2005 A1
20050071583 Shepherd Mar 2005 A1
20050125614 Royer Jun 2005 A1
20050210214 Takase et al. Sep 2005 A1
20060136655 Gorobets et al. Jun 2006 A1
20070076936 Li et al. Apr 2007 A1
20070079305 Duerinckx Apr 2007 A1
20070143561 Gorobets Jun 2007 A1
20070192533 Kim et al. Aug 2007 A1
20080016275 Sebastian et al. Jan 2008 A1
20080028162 Thompson Jan 2008 A1
20080162811 Steinmetz et al. Jul 2008 A1
20090031089 Tuominen Jan 2009 A1
20090070518 Traister et al. Mar 2009 A1
20090106210 Slezak et al. Apr 2009 A1
20090113702 Hogg May 2009 A1
20090228744 Deenadhayalan et al. Sep 2009 A1
20090271562 Sinclair Oct 2009 A1
20090276662 Shen et al. Nov 2009 A1
20090313426 See et al. Dec 2009 A1
20100232049 Kompella et al. Sep 2010 A1
20100306551 Meyer et al. Dec 2010 A1
20110047347 Li et al. Feb 2011 A1
20110125977 Karr et al. May 2011 A1
20110226729 Hogg Sep 2011 A1
20120159042 Lott et al. Jun 2012 A1
20120272038 Wei et al. Oct 2012 A1
20120275050 Wilson et al. Nov 2012 A1
20120281963 Krapf et al. Nov 2012 A1
20120324980 Nguyen et al. Dec 2012 A1
20130326170 Kilari et al. Dec 2013 A1
20140068152 Sinclair Mar 2014 A1
20140201424 Chen et al. Jul 2014 A1
Foreign Referenced Citations (2)
Number Date Country
1258913 Jul 2000 CN
2011062861 May 2011 WO
Non-Patent Literature Citations (19)
Entry
Di Marco, Alessandro. “Exploiting commodity hard-disk geometry to efficiently preserve data consistency.” Formal Methods and Stochastic Models for Performance Evaluation. Springer Berlin Heidelberg, 2007. 260-274.
Paragon Software Group, “Partition Alignment Dramatically Increases System Performance”, Jul. 5, 2010, http://dl.paragon-software.com/free/Paragon%20Alignment%20Tool/%20-%20White%20Paper.pdf.
IDEMA, “Advanced Format Downloads”, Apr. 24, 2012, www.idema.org.
Seagate, “Tech Insight Transition to Advanced Format 4K Sector Hard Drives”, Apr. 28, 2012, http://www.seagate.com/tech-insights/advanced-format-4k-sector-hard-drives-master-ti/.
Wikipedia, “Advanced Format”, Sep. 25, 2010, en.wikipedia.org/wiki/Advanced—Format.
Coughlin, T., “Aligning with the Future of Storage”, Jun. 2011, Coughlin Associates, Inc., www.tomcoughlin.com.
Heo, T., “ATA 4 KiB sector issues”, Mar. 13, 2010, ata.wiki.kernel.org/index.php/ATA—4—KiB—sector—issues.
Dernoncourt, D., “Dealing with WD Advanced Format hard drives on Linux, Windows and Mac OS”, Aug. 6, 2010, PCR's notepad.
Smith, R., “Linux on 4KB-sector disks: Practical advice”, Apr. 27, 2010, IBM.
VMware, “Recommendations for Aligning VMFS Partitions”, Feb. 4, 2009, VMware.
Office Action dated Nov. 8, 2013 from U.S. Appl. No. 13/356,453, 36 pages.
Carl E. Bonke, et al., Patent Application U.S. Appl. No. 13/174,004, filed Jun. 30, 2011, 18 pages.
Notice of Allowance dated Jun. 20, 2014 from U.S. Appl. No. 13/356,453, 12 pages.
INCITS, “SCSI Block Commands—3 (SBC-3)”, Revision 16, Aug. 25, 2008, American National Standards Institute, New York, New York, United States.
INCITS, “AT Attachment with Packet Interface—7 vol. 1—Register Delivered Command Set, Logical Register Set (ATA/ATAPI-7 V1)”, Revision 4b, Apr. 21, 2004, American National Standards Institute, New York, New York, United States.
INCITS, “AT Attachment 8—ATA/ATAPI Command Set (ATA8-ACS)”, Revision 4a, May 21, 2007, American National Standards Institute, New York, New York, United States.
Seagate Technology Paper, “SmartAlign Technology for Advanced Format Hard Drives”, downloaded on Jul. 20, 2011 from www.seagate.com/docs/pdf/whitepaper/tp615—smartalign—for—af—4k.pdf.
Scott Errington, “OS and Application Considerations for Hard Disc Drives With Long Physical Sector Sizes”, http://bigsector.net/user—img/Long—Physical—Sector—Sizes—PDF—version—02.pdf, Jan. 24, 2012.
“Seagate, ““Advanced Format 4K Sector Transition””, May 2010,http://www.seagate.com/docs/pdf/whitepaper/mb604—4k—transition—faq.pdf”.