Loop parallelization algorithms: From parallelism extraction to code generation
✍ Scribed by Pierre Boulet; Alain Darte; Georges-André Silber; Frédéric Vivien
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 351 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations they use, the loop transformations they generate, the code generation schemes they require, and their ability to incorporate various optimizing criteria such as maximal parallelism detection, permutable loop detection, minimization of synchronizations, easiness of code generation, etc. We complete the discussion by presenting new results related to code generation and loop fusion for a particular class of multidimensional schedules called shifted linear schedules. We demonstrate that algorithms based on such schedules lead to simple codes.
📜 SIMILAR VOLUMES
System developers have found that exploiting parallel architectures for control systems is challenging and often the resulting implementations do not provide the expected performance advantages over traditional uniprocessor solutions. This paper presents a generic method and a suite of design tools
Road traffic movement is a very important source of information in traffic management. Although systems exist which can detect the presence of a vehicle and its speed under certain conditions, there is generally a lack of effective means to measure both the speed and direction of tratlic movement. T