Patent ID: 8276148
Filing Date: 2012-09-25
Classification: G06F

Abstract:
1. A method for continuously optimizing data archive management scheduling, said method comprising: a job scheduler receiving inputs from an archive management system, wherein the inputs comprise task information, replica placement data, infrastructure topology data, and resource performance data; modeling a flow network from the received inputs, such that the flow network represents data content, software programs, physical devices, and communication capacity of the archive management system, and such that an optimal path of the flow network from a task of at least one archive management task to a worker program of the archive management system represents an optimal initial schedule for the worker program to perform the task; a processor of a computer system computing the optimal initial schedule from the optimal path in the flow network; transferring the computed optimal initial schedule to the archive management system to perform the optimal initial schedule; receiving monitoring results of operations of the transferred optimal initial schedule from the archive management system; creating an adjusted schedule as a result of dynamically adjusting the optimal initial schedule based on the received monitoring results; and transferring the adjusted schedule to the archive management system to perform the adjusted schedule such that the archive management system generates new monitoring results of operations of the transferred adjusted schedule; wherein said modeling the flow network comprises: creating vertices organized in eight levels comprising LEVEL_ creating edges organized in seven types comprising EDGE_ assigning weights to the created edges, creating at least one path from the source vertex to the sink vertex following created edges such that the created at least one path represents a respective job schedule for a task in the path by use of at least one storage device volume and at least one computing server in the path to be performed by at least one worker program in the path, wherein the optimal path is a path having a minimum sum of weights of edges in the path.