Patent ID: 8527998

Claim:
A method for continuously optimizing data archive management scheduling, said method comprising: receiving inputs, by a processor of a computer system via a job scheduler, from an archive management system, wherein the inputs comprise task information, replica placement data, infrastructure topology data, and resource performance data; said processor 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, wherein said modeling comprises creating vertexes organized in multiple levels and creating multiple edges sequentially connecting the vertexes of the multiple levels, wherein the multiple levels consist of N+1 levels denoted as LEVEL 0 , LEVEL 1 , . . . , LEVEL N , wherein N is at least 2, wherein LEVEL 0 comprises a source vertex, wherein LEVEL 1 comprises at least one task vertex associated with said at least one archive management task, wherein EDGE K is directed from the vertex of LEVEL K-1 to the vertex of LEVEL K for K=1, 2, . . . , N, where EDGE 1 indicates that a first task associated with a first task vertex of LEVEL 1 is scheduled by the job scheduler, and wherein EDGE 1 has a first weight equal to a time unit to perform the first task; said processor computing the optimal initial schedule from the optimal path in the flow network; said processor transferring the computed optimal initial schedule to the archive management system to perform the optimal initial schedule; said processor receiving monitoring results of operations of the transferred optimal initial schedule from the archive management system; said processor creating an adjusted schedule as a result of dynamically adjusting the optimal initial schedule based on the received monitoring results; said processor 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; and creating at least one path from the source vertex to a sink vertex in LEVEL N following created edges such that the at least one path represents a respective job schedule for a task in the at least one path by use of at least one storage device volume and at least one computing server in the at least one path to be performed by at least one worker program in the at least one path, wherein the optimal path is a path having a minimum sum of weights of edges in the at least one path.