Optimized code generation for heterogeneous computing environment using parallelizing compiler TINPAR

Author(s):  
S. Goto ◽  
A. Kubota ◽  
T. Tanaka ◽  
M. Goshima ◽  
S. Mori ◽  
...  
2021 ◽  
Vol 21 ◽  
pp. 1-13
Author(s):  
Pin Xu ◽  
Masato Edahiro ◽  
Kondo Masaki

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.


Author(s):  
Absalom El-Shamir Ezugwu ◽  
Marc Eduard Frincu ◽  
Sahalu Balarabe Junaidu

This paper presents a conceptual perspective on scheduling systems' design pattern for several classes of multi-component applications. The authors consider this scheduling problem in a wide-area network of heterogeneous computing environment. The heterogeneity in both the user application and distributed resource environments make this a challenging problem. In addition, the authors propose a component-based reference architectural model, which describes the design of a general purpose scheduling system targeted at the scheduling of multi-component applications. The design goal is to identify and map out the necessary ingredients required to effectively perform the scheduling of multi-component applications.


2008 ◽  
Vol 9 (12) ◽  
pp. 1715-1723 ◽  
Author(s):  
Ehsan Ullah Munir ◽  
Jian-zhong Li ◽  
Sheng-fei Shi ◽  
Zhao-nian Zou ◽  
Qaisar Rasool

2019 ◽  
Vol 2019 ◽  
pp. 1-18 ◽  
Author(s):  
Xin Fang ◽  
Stratis Ioannidis ◽  
Miriam Leeser

Secure Function Evaluation (SFE) has received recent attention due to the massive collection and mining of personal data, but remains impractical due to its large computational cost. Garbled Circuits (GC) is a protocol for implementing SFE which can evaluate any function that can be expressed as a Boolean circuit and obtain the result while keeping each party’s input private. Recent advances have led to a surge of garbled circuit implementations in software for a variety of different tasks. However, these implementations are inefficient, and therefore GC is not widely used, especially for large problems. This research investigates, implements, and evaluates secure computation generation using a heterogeneous computing platform featuring FPGAs. We have designed and implemented SIFO: secure computational infrastructure using FPGA overlays. Unlike traditional FPGA design, a coarse-grained overlay architecture is adopted which supports mapping SFE problems that are too large to map to a single FPGA. Host tools provided include SFE problem generator, parser, and automatic host code generation. Our design allows repurposing an FPGA to evaluate different SFE tasks without the need for reprogramming and fully explores the parallelism for any GC problem. Our system demonstrates an order of magnitude speedup compared with an existing software platform.


Author(s):  
G. Hoyas-Rivera ◽  
E. Martinez-Gonzalaz ◽  
H.V. Rios-Rigueroa ◽  
V.G. Sanchez-Arias ◽  
H.G. Acosta-Mesa ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document