Parallelization and Locality Optimization Based the Polyhedral Model

Peng Wei Lv; Jian Qing Xiao

doi:10.4028/www.scientific.net/AMM.713-715.2045

Paper Titles

Uncertain Internet Public Opinion Emergency Decision-Making Method under Interval-Valued Fuzzy Environment
p.2024

Using the Shapley Value to Determine the Expert’s Discourse Right in Group Decision-Making
p.2029

Virtual Combat System Evolution Model Realization
p.2037

Weapon Target Assignment Problem Solving Based on Hungarian Algorithm
p.2041

Parallelization and Locality Optimization Based the Polyhedral Model
p.2045

Application of Intelligent Optimization Algorithm in Mechanical Design
p.2049

Tracking Algorithm Design and Comparison of High Speed High Maneuvering Target
p.2053

Multi-Information Model Fused Framework for Chinese Dialect Identification
p.2058

A Prototype Selection Method for Synthetic Object Recognition Based on Structural Graph Model
p.2063

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 713-715Parallelization and Locality Optimization Based...

Parallelization and Locality Optimization Based the Polyhedral Model

Abstract:

Current trends in micro-architecture are towards larger number of processing elements on a single chip. It is challenging to tap the peak performance of those processors. In order to address this issue, the most promising solution is automatic parallelization. This approach does not require programmer too much effort in the process of parallelizing programs. Polyhedral model is a mathematical framework based on the powerful linear integer programming, which provides an abstraction concept to represent the nested loops computing and dependence of data access using integer points in the polyhedron. We propose an automatic transformation framework based on polyhedral model to optimize nested loop with affine dependences for parallelism and locality.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 713-715)

Pages:

2045-2048

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.713-715.2045

Citation:

Cite this paper

Online since:

January 2015

Authors:

Peng Wei Lv*, Jian Qing Xiao

Keywords:

Hyperplane, Optimization, Parallelism, Polyhedral

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] A. Cohen, S. Girbal, D. Parello, M. Sigler, O. Temam, and N. Vasilache. Facilitating the search for compositions of program transformations. In ICS, pages 151–160, June (2005).

DOI: 10.1145/1088149.1088169

Google Scholar

[2] P. Feautrier. Some efficient solutions to the affine scheduling problem: I. one-dimensional time. IJPP, 21(5): 313–348, (1992).

DOI: 10.1007/bf01407835

Google Scholar

[3] S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. Semiautomatic.

Google Scholar

[4] PLuTo: A polyhedral automatic parallelizer and locality optimizer for multicores. http: /pluto-compiler. sourceforge. net.

Google Scholar

[5] The LooPo Project - Loop parallelization in the polytope model. http: /www. fmi. uni-passau. de/loopo.

Google Scholar

[6] PIP: The Parametric Integer Programming Library. http: /www. piplib. org.

Google Scholar

[7] CLooG: The Chunky Loop Generator. http: /www. cloog. org.

Google Scholar

[8] N. V asilache, C. Bastoul, and A. Cohen. Polyhedral code generation in the real world. In International Conferenceon Compiler Construction (ET APS CC'06), pages 185–201, Mar. (2006).

DOI: 10.1007/11688839_16

Google Scholar