A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On the importance of points-to analysis and other memory disambiguation methods for C programs
2001
SIGPLAN notices
Preserved Fulltext
In this paper, we evaluate the benefits achievable from pointer analysis and other memory disambiguation techniques for C/C++ programs, using the framework of the production compiler for the Intel® Itanium ...
Most of the prior work on memory disambiguation has primarily focused on pointer analysis, and either presents only static estimates of the accuracy of the analysis (such as average points-to set size) ...
We have instrumented the disambiguator to collect data on the characteristics of the memory references and points-to sets, the number of queries, and the reason for each disambiguation result. ...
doi:10.1145/381694.378806
fatcat:uhdcholpsbcoth4hacef6g66rm
On the importance of points-to analysis and other memory disambiguation methods for C programs
2001
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation - PLDI '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we evaluate the benefits achievable from pointer analysis and other memory disambiguation techniques for C/C++ programs, using the framework of the production compiler for the Intel® Itanium ...
Most of the prior work on memory disambiguation has primarily focused on pointer analysis, and either presents only static estimates of the accuracy of the analysis (such as average points-to set size) ...
We have instrumented the disambiguator to collect data on the characteristics of the memory references and points-to sets, the number of queries, and the reason for each disambiguation result. ...
doi:10.1145/378795.378806
dblp:conf/pldi/GhiyaLS01
fatcat:qvghxxfacbftvkdl7qttdkoekq
Restrictification of function arguments
2016
Proceedings of the 25th International Conference on Compiler Construction - CC 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Because the automatic disambiguation of pointers is a difficult endeavor, several programming languages offer programmers mechanisms to distinguish memory references, such as the "restrict" keyword in ...
We generate a clone for each function whose arguments we can disambiguate and optimize it assuming the absence of aliasing among formal parameters. ...
We thank Michael Frank, from LG, for all the insights he has provided during this research. Fernando Pereira is supported by FAPEMIG and CNPq. ...
doi:10.1145/2892208.2892225
dblp:conf/cc/CamposASP16
fatcat:ynhcobh2jrhsflv7k3eodgsdoa
Pointer disambiguation via strict inequalities
2017
2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
One of the challenges that arise in this context is the analysis of languages that support pointer arithmetics, such as C, C++ and assembly dialects. This paper contributes to solve this challenge. ...
It runs in time linear on the number of program variables, and, depending on the benchmark, it can be as much as six times more precise than the pointer disambiguation techniques already in place in that ...
Overview To motivate the need for a new points-to analysis we show its application on the programs seen in Figure 1 . ...
doi:10.1109/cgo.2017.7863735
fatcat:t5tjdttlkrfkhfxocb3wejr43e
Combining range and inequality information for pointer disambiguation
2018
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show how we have used the ideas available in Pentagons to design and implement a novel alias analysis. ...
Furthermore, we have been able to improve the percentage of pairs of pointers disambiguated, when compared to LLVM's built-in analyses, by a four-fold factor in some benchmarks. ...
Acknowledgments This project is supported by CNPq, Intel (The eCoSoC grant), FAPEMIG (The Prospiel project), and by the French National Research Agency -ANR (LABEX MILYON of Université de Lyon, within ...
doi:10.1016/j.scico.2017.10.014
fatcat:56ozhqezazfgtihvr6m5koa4mm
Instruction based memory distance analysis and its application to optimization
2005
14th International Conference on Parallel Architectures and Compilation Techniques (PACT'05)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this we examine the notion of memory distance as it is applied to the instruction space of a program and to directed optimization. ...
Feedback-directed optimization offers the compiler opportunities to analyze and optimize the memory behavior of programs even when traditional array-based analysis not applicable. ...
We present a new method for instruction-based memory distance analysis that handles some of the complexities exhibited in integer programs and use that analysis to predict both long and short memory distances ...
doi:10.1109/pact.2005.26
dblp:conf/IEEEpact/FangCOW05
fatcat:bzr3pgizbbdq3iyxqz56qqv7fu
Automatic Discovery of Coarse-Grained Parallelism in Media Applications
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
necessary to achieve a clear view of the relations among memory accesses in complex programs. ...
Automatic discovery is challenging due to shifts in the prevalent programming languages, scalability problems of analysis techniques, and the lack of experimental research in combining the numerous analyses ...
Acknowledgments We would like to thank Hillery Hunter at IBM and John Sias for their advice and feedback, and the reviewers for their comments. ...
doi:10.1007/978-3-540-71528-3_13
fatcat:2ay7wjbuzrh23efatihldkbrnm
Feedback-directed memory disambiguation through store distance analysis
2006
Proceedings of the 20th annual international conference on Supercomputing - ICS '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
both floating point and integer programs. ...
Our experiments show that the proposed store distance method performs much better than the previous distance based memory disambiguation scheme, and yields a performance very close to perfect memory disambiguation ...
for both floating point and integer programs. ...
doi:10.1145/1183401.1183440
dblp:conf/ics/FangCOW06
fatcat:gi54tjmniff4hhsnz7hziwqiou
Runtime pointer disambiguation
2015
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Our experiments indicate that our method is precise, effective and useful: we can disambiguate every pair of pointer in the loop intensive PolyBench benchmark suite. ...
However, the state-of-the-art heuristics available in the literature to track memory dependencies are inherently imprecise and computationally expensive. ...
Acknowledgements We thank the OOPSLA referees for many constructive comments and suggestions. The Brazilian side of this cooperation has been sponsored by CNPq, FAPEMIG, CAPES and LG Electronics. ...
doi:10.1145/2814270.2814285
dblp:conf/oopsla/AlvesGDLGRP15
fatcat:uaqqeartwjhirmyvwy2sg7rbuq
Symbolic range analysis of pointers
2016
Proceedings of the 2016 International Symposium on Code Generation and Optimization - CGO 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Tests on a vast suite of benchmarks show that we can disambiguate several kinds of C idioms that current state-of-the-art analyses cannot deal with. ...
Alias analysis is one of the most fundamental techniques that compilers use to optimize languages with pointers. ...
The topics and concepts it covers are the SSA form, the LLVM compiler framework, points-to analysis, range analysis, the use of pointer disambiguation for automatic parallelization of code and the merging ...
doi:10.1145/2854038.2854050
dblp:conf/cgo/PaisanteMBGP16
fatcat:cfkl672favbezprjwyoxtjocxy
Runtime pointer disambiguation
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Our experiments indicate that our method is precise, effective and useful: we can disambiguate every pair of pointer in the loop intensive PolyBench benchmark suite. ...
However, the state-of-the-art heuristics available in the literature to track memory dependencies are inherently imprecise and computationally expensive. ...
Acknowledgements We thank the OOPSLA referees for many constructive comments and suggestions. The Brazilian side of this cooperation has been sponsored by CNPq, FAPEMIG, CAPES and LG Electronics. ...
doi:10.1145/2858965.2814285
fatcat:2xsekwcm4rbcdlnta62w4bxl4i
Type-based alias analysis
1998
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show modest dynamic improvements for (RLE), and more surprisingly, that on average our alias analysis is within 2.5% of a perfect alias analysis with respect to RLE on 8 Modula-3 programs. ...
Although other researchers suggests using types to disambiguate memory references, none evaluates its effectiveness. ...
Method resolution uses TBAA (and other analyses) to help resolve method invocations on object fields and array elements. ...
doi:10.1145/277652.277670
fatcat:dlbtnkijt5crxmnuuadorxe7ye
Type-based alias analysis
1998
Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation - PLDI '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show modest dynamic improvements for (RLE), and more surprisingly, that on average our alias analysis is within 2.5% of a perfect alias analysis with respect to RLE on 8 Modula-3 programs. ...
Although other researchers suggests using types to disambiguate memory references, none evaluates its effectiveness. ...
Method resolution uses TBAA (and other analyses) to help resolve method invocations on object fields and array elements. ...
doi:10.1145/277650.277670
dblp:conf/pldi/DiwanMM98
fatcat:lxtr2fd2p5cqbd7wmwcuc7oiwi
Dynamic memory interval test vs. interprocedural pointer analysis in multimedia applications
2005
ACM Transactions on Architecture and Code Optimization (TACO)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This paper provides a detailed evaluation of the approach, compares it against an advanced interprocedural pointer analysis framework, and analyzes the possibility of using both techniques at the same ...
The Dynamic Memory Interval Test is a runtime memory disambiguation technique that takes advantage of the specific behavior of multimedia memory access patterns. ...
We also wish to thank the Supercomputing Center of Catalonia (CESCA) for supplying the computing resources for our research. ...
doi:10.1145/1071604.1071608
fatcat:kmoq7sexlfae5p74j6j6c7mfsm
Maps
1999
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Traditional processors for sequential programs maintain the abstraction of a unified memory by using a single centralized memory system. ...
A Raw architecture addresses this problem by taking advantage of the rapidly increasing transistor budget to move much of its memory on chip. ...
The lack of point-to-point VLIWs seems to explain the dearth of work on memory bank disambiguation for VLIW compilation. ...
doi:10.1145/307338.300980
fatcat:uxh76ia7wranhhhvzr65mal6my
« Previous
Showing results 1 — 15 out of 8,818 results