2019•DEStech Transactions on Computer Science and EngineeringOpen access

Research Resource Scheduling Scheme Based on Joint Bidding

Guo Lian, He Wang

Open full text 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Bidding, Reverse auction, Generalized second-price auction, Vickrey auction, Auction theory, Profit (economics), Operations research

Related papers

Back to paper searchBrowse research topicsOriginal source
Research Resource Scheduling Scheme Based on Joint Bidding — Research Paper | ScholarLens