IP Library Granted Patent US 8,879,191
Granted Patent B1
US 8,879,191 · App. 13/677,136 · Granted Nov 4, 2014

Disk drive modifying rotational position optimization algorithm to achieve target performance for limited stroke

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,879,191
App. No.
13/677,136
Granted
Nov 4, 2014
Kind
B1
Abstract

A disk drive is disclosed comprising a head actuated over a disk, wherein a maximum radial movement of the head is limited. A plurality of access commands are stored in a command queue, and an access latency is determined for each command in the command queue, wherein the access latency is based at least on a seek latency for the head and a rotational latency for the disk. The access latency for each access command is increased by an offset based at least on a seek length for each access command, wherein the offset compensates for the limited maximum radial movement of the head. An access command is selected from the command queue based on the increased access latencies, and the selected access command is executed.

Claims (65)

1. A disk drive comprising:

a disk;

a head actuated over the disk; and

control circuitry operable to:

limit a maximum radial movement of the head;

store a plurality of access commands in a command queue;

determine an access latency for each command in the command queue, wherein the access latency is based at least on a seek latency for the head and a rotational latency for the disk;

increase the access latency for each access command by an offset based at least on a seek length for each access command, wherein the offset compensates for the limited maximum radial movement of the head;

select an access command from the command queue based on the increased access latencies; and

execute the selected access command.

2. The disk drive as recited in claim 1 , wherein the control circuitry is operable to increase the access latency without increasing the seek latency for the head and the rotational latency for the disk.

3. The disk drive as recited in claim 1 , wherein the control circuitry is operable to increase the access latency by increasing at least one of the seek latency for the head and the rotational latency for the disk.

4. The disk drive as recited in claim 1 , wherein the control circuitry is operable to increase the access latency in order to substantially maintain a target throughput of access commands.

5. The disk drive as recited in claim 4 , wherein the target throughput of access commands corresponds to a throughput of access commands without limiting the maximum radial movement of the head.

6. The disk drive as recited in claim 4 , wherein the control circuitry is further operable to:

predetermine the offset for a number of seek lengths up to a first seek length; and

compute the offset for a number of seek lengths exceeding the first seek length.

7. The disk drive as recited in claim 6 , wherein when the seek length of a first access command exceeds the first seek length the control circuitry is further operable to compute the offset for the first access command based on a difference between the seek length of the first access command and the first seek length.

8. The disk drive as recited in claim 7 , wherein the control circuitry is further operable to compute the offset according to:

(

N

+

distance_delta

first_seek

_length

)

·

C

where:

N is a value that defines a minimum for the offset;

distance_delta represents the difference between the seek length of the first access command and the first seek length; and

C is a scalar.

9. The disk drive as recited in claim 8 , wherein the predetermined offset comprises a fraction of C.

10. A method of operating disk drive, the disk drive comprising a head actuated over a disk, the method comprising:

limiting a maximum radial movement of the head;

storing a plurality of access commands in a command queue;

determining an access latency for each command in the command queue, wherein the access latency is based at least on a seek latency for the head and a rotational latency for the disk;

increasing the access latency for each access command by an offset based at least on a seek length for each access command, wherein the offset compensates for the limited maximum radial movement of the head;

selecting an access command from the command queue based on the increased access latencies; and

executing the selected access command.

11. The method as recited in claim 10 , wherein the access latency is increased without increasing the seek latency for the head and the rotational latency for the disk.

12. The method as recited in claim 10 , wherein the access latency is increased by increasing at least one of the seek latency for the head and the rotational latency for the disk.

13. The method as recited in claim 10 , further comprising increasing the access latency in order to substantially maintain a target throughput of access commands.

14. The method as recited in claim 13 , wherein the target throughput of access commands corresponds to a throughput of access commands without limiting the maximum radial movement of the head.

15. The method as recited in claim 13 , wherein the method further comprises:

predetermining the offset for a number of seek lengths up to a first seek length; and

computing the offset for a number of seek lengths exceeding the first seek length.

16. The method as recited in claim 15 , wherein when the seek length of a first access command exceeds the first seek length the method further comprises computing the offset for the first access command based on a difference between the seek length of the first access command and the first seek length.

17. The method as recited in claim 16 , wherein the offset is computed according to:

(

N

+

distance_delta

first_seek

_length

)

·

C

where:

N is a value that defines a minimum for the offset;

distance_delta represents the difference between the seek length of the first access command and the first seek length; and

C is a scalar.

18. The method as recited in claim 17 , wherein the predetermined offset comprises a fraction of C.

Assignments (7)
PATENT COLLATERAL AGREEMENT - DDTL LOAN AGREEMENT Recorded Aug 21, 2023
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 067045/0156 →
PATENT COLLATERAL AGREEMENT - A&R LOAN AGREEMENT Recorded Aug 21, 2023
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 064715/0001 →
RELEASE OF SECURITY INTEREST AT REEL 038744 FRAME 0481 Recorded Feb 8, 2022
From: JPMORGAN CHASE BANK, N.A.
To: WESTERN DIGITAL TECHNOLOGIES, INC.
Reel/Frame 058982/0556 →
RELEASE OF SECURITY INTEREST Recorded Mar 5, 2018
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: WESTERN DIGITAL TECHNOLOGIES, INC.
Reel/Frame 045501/0714 →
SECURITY AGREEMENT Recorded May 17, 2016
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 038722/0229 →
SECURITY AGREEMENT Recorded May 17, 2016
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 038744/0281 →
SECURITY AGREEMENT Recorded May 17, 2016
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 038744/0481 →