155 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.We built an in-lining based prototype of the memory data-flow analysis system on top of the IMPACT compiler infrastructure. We applied the prototype to analyze the memory data-flow of several MediaBench programs. The experiment results showed that while the prototype performed reasonably well for the tested programs, the in-lining based implementation may not efficient for larger programs. Also, there is still room in improving the effectiveness of the memory data-flow analysis system. We did root cause analysis for the inaccuracy in the memory data-flow analysis results, which provided us insights on how to improve the memory data-flow analysis system in the future.U of...
The goal of this research is to retarget multimedia programs written in sequential languages (e.g., ...
Dataflow analyses are a critical part of many optimizing compilers as well as bug-finding and progra...
This paper presents a framework for characterizing the distribution of fine-grained parallelism, dat...
155 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.We built an in-lining based p...
To efficiently utilize the emerging heterogeneous multi-core architecture, it is essential to exploi...
The memory hierarchy continues to have a substantial effect on application performance. This paper e...
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-p...
While the chip multiprocessor (CMP) has quickly become the predominant processor architecture, its c...
In recent years research in the area of parallel architectures and parallel languages has become mor...
Traditional parallelism detection in compilers is performed by means of static analysis and more spe...
A method for assessing the benefits of fine-grain paral-lelism in "real " programs is pres...
The increasing attention toward distributed shared memory systems attests to the fact that programme...
Many software engineering tools such as program slicers must perform data-flow analysis in order to ...
140 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.This thesis outlines a way of...
We present a comprehensive approach to performing data flow analysis in parallel. We identify three ...
The goal of this research is to retarget multimedia programs written in sequential languages (e.g., ...
Dataflow analyses are a critical part of many optimizing compilers as well as bug-finding and progra...
This paper presents a framework for characterizing the distribution of fine-grained parallelism, dat...
155 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.We built an in-lining based p...
To efficiently utilize the emerging heterogeneous multi-core architecture, it is essential to exploi...
The memory hierarchy continues to have a substantial effect on application performance. This paper e...
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-p...
While the chip multiprocessor (CMP) has quickly become the predominant processor architecture, its c...
In recent years research in the area of parallel architectures and parallel languages has become mor...
Traditional parallelism detection in compilers is performed by means of static analysis and more spe...
A method for assessing the benefits of fine-grain paral-lelism in "real " programs is pres...
The increasing attention toward distributed shared memory systems attests to the fact that programme...
Many software engineering tools such as program slicers must perform data-flow analysis in order to ...
140 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.This thesis outlines a way of...
We present a comprehensive approach to performing data flow analysis in parallel. We identify three ...
The goal of this research is to retarget multimedia programs written in sequential languages (e.g., ...
Dataflow analyses are a critical part of many optimizing compilers as well as bug-finding and progra...
This paper presents a framework for characterizing the distribution of fine-grained parallelism, dat...