Abstract: A configuration model for an existing software solution, which is distributed over a plurality of existing machines, is discovered. The model includes a plurality of configuration items, which in turn include a plurality of independent attributes and a plurality of dependent attributes, with the plurality of dependent attributes being derivable from the plurality of independent attributes based on a plurality of constraints. The configuration model is stored in a repository, together with disk images, resource configuration details, and logical names of pertinent ones of the existing machines. Specifications of new values of the independent attributes are obtained, and new values of the dependent attributes are computed from the new values of the independent attributes, based on executing the constraints on the configuration model.

Abstract: A system for preventing deadlock in a distributed computing system includes a memory and at least one processor coupled to the memory. The processor is operative: to receive as input a sorted set of containers defining a unique global sequence of containers for servicing process requests; to populate at least one table based at least in part on off-line analysis of call graphs defining corresponding transactions for a given order of the containers in the sorted set; to store within each container at least a portion of the at least one table; and to allocate one or more threads in a given container according to at least a portion of the at least one table stored within the given container.

Abstract: A system for preventing deadlock in a distributed computing system includes a memory and at least one processor coupled to the memory. The processor is operative: to receive as input a sorted set of containers defining a unique global sequence of containers for servicing process requests; to populate at least one table based at least in part on off-line analysis of call graphs defining corresponding transactions for a given order of the containers in the sorted set; to store within each container at least a portion of the at least one table; and to allocate one or more threads in a given container according to at least a portion of the at least one table stored within the given container.

Abstract: A method for preventing deadlock in a distributed computing system includes the steps of: receiving as input a sorted set of containers defining a unique global sequence of containers for servicing process requests; populating at least one table based at least in part on off-line analysis of call graphs defining corresponding transactions for a given order of the containers in the sorted set; storing within each container at least a portion of the table; and allocating one or more threads in a given container according to at least a portion of the table stored within the given container.

Abstract: A method for preventing deadlock in a distributed computing system includes the steps of: receiving as input a sorted set of containers defining a unique global sequence of containers for servicing process requests; populating at least one table based at least in part on off-line analysis of call graphs defining corresponding transactions for a given order of the containers in the sorted set; storing within each container at least a portion of the table; and allocating one or more threads in a given container according to at least a portion of the table stored within the given container.

Abstract: A field map is applied to elements in a data representation of data from a source database to identify schema elements in a schema. Hierarchical relationships between schema elements that are described in the schema are used to construct a hierarchical data representation from the data representation. Based on the hierarchical relationship between two elements in the hierarchical data representation, it is determined that a first database object must be instantiated before a second database object. After ensuring that the first database object has been created and stored, the second database object is created and stored.

Abstract: A field map is applied to elements in a data representation of data from a source database to identify schema elements in a schema. Hierarchical relationships between schema elements that are described in the schema are used to construct a hierarchical data representation from the data representation. Based on the hierarchical relationship between two elements in the hierarchical data representation, it is determined that a first database object must be instantiated before a second database object. After ensuring that the first database object has been created and stored, the second database object is created and stored.