Sign In

Communications of the ACM

ACM TechNews

Scheduling Algorithms Based on Game Theory Makes Better ­se of Computational Resources

View as: Print Mobile App Share:
A new scheme for efficient allocation of computational resources relies on game-theory-based scheduling algorithms.

A new scheme developed for the efficient allocation of computational resources relies on three game-theory-based scheduling algorithms that help minimize execution time, reduce cost and limit storage requirements.

Credit: agsandrew/istock/thinkstock

Researchers at the A*STAR Institute of High Performance Computing have developed a method to address the scheduling problem in the ASTRO program from the field of cosmology and the WIEK2k program from the field of theoretical chemistry.

Their scheme relies on a game theory-based scheduling algorithm to minimize the execution time. The scheme also is based on an algorithm to reduce the economic cost and another one to limit the storage requirements.

The researchers say their approach shows improvements in terms of speed, cost, scheduling results, and fairness. In addition, the researchers found the execution time improved as the scale of the experiment increased.

"Our game theory-based scheduling algorithms possess great potential for large-scale applications," says A*STAR's Rubing Duan. "We are looking into how the algorithms adapt to other metrics, such as memory, security, resource availability, network bandwidth, and multiple virtual organizations."

However, the researchers say their algorithms may not be suited for applications that are highly heterogeneous.

From A*STAR Research
View Full Article


Abstracts Copyright © 2014 Information Inc., Bethesda, Maryland, USA


No entries found

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account