The Mathworks, Inc.

Yuchen Zhang

Xiaocang Lin

Partha Biswas

William F Potter

Beth Cockerham

Chirag Gupta

Mario Bambagini

Dixin Zhou

Systems and methods determine tight Worst Case Execution Time (WCET) for a simulation model or code generated for a model. Composite code blocks may be constructed from basic code blocks of an in-memory representation of the model. Information on the model and its elements may be obtained and utilized to construct the composite code blocks. The composite code blocks may be instrumented and execution times may be measured for the composite code blocks. The execution times for the composite code blocks along paths through the model may be summed and the highest total execution time may be presented as the WCET for the model and/or the code generated for the model.

Systems and methods for performing worst-case execution time analysis of simulation models

A device receives a model, in a technical computing environment, that includes blocks and lines, and determines an application domain associated with the model. The device determines code generation optimizations for the model, determines dependencies of the code generation optimizations, and determines performance characteristics for the device. The device determines capabilities of a target compiler for the code generated based on the model, and determines a profile for target hardware to be used to execute the code. The device identifies an order for the code generation optimizations based on the determined information, generates optimal code for the model based on the identified order for the code generation optimizations, and outputs and/or store the optimal code.

Automatic generation of domain-aware phase ordering for effective optimization of code for a model

A device receives a model that includes blocks and lines provided between the blocks, and identifies first candidate boundaries for the model. Each of the first candidate boundaries defines a group of blocks. The device generates an intermediate representation (IR) of the model, performs an optimization of the IR to generate an optimized IR, and identifies second candidate boundaries for the model based on the optimized IR. Each of the second candidate boundaries defines a group of blocks, and the first and second candidate boundaries define a set of candidate boundaries. The device reduces the set of candidate boundaries, to a reduced set of boundaries, based on code efficiency metrics or metrics associated with a hardware platform. The device generates code for the model based on the reduced set of boundaries, and outputs the code.

Automatic generation of an optimized arrangement for a model and optimized code based on the model

Growing community of inventors

Dover, MA, United States of America

Yuchen Zhang