发明名称 Data storage I/O communication method and apparatus
摘要 A method of scheduling requests from various services to a data storage resource, includes receiving service requests, the service requests including metadata specifying a service ID and a data size of payload data associated with the request, at least some of the service IDs having service throughput metadata specifying a required service throughput associated therewith; arranging the requests into FIFO throttled queues based on the service ID; setting a deadline for processing of a request in a throttled queue, the deadline selected in dependence upon the size of the request and the required service throughput associated therewith; providing a time credit value for each throttled queue, the time credit value including an accumulated value of the time by which a deadline for that queue has been missed; comparing the time credit value of a throttled queue to the time required to service the next request in that throttled queue.
申请公布号 US9130969(B2) 申请公布日期 2015.09.08
申请号 US201213593327 申请日期 2012.08.23
申请人 Seagate Technology LLC 发明人 Umanesan Ganesan
分类号 G06F9/46;H04L29/08;G06F3/06 主分类号 G06F9/46
代理机构 Hollingsworth Davis, LLC 代理人 Hollingsworth Davis, LLC
主权项 1. A method performed in a computer system comprising: receiving service requests from a plurality of services comprising metadata specifying a service ID and a service request size, at least one of the service IDs having a required service throughput associated therewith; arranging, the service requests into throttled queues based on the service ID; setting a deadline for processing the service requests in the throttled queue based upon the service request size and the required service throughput; providing a time credit value for each throttled queue comprising an accumulated time value of the time by which one or more deadlines for that queue has been missed; comparing the time credit value to a time required to service a next service request in that throttled queue; if the time credit in the throttled queue is sufficient, then processing the next service request in a data storage device, and decrementing the time credit value for the throttled queue by an amount equal to the time required to service the next service request, else monitoring the deadline for processing of the next service request in said throttled queue to see if the next service request in the throttled queue has reached or exceeded its deadline, processing the next service request in a data storage device, and incrementing the time credit value for the throttled queue by the amount equal to the time by which the deadline for servicing the next service request was missed.
地址 Cupertino CA US