Learning non-cooperative game for load balancing under self-interested distributed environment
Authors:
- Zheng XiaoZXZheng Xiao
- Zhao TongZTZhao Tong
- Kenli LiKLKenli Li
- Keqin LiKLKeqin Li
- 1 March 2017
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 52, 376-386
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61402157, 61502165)
- Hunan Provincial Natural Science Foundation (13JJ4038)
This publication has 22 references indexed in Scilit:
- Honey bee behavior inspired load balancing of tasks in cloud computing environmentsApplied Soft Computing, 2013
- Game-theoretic static load balancing for distributed systemsJournal of Parallel and Distributed Computing, 2011
- A view of cloud computingCommunications of the ACM, 2010
- Game-Theoretic Approach for Load Balancing in Computational GridsIEEE Transactions on Parallel and Distributed Systems, 2007
- Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark EvaluationIEEE Transactions on Parallel and Distributed Systems, 2007
- Noncooperative load balancing in distributed systemsJournal of Parallel and Distributed Computing, 2005
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001
- Static scheduling algorithms for allocating directed task graphs to multiprocessorsACM Computing Surveys, 1999
- Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing SystemsJournal of Parallel and Distributed Computing, 1999
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1996