Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Array access analysis"'
Publikováno v:
ACM Transactions on Graphics. 35:1-13
This paper introduces a novel domain-specific compiler, which translates visual computing programs written in dynamic languages to highly efficient code. We define "dynamic" languages as those such as Python and MATLAB, which feature dynamic typing a
Autor:
Wei Qing Bai
Publikováno v:
Applied Mechanics and Materials. :3044-3050
In C language, it is difficult to use the pointer to access the two-dimensional array element. The reason is the addresses of two-dimensional array are many, pointers that can access the two-dimensional array element are many and complex. This paper
Publikováno v:
2016 18th International Conference on Advanced Communication Technology (ICACT).
Recently, research community has advanced in type reconstruction technology for reverse engineering. However, emerging with obfuscated technology, data type reconstruction grows more and more difficult, and obfuscated code is easier to be monitored a
Publikováno v:
ACM Transactions on Programming Languages and Systems. 27:662-731
As shared-memory multiprocessor systems become widely available, there is an increasing need for tools to simplify the task of developing parallel programs. This paper describes one such tool, the automatic parallelization system in the Stanford SUIF
Autor:
Ken Kennedy, Yuan Zhao
Publikováno v:
The Journal of Supercomputing. 31:5-46
Array syntax, which is supported in many technical programming languages, adds expressive power by allowing operations on and assignments to whole arrays and array sections. To compile an array assignment statement to a uniprocessor, the language pro
Publikováno v:
ACM Transactions on Programming Languages and Systems. 24:65-109
A number of existing compiler techniques hinge on the analysis of array accesses in a program. The most important task in array access analysis is to collect the information about array accesses of interest and summarize it in some standard form. Tra
Autor:
Rahul Garg, Laurie Hendren
Publikováno v:
ARRAY@PLDI
In dynamic array-based languages, the most computationally intensive parts of the program often involve either explicit loops or vector operations. These loops and vector operations can be better optimized if the compiler has accurate information abo
Autor:
Yuan Lin, David Padua
Publikováno v:
Concurrency: Practice and Experience. 12:125-135
The property analysis of subscript arrays can be used to facilitate the automatic detection of parallelism in sparse/irregular programs that use indirectly accessed arrays. In order for property analysis to work, array reaching definition information
Publikováno v:
Journal of Parallel and Distributed Computing. 54:1-47
An increasing number of programming languages, such as Fortran 90 and APL, are providing a rich set of intrinsic array functions and array expressions. These constructs which constitute an important part of data parallel languages provide excellent o
Publikováno v:
International Journal of Networked and Distributed Computing (IJNDC), Vol 2, Iss 1 (2014)
Code generation belongs to the backend of parallelizing compiler, and is for generating efficient computation and communication code for the target parallel computing system. Traditional research resolve array redistribution mainly by generating comm