Extending OpenMP for the Optimization of Parallel Component Applications

Motivated by the promotion of development efficiency and performance, we research on the common performance optimization technology for parallel component applications. We define OpenMP pragmas to describe the parallel component instance calls in three types of complex structure code. By data flow a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2020, Vol.8, p.95435-95441
Main Authors: Peng, Yunfeng, Liu, Hai
Format: Article
Language:English
Subjects:
Computation
Data analysis
Data flow analysis
Multicore processing
OpenMP
Optimization
Parallel component
Parallel processing
parallel software engineering
performance optimization
Schedules
Servers
Software
Switched mode power supplies
Task analysis
Task scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Motivated by the promotion of development efficiency and performance, we research on the common performance optimization technology for parallel component applications. We define OpenMP pragmas to describe the parallel component instance calls in three types of complex structure code. By data flow analysis, we can find the parallelism potential of these codes. We extends the OpenMP pragma to support virtual computing resources and the deployment of complex structure codes on them. We provide three reference rules for the component instance tasks to be scheduled on certain resources to get better performance. To better utilize resources, we provide mapping of virtual computing resources to real resources. We extends the OpenMP programming model and execution model to accommodate the extended pragmas. The extended Babel compiler is responsible for data flow analysis. The extended CCAFFEINE framework is in charge of generating the task schedule policy. Experiments show that our performance optimization platform Bomp can get better scalability and performance than other methods existed.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.2996669