Systems and methods for reducing CPU time to compute state space of resource allocation system

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), is computed by small enough configuration of the considered RAS. Given an initial resource configuratio...

Full description

Saved in:
Bibliographic Details
Main Authors Li, Zhiwu, Wu, Naiqi, Karoui, Oussama, Khalgui, Mohamed
Format Patent
LanguageEnglish
Published 09.07.2019
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary: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), is computed by small enough configuration of the considered RAS. Given an initial resource configuration 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 instructions that compute a target state space of a RAS includes constructing an initial RAS and an initial state space, and extending the initial state space iteratively under a target resource configuration.
Bibliography:Application Number: US201715649634