Dynamic Clustering Heuristic Method for Smart Grid Computing

Abstract

Efficient scheduling has appeared as a fundamental problem in smart grid computing systems. Since finding an optimal scheduling on the system to minimize the program completion time is a well-known NP-complete problem in general, researchers have resorted to devising efficient heuristics. In this paper, we present a dynamic scheduling heuristic which is appropriate for the system. The goal is realized with four general metrics and two additional restricted metrics, which not only take the communication cost, priority, mutex between jobs into account, but also consider the characteristic of the resource, such as the storage capability and the dynamic characteristic in smart grid computing.