专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07281086B1 Disk queue management for quality of service 有权
标题翻译：磁盘队列管理服务质量
公开(公告)号：US07281086B1
公开(公告)日：2007-10-09
申请号：US11143813
申请日：2005-06-02
申请人： Sachin Suresh More , Yechiel Yochai , Amnon Naamad , Adnan Sahin
发明人： Sachin Suresh More , Yechiel Yochai , Amnon Naamad , Adnan Sahin
IPC分类号： G06F12/00
CPC分类号： G06F3/0659 , G06F3/061 , G06F3/0676 , G06F12/0866
摘要： A mixed queue method for managing storage requests directed includes a low-priority request queue on which all low-priority requests are placed and where they are subject to throughput optimization by re-ordering. When a high-priority request limit has not been reached, high-priority requests are placed on a high-priority request queue where they are executed in a pre-emptive manner with respect to the queued low-priority requests, thus experiencing reduced access time. When the high-priority request limit has been reached, the high-priority requests are placed on the low-priority request queue, such that the high-priority requests are included in the throughput optimization along with the low-priority requests on the request queue. Starvation of the low-priority requests is avoided, and the overall throughput of the disk drive is maintained at a relatively high level. The high-priority request limit can be realized in several ways, such as by monitoring the number of outstanding high-priority requests or the rate at which high-priority requests are issued to the disk drive.
摘要翻译：用于管理定向的存储请求的混合队列方法包括：在其上放置所有低优先级请求的低优先级请求队列，以及通过重新排序在哪里进行吞吐量优化。当没有达到高优先级请求限制时，高优先级请求被放置在高优先级请求队列上，在高优先级请求队列中，它们相对于排队的低优先级请求以优先的方式被执行，从而经历减少的访问时间。当达到高优先级请求限制时，高优先级请求被放置在低优先级请求队列上，使得高优先级请求被包括在吞吐量优化中以及请求队列上的低优先级请求。避免了低优先级请求的饥饿，并且磁盘驱动器的整体吞吐量保持在较高的水平。高优先级请求限制可以通过几种方式实现，例如通过监视未完成的高优先级请求的数量或向磁盘驱动器发出高优先级请求的速率。

2. 发明授权

US07293136B1 Management of two-queue request structure for quality of service in disk storage systems 有权
标题翻译：管理磁盘存储系统中服务质量的两队列请求结构
公开(公告)号：US07293136B1
公开(公告)日：2007-11-06
申请号：US11208291
申请日：2005-08-19
申请人： Sachin Suresh More , Adnan Sahin , William J. Glynn
发明人： Sachin Suresh More , Adnan Sahin , William J. Glynn
IPC分类号： G06F12/00
CPC分类号： G06F3/0659 , G06F3/0611 , G06F3/0656 , G06F3/0676
摘要： Storage requests are divided into high-priority requests generally requiring low response time and low-priority requests generally requiring high throughput. The high-priority requests are further divided into several priorities reflecting different classes of service. The low-priority requests are placed on a low-priority request queue where they are executed in a throughput-optimizing order generally different from their arrival order. For each high-priority request, if there are not more than a predetermined number n (e.g., 1) outstanding requests for execution by the disk drive of greater priority, then the request is placed on a high-priority request queue where it is generally executed ahead of requests on the low-priority request queue. If there are more than n such greater-priority requests outstanding, then the high-priority request is placed on the low priority request queue and included in the throughput optimization along with the low-priority requests. The number of priority levels for the high priority requests may be two or more, and in one illustrated embodiment is equal to three.
摘要翻译：存储请求被分为通常需要低响应时间和通常需要高吞吐量的低优先级请求的高优先级请求。高优先级请求进一步分为反映不同类别服务的几个优先级。低优先级请求被放置在低优先级请求队列中，它们以与其到达顺序不同的吞吐量优化顺序执行。对于每个高优先级请求，如果没有超过预定数量n（例如，1）由磁盘驱动器执行的未完成请求具有较高优先级，则该请求被放置在高优先级请求队列上在低优先级请求队列上的请求之前执行。如果存在超过n个这样的较高优先级请求，则高优先级请求被置于低优先级请求队列上，并且包括在吞吐量优化中以及低优先级请求。高优先级请求的优先级数量可以是两个或更多个，并且在一个所示实施例中等于三个。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式