Bibliographic Details
| Title: |
On the parallelization of irregular and dynamic programs |
| Authors: |
Plata, Oscar oscar@ac.uma.es, Asenjo, Rafael1, Gutiérrez, Eladio1, Corbera, Francisco1, Navarro, Angeles1, Zapata, Emilio L.1 |
| Source: |
Parallel Computing. Jun2005, Vol. 31 Issue 6, p544-562. 19p. |
| Subjects: |
Computer files, Computer software, Computer programmers, Computer programming |
| Abstract: |
Abstract: Current compilers show ineffective when optimizing complex applications, both analyzing dependences and exploiting data locality and extracting parallelism. Complex applications may be characterized as irregular and dynamic. Irregular applications arrange data as multidimensional arrays and memory is referenced through array indirections. Dynamic applications organize data as pointer-based structures (lists, trees,…) and memory is referenced through pointers. In this paper we discuss a methodology we designed to develop efficient parallelization techniques for irregular and dynamic applications, that proceeds in three stages: recognizing the complex program structure, data analysis and program parallelization based on code/data transformations. Two case examples are analyzed in detail in the context of this methodology: irregular reductions and shape analysis for dynamic data structures. [Copyright &y& Elsevier] |
|
Copyright of Parallel Computing is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
