The MathWorks, Inc.

Techniques generate and display a visual construct to navigate tabular data and visually understand search results across the tabular data. The visual construct may include a level with one or more markers. The level may represent the entirety of the tabular data. Each marker may represent a different portion of the tabular data and may be located at a particular location on the level with a visual attribute. The locations and the visual attributes of the markers provide a visual understanding regarding search hits and their distribution across the entirety of the tabular data. Each marker may be selected to navigate the tabular data. Based on the selection of a marker that represents a portion of the tabular data, an additional level may be generated with additional markers. The additional markers provide a visual understanding regarding search hits and their distribution across the portion of the tabular data.

Systems and methods may analyze a simulation model that includes model elements configured to operate as variants. The variants may be controlled by variant conditions that may include variant control variables. A group of variant configurations may be defined for the model where each variant configuration may include a different set of the variant control variables. For each variant configuration, the systems and methods may determine which model elements configured to operate as variants are active and which model elements are inactive. The systems and methods may also determine which model elements, if any, are always active, are never active, or are sometimes active. A visualization tool may present the results of the variant configuration analysis in the form of a heatmap, a textual report, an annotated version of the simulation model, or graph, among other forms.

Systems and methods utilize an auto-scheduler of a Domain Specific Language (DSL) to schedule one or more portions of a computer program written in a programming language other than the DSL. Portions of the computer program compatible with the DSL may be identified. The portions may be translated to a form compatible with the DSL. The DSL may generate schedules for the portions. Code may be generated for the computer program and the code may be executed. The schedules generated by the DSL may be utilized during execution of the code generated for the computer program.

A data storage system can implement a key-value engine configured for tunable read, write, and space amplification. The key-value engine can support multi-versioning, synchronous and asynchronous key updates, and read snapshots. The key-value engine is highly scalable and can support generalized parallel, in-memory computation. Experimental results demonstrate that a key-value engine consistent with disclosed embodiments can outperform a state-of-the-art production LSM-based key-value store in a wide range of metrics.

Systems and methods are provided for design validation using a validation computing device and a designer computing device. The validation computing device can be configured to obtain a dataset and a record of designer interactions, provide a validation interface, and update a record of reviewer interactions. The validation interface can include a design option indicator, a justification indicator, a visualization display, and a validation control. The reviewer interactions can include rejecting a modification of a design option. The designer computing device can be configured to obtain the record of reviewer interactions; display the rejection of the modification; and provide a design interface for revising the modification or revising a justification of the modification.

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 providing metric data for patterns in a modeling environment are disclosed. In some aspects, contexts for generating metric data for a pattern are constructed. The pattern represents one or more computations executable in the modeling environment and associated with operation or behavior of a real-world system. The contexts include information about the pattern. The metric data is associated with one or more objectives with which the use of the pattern is associated. Code for the pattern for each context is generated. Metric data is generated for the pattern and under each context. The metric data of the pattern under each context is associated with the objectives. The metric data and the association are stored for use in providing information about or based on the metric data when the pattern is to be or is used in a model representing the real-world system.

A data storage system can implement a key-value engine configured for tunable read, write, and space amplification. The key-value engine can support multi-versioning, synchronous and asynchronous key updates, and read snapshots. The key-value engine is highly scalable and can support generalized parallel, in-memory computation. Experimental results demonstrate that a key-value engine consistent with disclosed embodiments can outperform a state-of-the-art production LSM-based key-value store in a wide range of metrics.

Exemplary embodiments may programmatically determine the number and locations of breakpoints and table values in a lookup table so as to reduce their counts. In some exemplary embodiments, the minimum number of breakpoints and breakpoint locations that conform with the error tolerance may be determined along with table values for those breakpoints. The exemplary embodiments may determine if a lookup table that conforms with the error tolerance is feasible and may inform a user of the feasibility or infeasibility of generating the lookup table. Where it is feasible to generate the lookup table, the exemplary embodiments may provide automatic programmatic generation of a lookup table with minimal breakpoints and optimal or near-optimal table values.

Systems and methods are provided for performing at least one operation using data in a preferred data layout, while preserving the ability to access the data in an original data layout. The preferred data layout may be independent of the original data layout. The preferred data layout may be selected based on at least one of a characteristic of the data, a characteristic of the computing environment or computing device(s) implementing the computing environment, a characteristic of the at least one operation, or historical performance data. The data may be rearranged or permuted into the preferred layout. A mapping may be determined between the preferred layout and the original layout. During performance of the at least one operation using the data in the preferred layout, another operation may use the mapping to access the data in the original layout.