Exploring bidding strategies for market-based scheduling

Wellman, Michael P.; MacKie-Mason, Jeffrey K.; Reeves, Daniel M.; Swaminathan, Sowmya

doi:10.1145/779928.779943

Cited by 38 publications

(9 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We believe that the major drawback of their approach is that some form of concrete currency is needed, and that is a system feature that we think would not be practical in a real-life situation where there is a tremendous number of machines involved. Similar approaches were also proposed by other researchers [9], [13], [15], [45].…”

Section: Related Worksupporting

confidence: 52%

Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation

Kwok¹,

Hwang

Song

2007

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Selfish behaviors of individual machines in a Grid can potentially damage the performance of the system as a whole. However, scrutinizing the Grid by taking into account the noncooperativeness of machines is a largely unexplored research problem. In this paper, we first present a new hierarchical game-theoretic model of the Grid that matches well with the physical administrative structure in real-life situations. We then focus on the impact of selfishness in intrasite job execution mechanisms. Based on our novel utility functions, we analytically derive the Nash equilibrium and optimal strategies for the general case. To study the effects of different strategies, we have also performed extensive simulations by using a well-known practical scheduling algorithm over the NAS (Numerical Aerodynamic Simulation) and the PSA (Parameter Sweep Application) workloads. We have studied the overall job execution performance of the Grid system under a wide range of parameters. Specifically, we find that the Optimal selfish strategy significantly outperforms the Nash selfish strategy. Our performance evaluation results can serve as a valuable reference for designing appropriate strategies in a practical Grid.

show abstract

Section: Related Worksupporting

confidence: 52%

Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation

Kwok¹,

Hwang

Song

2007

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…In such systems, unpredictability arises from variations in the time taken to transfer data across networks and from the fact that nodes may accept other jobs before their current bids are accepted. Additional, recent work in this domain appears in [29]. Such work may lead to interesting variants of the trust-based algorithm described in this paper, by contributing additional dimensions of uncertainty to decision making.…”

Section: Related Workmentioning

confidence: 99%

Harnessing Shared Wide-area Clusters for Dynamic High End Services

Viswanath

Ahamad

Schwan

2005

2005 IEEE International Conference on Cluster Computing

View full text Add to dashboard Cite

Current trends in distributed computing have been moving towards the use of wide-area clusters that are managed by different entities. In this paper, we introduce middlewarelevel support to facilitate computational resource sharing with service guarantees using non-dedicated server systems in wide-area clusters. The aim is to ensure that sets of computational tasks submitted to such high end systems are completed reliably and in a timely fashion. Our approach develops methods that enhance basic job scheduling with information about the execution history and trust values for the computational nodes to which jobs are assigned. In essence, job scheduling is enriched with trust models constructed and maintained at runtime, and scheduling decisions are based on metrics that capture trust in remote server systems. An implementation of the approach is evaluated on Planetlab, with initial results demonstrating good success rates in completing jobs within their specific service level agreements, including under conditions of high system loads. Additional results are attained with a variant of the scheduling algorithm that uses redundancy to further improve the likelihood of meeting end user SLAs. A representative application considered in this paper is remote data visualization, where substantial computation must be applied to data before displaying it to end users. SLAs capture desired end-to-end delay, and distributed server or cluster systems are used to perform the required computations in a timely manner.

show abstract

“…The social efficiency and price stability were studied using the Vickrey auction theory [19]. Similar approaches were also proposed by other researchers [5], [7], [8], [26].…”

Section: Related Workmentioning

confidence: 99%

Selfish grid computing: game-theoretic modeling and NAS performance results

Kwok

Song

Hwang

2005

CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.

View full text Add to dashboard Cite

Abstract-Selfish behaviors of individual machines in a Grid can potentially damage the performance of the system as a whole. However, scrutinizing the Grid by taking into account the noncooperativeness of machines is a largely unexplored research problem. In this paper, we first present a new hierarchical gametheoretic model of the Grid that matches well with the physical administrative structure in real-life situations. We then focus on the impact of selfishness in intra-site job execution mechanisms. Based on our novel utility functions, we analytically derive the Nash equilibrium and optimal strategies for the general case.To study the effects of different strategies, we have also performed extensive simulations by using a well-known practical scheduling algorithm over the NAS (Numerical Aerodynamic Simulation) workload. We have studied overall job execution performance of the Grid system under a wide range of parameters. Specifically, we find that the Optimal selfish strategy significantly outperforms the Nash selfish strategy. Our performance evaluation results can serve as valuable reference for designing appropriate strategies in a practical Grid.

show abstract

Exploring bidding strategies for market-based scheduling

Cited by 38 publications

References 33 publications

Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation

Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation

Harnessing Shared Wide-area Clusters for Dynamic High End Services

Selfish grid computing: game-theoretic modeling and NAS performance results

Contact Info

Product

Resources

About