File(s) not publicly available
A Study of Irreducibility in C Programs
journal contribution
posted on 2023-06-08, 07:12 authored by James Stanier, Des WatsonCompilers use a variety of techniques to optimize and Transform loops. However, many of these optimizations do not work when the loop is irreducible. Node splitting techniques transform irreducible loops into reducible loops, but many real-world compilers choose to leave them unoptimized. This article describes an empirical study of irreducibility in current versions of open-source software, and then compares them with older versions. We also study machine-generated C code from a number of software tools. We ?nd that irreducibility is extremely rare, and is becoming less common with time. We conclude that leaving irreducible loops unoptimized is a perfectly feasible future-proof option due to the rarity of its occurrence in non-trivial software. Copyright q 2011 John Wiley & Sons, Ltd.
History
Publication status
- Published
Journal
Software: Practice and ExperienceISSN
1097-024XExternal DOI
Issue
1Volume
42Page range
117-130Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC