会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Power-efficient seek operations in hard disk drive
    • 在硬盘驱动器中进行高效的寻找操作
    • US06809896B2
    • 2004-10-26
    • US10097392
    • 2002-03-14
    • Adam Michael EspesethDavid Robison HallMaile Matsui Vasoli
    • Adam Michael EspesethDavid Robison HallMaile Matsui Vasoli
    • G11B5596
    • G11B5/5547G11B5/012G11B5/5534
    • An adaptive maximum seek velocity clipping technique is employed in a disk drive to reduce head movement power requirements. Separate maximum seek velocities are established for respective categories of access commands, where the categories are defined by seek distance and estimated extra latency. The maximum seek velocity established for each category of access commands reflects actual experience in executing access commands of the given category. The maximum seek velocity values for the various categories are stored in a maximum seek velocity table, which is referred to upon execution of access commands. The inventive power-saving technique may be advantageously applied in conjunction with a probability-based shortest access time first (SATF) command queue ordering algorithm.
    • 在磁盘驱动器中采用自适应最大寻道速度限幅技术来减少磁头移动功率需求。 针对相应的访问命令类别建立单独的最大寻道速度,其中类别由查找距离和估计的额外等待时间来定义。 为每个类别的访问命令建立的最大搜索速度反映了执行给定类别的访问命令的实际体验。 各种类别的最大寻道速度值被存储在最大寻找速度表中,这是在执行访问命令时参考的。 本发明的省电技术可以有利地与基于概率的最短访问时间第一(SATF)命令队列排序算法结合使用。
    • 6. 发明授权
    • Method and apparatus for automated analysis of hard disk drive performance
    • 自动分析硬盘驱动器性能的方法和装置
    • US07254525B2
    • 2007-08-07
    • US10273310
    • 2002-10-17
    • Trevor James BriggsAdam Michael EspesethRobert Anton SteinbachChristopher David Wiederholt
    • Trevor James BriggsAdam Michael EspesethRobert Anton SteinbachChristopher David Wiederholt
    • G06F9/455G11C29/12
    • G06F11/3485G06F11/3414
    • A method and apparatus is provided which reduces the equipment and time requirements for hard disk drive performance testing during manufacturing. This invention executes self-contained performance testing code that resides within the drive's manufacturing firmware, rather than relying on external testers. The invention involves exercising the drive's enqueue, dequeue, and command execution firmware, as well as the physical process of reading and writing data by simulating the host interface in code. The invention enqueues commands that typify the desired workload, allows a command ordering algorithm to sort the commands for execution, and allows the drive side code to execute the commands just as if an external host interface were attached. The invention is advantageous because the performance testing can be done by only applying power to the drive. The present invention also lends itself to performance tuning that can be done in manufacturing, to reduce drive-to-drive performance variations.
    • 提供了一种减少制造过程中硬盘驱动器性能测试的设备和时间要求的方法和装置。 本发明执行驻留在驱动器制造固件内的独立的性能测试代码,而不是依赖外部测试器。 本发明涉及通过在代码中模拟主机接口来执行驱动器的入队,出队和命令执行固件以及读取和写入数据的物理过程。 本发明排列了表示所需工作负载的命令,允许命令排序算法对执行的命令进行排序,并允许驱动器侧代码执行命令,就像连接外部主机接口一样。 本发明是有利的,因为可以通过仅对驱动器施加电力来进行性能测试。 本发明还适用于可在制造中完成的性能调整,以减少驱动到驱动器的性能变化。
    • 7. 发明授权
    • Space-efficient expected access time algorithm for hard disk drive command queue ordering
    • 空间有效的预期访问时间算法用于硬盘驱动器命令队列排序
    • US06725327B1
    • 2004-04-20
    • US09638253
    • 2000-08-14
    • Adam Michael EspesethDavid Robison HallJames Joseph MosserSteven Glenn Smith
    • Adam Michael EspesethDavid Robison HallJames Joseph MosserSteven Glenn Smith
    • G06F1200
    • G06F3/0659G06F3/0611G06F3/0676
    • A method and apparatus are provided for hard disk drive command queue ordering. For each command in the hard disk drive command queue, an expected access time is calculated including a probability of success calculation. A command in the hard disk drive command queue having a minimum calculated expected access time is identified. Then the identified command having a minimum calculated expected access time is executed. For an estimated seek time of less than a time for one full revolution, a probability of a miss multiplied by a time of one extra revolution is calculated and the result is added to an estimated seek time to provide the expected access time. For an estimated seek time of greater than a time for one full revolution, a probability of a make multiplied by a time of one extra revolution is calculated and the result is subtracted from an estimated seek time to provide the expected access time.
    • 提供了一种用于硬盘驱动器命令队列排序的方法和装置。 对于硬盘驱动器命令队列中的每个命令,计算包括成功计算概率的预期访问时间。 识别具有最小计算的预期访问时间的硬盘驱动器命令队列中的命令。 然后执行具有最小计算的预期访问时间的所识别的命令。 对于一个完整的旋转时间小于一个时间的估计的寻道时间,计算一次额外的一倍的轮次的乘法概率,并将结果加到估计的寻道时间以提供预期的访问时间。 对于大于一个全转的时间的估计搜索时间,计算乘以一次额外转数的时间的概率,并且从估计的寻道时间中减去结果以提供预期访问时间。
    • 8. 发明授权
    • System and method for efficiently sorting DASD queued commands with unknown rotational latency
    • 用于有效排序具有未知旋转延迟的DASD排队命令的系统和方法
    • US06681289B2
    • 2004-01-20
    • US10057110
    • 2002-01-25
    • Adam Michael EspesethDavid Robison HallMaile Matsui Vasoli
    • Adam Michael EspesethDavid Robison HallMaile Matsui Vasoli
    • G06F1200
    • G06F3/0601G06F2003/0697
    • A method and apparatus are provided for efficiently sorting queued commands with unknown rotational latency in a direct access storage device (DASD). For each command an initial expected access time (EAT) including a probability of success calculation is calculated and stored in a miss table. An actual starting location for the next command to be executed is identified. Utilizing the miss table, and a calculated best candidate command list for a plurality of different starting locations, a command in a command queue is selected based upon the actual starting location. The best candidate command list for a plurality of different starting locations is calculated by first sorting the miss table row by increasing EAT values and sequentially incrementing a miss time value by the predefined unit of time and updating all variable in the first row and adjusting a potential value in the second row of the miss table.
    • 提供了一种用于在直接访问存储设备(DASD)中有效排序具有未知旋转延迟的排队命令的方法和装置。 对于每个命令,计算包括成功计算概率的初始预期访问时间(EAT)并将其存储在缺失表中。 确定要执行的下一个命令的实际起始位置。 利用未命中的表和针对多个不同起始位置的计算的最佳候选命令列表,基于实际的起始位置来选择命令队列中的命令。 通过首先通过增加EAT值对丢失表行进行排序并按照预定义的时间单位顺序地增加未命中时间值,并且更新第一行中的所有变量并调整电位来计算多个不同起始位置的最佳候选命令列表 值在缺失表的第二行。