CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Pure functions in C: A small keyword for automatic parallelization
Authors
A Brinkmann (8948027)
D Feld (8948030)
+4 more
Lars Nagel (4482649)
MA Vef (8948024)
T Soddemann (8948033)
T Süß (8948021)
Publication date
30 May 2020
Publisher
Abstract
© 2020, The Author(s). The need for parallel task execution has been steadily growing in recent years since manufacturers mainly improve processor performance by increasing the number of installed cores instead of scaling the processor’s frequency. To make use of this potential, an essential technique to increase the parallelism of a program is to parallelize loops. Several automatic loop nest parallelizers have been developed in the past such as PluTo. The main restriction of these tools is that the loops must be statically analyzable which, among other things, disallows function calls within the loops. In this article, we present a seemingly simple extension to the C programming language which marks functions without side-effects. These functions can then basically be ignored when the automatic parallelizer checks the parallelizability of loops. We integrated the approach into the GCC compiler toolchain and evaluated it by running several real-world applications. Our experiments show that the C extension helps to identify additional parallelization opportunities and, thus, to significantly increase the performance of applications
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Loughborough University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:figshare.com:article/12449...
Last time updated on 12/06/2020