Systems and Methods for Reducing CPU Time to Compute State Space of Resource Allocation System

• Main Authors: KAROUI, Oussama, KHALGUI, Mohamed, LI, Zhiwu, WU, Naiqi
• Format: Patent
• Language: English
• Published: 24.08.2017
• Subjects: CALCULATING; COMPUTING; COUNTING; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS

Given a sequential resource allocation system (RAS) topology structure, a state space, called an impulse state space, corresponding to the impulse response of a linear time-invariant system (LTS), 5 is computed by small enough configuration of the considered RAS. Given an initial resource con figuration of a RAS which corresponds to an input of an LTS, a complete state enumeration can be obtained by defining the convolution of this configuration with the pre-computed impulse state space. One example embodiment reduces central processing unit (CPU) time to process instruc tions that compute a target state space of a RAS includes constructing an initial RAS and an initial 0 state space, and extending the initial state space iteratively under a target resource configuration. 100> constructing an initial RAS D(0) by imposing a predefined initial resource configuration Co to each system resource type RpcR computing an initial state space S((C 0 )) of the initial RAS ( 0) reducing CPU time to process instructions that compute a target state space S(cP) of the RAS by extending the initial state space S(o(0)) iteratively under a target resource configuration C with each iteration creates a subspace based on a linear time-variant system (LTS) from a resource configuration C) of step i, imposing an impulse resource configuration C1+) in which a capacity of a resource is increased by one unit calculating a convolution of an input signal with an impulse response in a LTS that outputs a larger state space, wherein the resource configuration corresponds to the input signal, the impulse resource configuration corresponds to the impulse response Figure 1