Abstract: One or more implementations relate generally to a platform architecture planning process utilizing architecture type unit definitions. For example, an architecture for realizing a customer system on a cloud computing platform may be defined in terms of a plurality of architecture types, each type (AT) defined by plural architecture type units (ATUs), and each ATU comprising a set of ATU Details.

Abstract: One or more implementations relate generally to a platform architecture planning process utilizing architecture type unit definitions. For example, an architecture for realizing a customer system on a cloud computing platform may be defined in terms of a plurality of architecture types, each type (AT) defined by plural architecture type units (ATUs), and each ATU comprising a set of ATU Details.

Abstract: An architecture for realizing a customer system on a cloud computing platform is defined in terms of a plurality of architecture types, each type (AT) defined by plural architecture type units (ATUs), each ATU comprising a set of ATU Details. The ATU Details are ordered into a series of discrete stages. Maturity of the architecture is determined as a single architecture pulse (AP) numeric value for each architecture type. The pulse reflects the extent to which the ATUs of the architecture type have reached a requisite level of quality, and an extent to which the ATUs are created in a sequence consistent with the series of discrete stages. The AP pulse values may be combined to form a single success platform pulse (SPP) for tracking overall condition of the platform architecture with a single numerical value.

Abstract: In an example, a method for developing a customer system utilizing a preexisting cloud-computing platform is provided. The method may include defining a platform architecture for the customer system to be developed in terms of a plurality of architecture types—and their predefined architecture type units. The method may include generating structured information arranged to evaluate a staggered resource deployment associated with planning resources to be allocated before a development cycle of the customer system. The method may include evaluating a first prospective planning resource deployment of the staggered resource deployment using scope screen information of the generated structured information, and evaluating a second prospective planning resource deployment using capability information, after a time of deployment of a planning resource corresponding to the first prospective planning resource deployment.

Abstract: An architecture for realizing a customer system on a cloud computing platform is defined in terms of a plurality of architecture types, each type (AT) defined by plural architecture type units (ATUs), each ATU comprising a set of ATU Details. The ATU Details are ordered into a series of discrete stages. Maturity of the architecture is determined as a single architecture pulse (AP) numeric value for each architecture type. The pulse reflects the extent to which the ATUs of the architecture type have reached a requisite level of quality, and an extent to which the ATUs are created in a sequence consistent with the series of discrete stages. The AP pulse values may be combined to form a single success platform pulse (SPP) for tracking overall condition of the platform architecture with a single numerical value.

Abstract: The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.

Abstract: The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.