# US 2003/0229755 A1 · Dynamic response shaping for command aging

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0229755 A1
- Document ID: US20030229755A1
- Status: Published application
- Kind: A1
- Application number: 10/163,986
- Filed: 2002-06-06
- Published: 2003-12-11
- Earliest claimed: 2002-06-06
- Assignees: International Business Machines Corporation
- Inventors: Adam Michael Espeseth; David Robison Hall
- Web page: https://patentgrep.com/patent/US20030229755A1

## CPC

- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/0611: {in relation to response time}
- G06F 3/0674: {Disk device}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present invention provides a method, apparatus and article of manufacture for selecting commands to execute from a command queue in a data storage device. The present invention reduces maximum service times under random queued workloads by executing the oldest command in the queue at a constant and predetermined rate. This yields a minimal yet predictable performance penalty, while significantly reducing maximum service times.

## Claims

### Claim 1

A method for selecting commands for execution in a data storage device, the method comprising the steps of:
queuing one or more commands for the data storage device; and
selecting a next command for execution from the queued commands, wherein the oldest queued command is selected as the next command at a constant, predetermined rate.

### Claim 2 (depends on 1)

The method of claim 1, wherein the oldest queued command is selected as the next command every 1 of N times.

### Claim 3 (depends on 1)

The method of claim 1, wherein the oldest queued command is selected as the next command only if the age of the oldest queued command exceeds a predetermined minimum age threshold value.

### Claim 4 (depends on 3)

The method of claim 3, wherein the minimum age threshold value is specified in a mode page byte within the data storage device.

### Claim 5

A method for selecting commands for execution in a data storage device, the method comprising the steps of:
queuing one or more commands for the data storage device;
creating a group of one or more old commands selected from the queued commands; and
selecting a next command for execution from the queued commands, wherein one of the group of old commands is selected as the next command at a constant, predetermined rate.

### Claim 6 (depends on 5)

The method of claim 5, wherein the step of creating a group of one or more old commands selected from the queued commands includes the steps of:
determining an age of the oldest queued command; and
selecting all commands that are within a predetermined delta age from the age of the oldest queued command.

### Claim 7 (depends on 5)

The method of claim 5, wherein the predetermined delta age is stored in a mode page byte within the data storage device.

### Claim 8 (depends on 5)

The method of claim 5, wherein the selection of one of the group of old commands is made to minimize command execution time.

### Claim 9 (depends on 5)

The method of claim 5, wherein the selection of one of the group of old commands is made only if the age of the selected command exceeds a predetermined minimum age threshold value.

### Claim 10 (depends on 9)

The method of claim 9, wherein the minimum age threshold value is specified in a mode page byte within the data storage device.

### Claim 11

A data storage device, comprising:
one or more stacked disks; and
a controller for queuing one or more commands for the one or more stacked disks, and for selecting a next command for execution from the queued commands;
wherein the oldest queued command is selected as the next command at a constant, predetermined rate.

### Claim 12 (depends on 11)

The data storage device of claim 11, wherein the oldest queued command is selected as the next command every 1 of N times.

### Claim 13 (depends on 11)

The data storage device of claim 11, wherein the oldest queued command is selected as the next command only if the oldest queued command exceeds a predetermined minimum age threshold value.

### Claim 14 (depends on 11)

The data storage device of claim 11, wherein the minimum age threshold value is specified in a mode page byte within the data storage device.

### Claim 15

An article of manufacture embodying logic for selecting commands for execution in a data storage device, comprising:
queuing one or more commands for the data storage device; and
selecting a next command for execution from the queued commands, wherein the oldest queued command is selected as the next command at a constant, predetermined rate.

### Claim 16 (depends on 15)

The article of manufacture of claim 15, wherein the oldest queued command is selected as the next command every 1 of N times.

### Claim 17 (depends on 15)

The article of manufacture of claim 15, wherein the oldest queued command is selected as the next command only if the age of the oldest queued command exceeds a predetermined minimum age threshold value.

### Claim 18 (depends on 17)

The article of manufacture of claim 17, wherein the minimum age threshold value is specified in a mode page byte within the data storage device.
