Javascript must be enabled to continue!
DataFlow based- Automatic parallelization of MATLAB/Simulink models for Fitting Modern Multicore Architectures
View through CrossRef
Abstract
In many fields including aerospace, automotive, and telecommunications, Math-Works’ MATLAB/Simulink is the current de facto standard for model-based design. The strengths of Simulink are rapid design and algorithm exploration. Models created with Simulink are just functional. Therefore, designers cannot effortlessly consider a Simulink model’s architecture. As today’s architectures are optimized to run on multicore, Software running on multicore processors must be parallelized to fully utilize their natural performance. For instance, designers need to understand how a Simulink model could be parallelized and how an adequate multicore architecture is selected. This paper focuses on the dataflow-based parallelization of Simulink models and proposes a method based on dataflow to measure the performance of parallelized Simulink models running on multi-core architectures. Throughout the parallelization process, the model is converted into a Hierarchical Synchronous DataFlow Graph (HSDFG) keeping its original semantics, and each composite node in the graph is flattened. Then, the graph is mapped and scheduled into a multicore architecture with the ultimate objective that minimizing the total execution time. In the experiment of applying the proposed approach to a real model from the automotive industry, the execution time of the parallelized model could be reduced successfully on a multi-core processor.
Title: DataFlow based- Automatic parallelization of MATLAB/Simulink models for Fitting Modern Multicore Architectures
Description:
Abstract
In many fields including aerospace, automotive, and telecommunications, Math-Works’ MATLAB/Simulink is the current de facto standard for model-based design.
The strengths of Simulink are rapid design and algorithm exploration.
Models created with Simulink are just functional.
Therefore, designers cannot effortlessly consider a Simulink model’s architecture.
As today’s architectures are optimized to run on multicore, Software running on multicore processors must be parallelized to fully utilize their natural performance.
For instance, designers need to understand how a Simulink model could be parallelized and how an adequate multicore architecture is selected.
This paper focuses on the dataflow-based parallelization of Simulink models and proposes a method based on dataflow to measure the performance of parallelized Simulink models running on multi-core architectures.
Throughout the parallelization process, the model is converted into a Hierarchical Synchronous DataFlow Graph (HSDFG) keeping its original semantics, and each composite node in the graph is flattened.
Then, the graph is mapped and scheduled into a multicore architecture with the ultimate objective that minimizing the total execution time.
In the experiment of applying the proposed approach to a real model from the automotive industry, the execution time of the parallelized model could be reduced successfully on a multi-core processor.
Related Results
Innovations in Multicore Network Processor Design for Enhanced Performance
Innovations in Multicore Network Processor Design for Enhanced Performance
The rapid expansion of network traffic, driven by the proliferation of internet-connected devices and the growing demand for high-speed data transmission, has intensified the need ...
Efficient evaluation of mappings of dataflow applications onto distributed memory architectures
Efficient evaluation of mappings of dataflow applications onto distributed memory architectures
Evaluation de l'affectation des tâches sur une architecture à mémoire distribuée pour des modèles flot de données
Avec l'augmentation de l'utilisation des smartphon...
Software synthesis from dataflow schedule graphs
Software synthesis from dataflow schedule graphs
AbstractThe dataflow-model of computation is widely used in design and implementation of signal processing systems. In dataflow-based design processes, scheduling—the assignment an...
Fine Grain Algorithm Parallelization on a Hybrid Control-flow and Dataflow Processor
Fine Grain Algorithm Parallelization on a Hybrid Control-flow and Dataflow Processor
Abstract
The execution time of a high performance computing algorithm depends on multiple factors: the algorithm scalability, the chosen hardware, the communication speed b...
HAD:A Prototype Of Dataflow Compute Architecture
HAD:A Prototype Of Dataflow Compute Architecture
Abstract
To investigate the features, implementation, and applications of data flow architecture, a novel dataflow computing system, HAD (Hardware Accelerated Dataflow), is...
Probabilistically time-analyzable complex processor designs
Probabilistically time-analyzable complex processor designs
Industry developing Critical Real-Time Embedded Systems (CRTES), such as Aerospace, Space, Automotive and Railways, faces relentless demands for increased guaranteed processor perf...
Scalable Dense Linear Algebra on Heterogeneous Hardware
Scalable Dense Linear Algebra on Heterogeneous Hardware
Design of systems exceeding 1 Pflop/s and the push toward 1 Eflop/s, forced a dramatic shift in hardware design. Various physical and engineering constraints resulted in introducti...
Parallelization Strategies for ODE Solvers on Multicore Cluster Systems
Parallelization Strategies for ODE Solvers on Multicore Cluster Systems
Mathematical models involving ordinary differential equation (ODEs) arise in many diverse applications, such as fluid flows, physics-based animation, mechanical systems, mathematic...

