TY - GEN
T1 - Benchmarking OpenMP programs for real-time scheduling
AU - Wang, Yang
AU - Guan, Nan
AU - Sun, Jinghao
AU - Lv, Mingsong
AU - He, Qingqiang
AU - He, Tianzhang
AU - Yi, Wang
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/9/19
Y1 - 2017/9/19
N2 - Real-time systems are shifting from single-core to multi-core processors. Software must be parallelized to fully utilize the computation power of multi-core architecture. OpenMP is a popular parallel programming framework in general and high-performance computing, and recently has drawn a lot of interests in embedded and real-time computing. Much recent work has been done on real-time scheduling of OpenMP-based parallel workload. However, these studies conduct evaluations with randomly generated task systems, which cannot well represent the structure features of OpenMP workload. This paper presents a benchmark suite, ompTGB, to support research on real-time scheduling of OpenMP-based parallel tasks. ompTGB does not only collect realistic OpenMP programs, but also models them into task graphs so that the real-time scheduling researchers can easily understand and use them. We also present a new response time bound for a subset of OpenMP programs and use it to demonstrate the usage of ompTGB.
AB - Real-time systems are shifting from single-core to multi-core processors. Software must be parallelized to fully utilize the computation power of multi-core architecture. OpenMP is a popular parallel programming framework in general and high-performance computing, and recently has drawn a lot of interests in embedded and real-time computing. Much recent work has been done on real-time scheduling of OpenMP-based parallel workload. However, these studies conduct evaluations with randomly generated task systems, which cannot well represent the structure features of OpenMP workload. This paper presents a benchmark suite, ompTGB, to support research on real-time scheduling of OpenMP-based parallel tasks. ompTGB does not only collect realistic OpenMP programs, but also models them into task graphs so that the real-time scheduling researchers can easily understand and use them. We also present a new response time bound for a subset of OpenMP programs and use it to demonstrate the usage of ompTGB.
UR - https://www.scopus.com/pages/publications/85032724350
U2 - 10.1109/RTCSA.2017.8046322
DO - 10.1109/RTCSA.2017.8046322
M3 - 会议稿件
AN - SCOPUS:85032724350
T3 - RTCSA 2017 - 23rd IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
BT - RTCSA 2017 - 23rd IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 23rd IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2017
Y2 - 16 August 2017 through 18 August 2017
ER -