Research Resource Scheduling Scheme Based on Joint Bidding
Guo Lian, He Wang
Abstract
Guo Lian, He Wang
Abstract
A resource scheduling scheme based on combined bidirectional auction is proposed for resource scheduling across data centers. Based on the definition of user priority and task urgency, the scheme estimates the SLA(service level agreement) violation occurred in each work during the auction process and calculates the income of the cloud provider. Simulation results show that this algorithm ensures the success rate of auction, and compared with the traditional combined bidirectional auction scheme in which a single auction is completed, the energy consumption reduction of this scheme in the auction period and the profit of the auction cloud provider are greatly optimized.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A resource scheduling scheme based on combined bidirectional auction is proposed for resource scheduling across data centers. Based on the definition of user priority and task urgency, the scheme estimates the SLA(service level agreement) violation occurred in each work during the auction process and calculates the income of the cloud provider. Simulation results show that this algorithm ensures the success rate of auction, and compared with the traditional combined bidirectional auction scheme in which a single auction is completed, the energy consumption reduction of this scheme in the auction period and the profit of the auction cloud provider are greatly optimized.
Key concepts: Computer science, Bidding, Reverse auction, Generalized second-price auction, Vickrey auction, Auction theory, Profit (economics), Operations research