Scheduling user requests in a distributed resource system having a plurality of schedulers and coordinators

摘要

According to a method for scheduling a user request in a distributed resource system, an apparatus, and a system that are provided by embodiments of the present invention, in a Tn+1 period, an Sd acquires, from a coordinator Gk of a user z, a resource Cz(Tn) that is consumed by a user z request in a Tn period, and the Sd schedules, according to φz, Cz(Tn), Cz,d(Tn), and Nz,d(Tn), a Piz,d by using a scheduling algorithm. The user z request can be scheduled without depending on a user agent. In addition, the Sd schedules, according to φz, Cz(Tn), Cz,d(Tn), and Nz,d(Tn), the Piz,d by using the scheduling algorithm, thereby implementing global scheduling on the user z request and ensuring a performance requirement of the user z.

主权项

1. A method for scheduling a user request in a distributed resource system, wherein the distributed resource system comprises schedulers S1, . . . SM, resource-providing entities R1, . . . RM, and coordinators G1 . . . Gy, wherein the Sx, communicates with the Rx, x is any one of consecutive natural numbers from 1 to M, and M≧2; Y is a natural number, M≧Y≧1; the Gy communicates with any Sx, y is any one of consecutive natural numbers from 1 to Y, Gy is one of G1 . . . Gy; and the method comprises:
acquiring, by an Sd in a Tn+1 period and from a coordinator Gk of a user z, a resource Cz(Tn) that is consumed by a user z request in a Tn period, whereinCz⁡(Tn)=∑x=1M⁢⁢Cz,x⁡(Tn);d is any one of consecutive natural numbers from 1 to M , Sd is one of schedulers S1, . . . SM which receives the user z request, n is a natural number, and k is one of consecutive natural numbers from 1 to Y; a resource weight of the user z is φz; Cz,x(Tn) is a quantity of resources that are provided by the Rx and consumed by Nz,x(Tn) user z requests received by the Sx, in the Tn period; and z indicates an identifier of the user; and
computing, by the Sd according to φz, Cz(Tn), Cz,d(Tn), and Nz,d(Tn), a virtual start time S(Piz,d) and a virtual finish time F(Piz,d) of the Piz,d and adding the Piz,d to a scheduling queue, wherein the scheduling queue ranks the user request according to a value of the virtual start time of the user request, wherein the Piz,d is the ith user z request received by the Sd, and Cz,d (Tn) is a quantity of resources that are provided by an Rd and consumed by Nz,d(Tn) user z requests received by the Sd in the Tn period.