Abstract
Previous research has shown existence of a huge potential of the coarse-grain parallelism in programs. This parallelism is however not always easy to exploit, especially, when applying today's parallelizing compilers to typical applications from the “embedded” domain. This is mainly due to the deficiencies of the static data dependency analysis they relay on. This paper investigates the potentials of the loops parallelization techniques using dynamic loop analysis techniques. For a set of “embedded” benchmarks (including an MPEG-2 encoder) ~4 times more loops could be parallelized, in comparison with a state-of-the-art compiler (SUIF [S.P. Amarasinghe et al., Multiprocessors From a Software Perspective, IEEE micro, June 1996, pp. 52–61]), leading to average speed-ups of 2.85 (on a four-processor system). Dynamic analysis is however not “full-proof” — we intend to use it exclusively in cases when static analysis fails to give any answer, and only if the user asserts its applicability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
