Abstract: A method and associated system for continuously optimizing data archive management scheduling. A flow network is modeled, which creates vertexes organized in multiple levels and creating multiple edges sequentially connecting the vertexes of the multiple levels. The multiple levels consist of N+1 levels denoted as LEVEL0, LEVEL1, . . . , LEVELN, wherein N is at least 2, wherein LEVEL0 includes a source vertex, wherein LEVEL1 includes at least one task vertex associated with at least one archive management task, wherein EDGEK is directed from the vertex of LEVELK?1 to the vertex of LEVELK for K=1, . . . , N, wherein EDGE1 indicates that a first task associated with a first task vertex of LEVEL1 is scheduled by a job scheduler, and wherein EDGE1 has a first weight equal to a time unit to perform the first task.

Abstract: A method and associated system for continuously optimizing data archive management scheduling. A flow network is modeled, which creates vertexes organized in multiple levels and creating multiple edges sequentially connecting the vertexes of the multiple levels. The multiple levels consist of N+1 levels denoted as LEVEL0, LEVEL1, . . . , LEVELN, wherein N is at least 2, wherein LEVEL0 includes a source vertex, wherein LEVEL1 includes at least one task vertex associated with at least one archive management task, wherein EDGEK is directed from the vertex of LEVELK-1 to the vertex of LEVELK for K=1, . . . , N, wherein EDGE1 indicates that a first task associated with a first task vertex of LEVEL1 is scheduled by a job scheduler, and wherein EDGE1 has a first weight equal to a time unit to perform the first task.

Abstract: A method and associated system for continuously optimizing data archive management scheduling. A flow network is modeled. The flow network represents data content, software programs, physical devices, and communication capacity of the archive management system in various levels of vertices such that an optimal path in 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.

Abstract: A method and associated system for continuously optimizing data archive management scheduling. A flow network is modeled. The flow network represents data content, software programs, physical devices, and communication capacity of the archive management system in various levels of vertices such that an optimal path in 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.

Abstract: A computer-implemented method for determining, from a system including a plurality of data center resources, at least one configuration of data center resources for an implementation of an application. The method includes receiving application information and receiving information regarding known internal features up the data center resources. The method also includes provisioning the system of data center resources and creating possible configurations of data center resources for implementing application. The method also includes correlating models and data center resources to create an interrelated representation of the models and the data center resources. The models predict a relationship of parameters for the possible configurations.