Abstract: Expected access times (EATs) of write request to a disk drive are essentially a measure of the predicted service time for the write request. Write Requests generated by a caching storage controller to a disk drive are essentially maintenance functions used to clear the cache. The disk drive modifies the EATs of write commands with a penalty such that read requests requiring disk access are preferentially satisfied. The penalty may be constant or may be established based on one or more factors, and may even be negative if necessary to clear a cache full of writes requiring destaging to disk.

Abstract: Expected access times (EATs) of write request to a disk drive are essentially a measure of the predicted service time for the write request. Write Requests generated by a caching storage controller to a disk drive are essentially maintenance functions used to clear the cache. The disk drive modifies the EATs of write commands with a penalty such that read requests requiring disk access are preferentially satisfied. The penalty may be constant or may be established based on one or more factors, and may even be negative if necessary to clear a cache full of writes requiring destaging to disk.

Abstract: A command queue is maintained in a disk drive. The command queue includes a plurality of access commands that are awaiting execution. The command queue is sorted to provisionally select one of the plurality of access commands as the next command to be executed. A seek start deadline is calculated for the provisionally selected access command based on an estimated extra latency of the provisionally selected access command. A seek operation with respect to the provisionally selected access command is deferred based on the calculated seek start deadline, to await arrival at the disk drive of a new access command. If the new access command arrives at the disk drive prior to the seek start deadline, the respective estimated access times for the provisionally selected access command and the newly arrived access command are compared to select one of the two access commands for execution.

Abstract: A command queue is maintained in a disk drive. The command queue includes a plurality of access commands that are awaiting execution. The command queue is sorted to provisionally select one of the plurality of access commands as the next command to be executed. A seek start deadline is calculated for the provisionally selected access command based on an estimated extra latency of the provisionally selected access command. A seek operation with respect to the provisionally selected access command is deferred based on the calculated seek start deadline, to await arrival at the disk drive of a new access command. If the new access command arrives at the disk drive prior to the seek start deadline, the respective estimated access times for the provisionally selected access command and the newly arrived access command are compared to select one of the two access commands for execution.

Abstract: A method and apparatus for performing preemptable calibration and housekeeping functions during idle time between commands thereby maximizing data throughput. The idle time activities are scheduled on an infrequent time scale. A single seek is used to get to a measurement location. Once the read/write head is positioned at the measurement location, it stays there for a fairly long time in order to make many measurements. If a new host command arrives, the test is aborted and the host command is serviced. The new command is begun without performing any clean-up activity and may or may not record the point at which the idle time activity was abandoned and idle time activity is reinitiated after the new command is completed. Results from the idle time activity is committed to the disk or RAM only after completion of an idle time activity, and thereafter another idle time activity is begun.