J. Ramanujam, S. Dutta, and A. Venkatachar, "Code Generation for Complex Subscripts in Data-parallel Programs," Proc. 10th Workshop on Languages and Compilers for Parallel Computing, Minneapolis, MN, Springer-Verlag, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Local Enumeration Techniques for Sparse Algorithms - Bandera, Trabado, Zapata (1998) (Correct)
....been already done for dense computation and CYCLIC(k) distribution. Most of these methods use tables to store repetitive access patterns [3, 8] Reeuwijk et al. 6] present local enumeration and storage compression schemes that use global to local routines instead of tables. In a more recent work [5] strategies to compute the local set of iterations for complex subscripts are developed. However, none of these methods are able to generate efficient local code for sparse applications as they do not consider the need of resolving indirections. The work described in this paper was supported by ....
J.Ramanujam, S.Dutta, A.Venkatachar, Code Generation for Complex Subscripts in Data-Parallel Programs, Proc. LCPC'97, Minneapolis, August 1997.
Efficient Address Generation for Affine Subscripts in.. - Shih, Sheu (1998) (Correct)
....FSM approach or virtual processor approach except some modifications. However, most of them consider the simple array subscript. That is, the array subscripts contain only one induction variable. Recently, several efforts on compiling array references with affine array subscripts are proposed [1, 10, 11, 15, 17, 22]. Affine array subscript means the array subscript is a linear combination of multiple induction variables (MIVs) In [1] the authors use a linear algebra framework to generate communication sets for affine array subscripts. Complex loop bounds and local array subscripts of the generated code ....
....within a multi nested loop. However, the proposed methods are not efficient enough for dealing with some special case. For compiling array references with affine subscripts, some researchers pay their attention on the array reference enclosed within a two nested loop to find a better result [10, 11, 17]. Based on FSM approach [3] Kennedy et al. proposed another approach to solving the compilation of array references with affine subscripts within a two nested loop [10, 11] For the memory accesses of an array reference with affine subscript within a two nested loop, there exist repetitive ....
[Article contains additional citation context not shown here]
J. Ramanujam, S. Dutta, and A. Venkatachar. Code generation for complex subscripts in dataparallel programs. In Languages and Compilers for Parallel Computing, Minneapolis, MN, August 1997.
Advanced Compilation Techniques for HPF - Ramanujam, Dutta, Venkatachar.. (1998) Self-citation (Ramanujam Dutta Venkatachar) (Correct)
....the resulting sets using the patterns. 6.3 Code generation for complex subscripts The techniques presented in this chapter assumed simple subscript functions. Array references with arbitrary affine subscripts can make the task of compilers for such languages highly involved. Work from our group [7, 21, 24, 25, 36] deals with the efficient address generation in programs with array references having two types of commonly encountered affine references, namely coupled subscripts and subscripts containing multiple induction variables (MIVs) These methods utilize the repetitive pattern of the memory accesses. ....
....performs very efficiently for a wide range of values of block size and access strides. In addition to these algorithms, we provided an overview of other work from our group on several problems such as ffl communication generation [34, 36, 37, 38] ffl code generation for complex subscripts [7, 21, 24, 25, 36]; ffl effect of data structures for table lookup at runtime [6, 7] ffl runtime array redistribution [7, 12, 23, 30] and) ffl efficient support for union and other operations on regular sections [7, 22] Work is in progress on the problem of code generation and optimization for general affine ....
J. Ramanujam, S. Dutta, and A. Venkatachar. Code generation for complex subscripts in data-parallel programs. In Languages and Compilers for Parallel Computing, Z. Li et al. (Editors), Lecture Notes in Computer Science, Vol. 1366, pages 49--63, Springer-Verlag, 1998.
Compilation Techniques for Parallel Systems - Gupta, Pande, Psarris, Sakar (1999) (2 citations) (Correct)
No context found.
J. Ramanujam, S. Dutta, and A. Venkatachar, "Code Generation for Complex Subscripts in Data-parallel Programs," Proc. 10th Workshop on Languages and Compilers for Parallel Computing, Minneapolis, MN, Springer-Verlag, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC