OpenMP and compilation issue in embedded applications

  • Authors:

  • Jaegeun Oh;Seon Wook Kim;Chulwoo Kim

  • Affiliations:

  • Advanced Computer Systems Laboratory, Department of Electronics and Computer Engineering, Korea University, Seoul, Korea;Advanced Computer Systems Laboratory, Department of Electronics and Computer Engineering, Korea University, Seoul, Korea;Integrated System and Processor Laboratory, Department of Electronics and Computer Engineering, Korea University, Seoul, Korea

  • Venue:
  • WOMPAT'03 Proceedings of the OpenMP applications and tools 2003 international conference on OpenMP shared memory parallel programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Currently embedded systems become more and more important and widely applied to everywhere around us, such as a mobile phone, a PDA, an HDTV, and so on. In this paper, we applied OpenMP to non-traditional benchmarks, i.e. embedded applications in order to examine the applicability of OpenMP in this area. We parallelized embedded benchmarks, called EEMBC, consisting of 5 categories and total 34 applications, and measure their performance in detail. From experiment, we could find 90 parallel sections in 17 applications, but we achieved speedup only in four applications. Since embedded applications consists of a chunk of small loops, we could not get speedup due to large parallelization overheads such as thread management and instruction overheads. Also we show that the OpenMP-inserted parallel code size is much larger than a serial version due to multithreaded libraries, which is critical to embedded systems because of their limited size of memory systems. We discuss an identified critical, but a trivial problem in the current OpenMP specification when we applied OpenMP to these applications.