• Home
  • Search
  • Code Generation from Simulink Models with Task and Data Parallelism
  • Cite Icon5
  • https://doi.org/10.24297/ijct.v21i.9004Copy DOI Icon

Code Generation from Simulink Models with Task and Data Parallelism

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we propose a method to automatically generate parallelized code from Simulink models, while exploiting both task and data parallelism. Building on previous research, we propose a model-based parallelizer (MBP) that exploits task parallelism and assigns tasks to CPU cores using a hierarchical clustering method. We also propose amethod in which data-parallel SYCL code is generated from Simulink models; computations with data parallelism are expressed in the form of S-Function Builder blocks and are executed in a heterogeneous computing environment. Most parts of the procedure can be automated with scripts, and the two methods can be applied together. In the evaluation, the data-parallel programs generated using our proposed method achieved a maximum speedup of approximately 547 times, compared to sequential programs, without observable differences in the computed results. In addition, the programs generated while exploiting both task and data parallelism were confirmed to have achieved better performance than those exploiting either one of the two.

Loading PDF

Similar Papers
  • Conference Article
  • Citations28

Braid: integrating task and data parallelism

  • Nov 19, 2002
  • E.A West +1
  • Single Report
  • Citations5

Task parallelism and high-performance languages

  • Mar 01, 1996
  • I Foster
  • Research Article
  • Citations3

Mixed data and task parallelism with HPF and PVM

  • Jan 01, 2000
  • Cluster Computing
  • Salvatore Orlando +2
  • Research Article
  • Citations6

Combining Task- and Data Parallelism to Speed up Protein Folding on a Desktop Grid Platform Is efficient protein folding possible with CHARMM on the United Devices MetaProcessor?

  • Jan 01, 2002
  • Repository for Publications and Research Data (ETH Zurich)
  • B Uk +5
  • Conference Article

Application of an object-oriented parallel run-time system to a Grand Challenge 3D multi-grid code

  • Jan 01, 1996
  • C Baillie +2
  • Conference Article
  • Citations72

A new model for integrated nested task and data parallel programming

  • Jun 21, 1997
  • Jaspal Subhlok +1
  • Research Article
  • Citations11

A new model for integrated nested task and data parallel programming

  • Jun 21, 1997
  • ACM SIGPLAN Notices
  • Jaspal Subhlok +1
  • Research Article
  • Citations64

A task- and data-parallel programming language based on shared objects

  • Nov 01, 1998
  • ACM Transactions on Programming Languages and Systems
  • Saniya Ben Hassen +2
  • Conference Article
  • Citations10

Combining task- and data parallelism to speed up protein folding on a desktop grid platform

  • Jan 01, 2003
  • B Uk +5
  • Research Article
  • Citations61

Exploiting task and data parallelism on a multicomputer

  • Jul 01, 1993
  • ACM SIGPLAN Notices
  • Jaspal Subhlok +3
  • Conference Article
  • Citations144

Exploiting task and data parallelism on a multicomputer

  • Jan 01, 1993
  • Jaspal Subhlok +3
  • Conference Article
  • Citations26

An Integrated Approach for Processor Allocation and Scheduling of Mixed-Parallel Applications

  • Oct 24, 2006
  • N Vydyanathan +6
  • Conference Article
  • Citations3

A framework for generating task parallel programs

  • Jan 01, 1999
  • U Fissgus +2
  • Research Article
  • Citations6

EXTENDING OPENMP FOR TASK PARALLELISM

  • Sep 01, 2003
  • Parallel Processing Letters
  • Ami Marowka
  • Research Article
  • Citations2

PoKiTT: Exposing Task and Data Parallelism on Heterogeneous Architectures for Detailed Chemical Kinetics, Transport, and Thermodynamics Calculations

  • Jan 01, 2016
  • SIAM Journal on Scientific Computing
  • Nathan Yonkee +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.