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.
(Score: 2) by AnonTechie on Thursday June 19 2014, @02:16PM
How does this stack up in real world scenarios ?? We have bloatware, crapware, vapourware, Windows, *NIX, and a whole bunch of games !!
Albert Einstein - "Only two things are infinite, the universe and human stupidity, and I'm not sure about the former."
(Score: 1, Interesting) by Anonymous Coward on Thursday June 19 2014, @02:19PM
Econ theory applied to computers interesting...
I had an econ teacher that was obsessed with linear algebra. Now that I think about this could work really well. You could solve the problems very quickly. If you could properly attach a cost to each resource. Though I am not sure I would want an O(n^2) in my schedule program. But for an upfront resource allocation it might work very well.
(Score: 1) by BradTheGeek on Thursday June 19 2014, @08:58PM
Instead of game theory, lets use Game of Thrones theory. If it doesn't fit the schedule, kill it.