| Title | Apply Game Theory to Distributed Computing Scheduling | |
| Date | Thursday June 19 2014, @01:34PM | |
| Author | LaminatorX | |
| Topic | ||
| from the Win-Lose-or-Draw dept. | ||
Researchers have applied game theory to scheduling algorithms to optimise distributed computing.
The researchers' new scheme relies on three game-theory-based scheduling algorithms: one to minimize the execution time; one to reduce the economic cost; and one to limit the storage requirements.
The researchers performed calculations wherein they stopped the competition for resources when the iteration reached the upper limit of optimization. They compared their simulation results with those from related algorithms; namely, Minimum Execution Time, Minimum Completion Time, Opportunistic Load Balancing, Max-min, Min-min and Sufferage. The new approach showed improvements in terms of speed, cost, scheduling results and fairness. Furthermore, the researchers found that the execution time improved as the scale of the experiment increased. In one case, their approach delivered results within 0.3 seconds while other algorithms needed several hours.
| Links |
printed from SoylentNews, Apply Game Theory to Distributed Computing Scheduling on 2025-04-21 10:54:56