发明名称 Data communication method and apparatus
摘要 There is provided a method of scheduling requests from a plurality of services to at least one data storage resource. The method comprises receiving, on a computer system, service requests from said plurality of services. The service requests comprise metadata specifying a service ID and a data size of payload data associated with said service request, and at least some of said service IDs have service throughput metadata specifying a required service throughput associated therewith. The method further includes arranging, in a computer system, said requests into FIFO throttled queues based on said service ID and then setting a deadline for processing of a request in a throttled queue. The deadline is selected in dependence upon the size of the request and the required service throughput associated therewith. Then, the deadline of each throttled queue is monitored and, if a request in a throttled queue has reached or exceeded the deadline the request is processed in a data storage resource.
申请公布号 US8909764(B2) 申请公布日期 2014.12.09
申请号 US201113193005 申请日期 2011.07.28
申请人 Xyratex Technology Limited 发明人 Umanesan Ganesan
分类号 G06F15/173;H04L29/08 主分类号 G06F15/173
代理机构 Pillsbury Winthrop Shaw Pittman LLP 代理人 Pillsbury Winthrop Shaw Pittman LLP
主权项 1. A method of scheduling requests from a plurality of services to a plurality of data storage resources, the method comprising: a) receiving, on a computer system, service requests from said plurality of services, the service requests comprising metadata specifying a service ID and a data size of payload data associated with said service request, at least some of said service IDs having service throughput metadata specifying a required service throughput associated therewith; b) arranging, in a computer system, said requests into FIFO throttled queues based on said service ID; c) setting, on a computer system, a deadline for processing of an nth request having a particular service ID in a throttled queue, the deadline being selected in dependence upon the size of the request and the required service throughput associated therewith the sum of the data sizes of the first to the nth requests having said particular service ID and the required service throughput associated with said particular service ID; d) monitoring, on a computer system, the deadline of each throttled queue and, if a request in a throttled queue has reached or exceeded the deadline, processing said request in a data storage resource; and e) repeating step c) above.
地址 Havant GB