HDD Controller Background Task Latency Sorting

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional hard disk drives (HDDs) face performance degradation due to background tasks competing with host IO requests, leading to increased completion times and latency overhead, especially when timer-based trigger methods are used, which are not optimized by rotational position sorting.

Innovation Solution

An HDD controller employs a neural network algorithm to determine a sorting threshold based on seek and rotational latencies during a training phase, allowing background commands to be added to the command queue and executed only when their latency is below this threshold, thereby reducing the impact on host commands during high workload scenarios.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If timer-based trigger methods are used for background tasks, then background tasks can be executed regularly, but host IO completion times increase and latency overhead increases

Engineering Contradiction:
Improvebackground task executionVSAvoidhost IO completion time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements dynamic sorting threshold adjustment based on real-time workload conditions. The controller monitors host command characteristics and adapts the sorting threshold accordingly, allowing background tasks to be executed only when conditions permit, thus dynamically balancing background task execution reliability against host IO completion time

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of background task scheduling from fixed timer-based triggering to variable threshold-based triggering. The sorting threshold parameter is adjusted based on workload analysis, transforming the scheduling mechanism from static to adaptive, which reduces latency overhead while maintaining execution reliability

Inventive Principle:
Principle #35Parameter changes

2Loss of time

If background tasks are added to command queue for rotational position sorting, then rotational position optimization can be achieved, but sorting complexity increases

Engineering Contradiction:
Improverotational latencyVSAvoidsorting algorithm complexity
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The patent segments background tasks and host commands into separate processing streams with different handling rules. Background tasks are evaluated against a sorting threshold and only integrated into the rotational position sort when conditions are met, otherwise they are processed separately. This segmentation simplifies the overall sorting complexity while still achieving rotational position optimization for eligible tasks

Inventive Principle:
Principle #1Segmentation

3Loss of time

If sorting threshold is lowered to reduce host IO impact, then host command latency decreases, but background task execution frequency decreases

Engineering Contradiction:
Improvehost command latencyVSAvoidbackground task execution frequency
Core Design Contradiction:
Loss of timeVSProductivity

Solution Approach 1:

The patent implements a feedback mechanism where the system continuously monitors host command latency and background task execution metrics. Based on this feedback, the sorting threshold is dynamically adjusted to achieve the desired balance between host command latency reduction and background task execution frequency maintenance

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11221765B2Apparatus and method for executing background operations using rotational position sorting
Publication Date: 2022.01.11 SEAGATE TECH LLC
  • US11221765B2 patent drawing
  • US11221765B2 patent drawing
  • US11221765B2 patent drawing

AI summary

A background operation is internally triggered by firmware of a disk drive. During a training phase defined by a first time period, access latency of host commands is monitored during rotational position sorting command selection. During a sorting phase after the training phase, a sorting threshold is defined based on the access latencies measured during the training phase. The background command is selected for execution in the sorting phase if the seek and rotational latency is less than the sorting threshold.