Filters








8,356 Hits in 6.6 sec

Estimating the Impact of Scalable Pointer Analysis on Optimization [chapter]

Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof
2001 Lecture Notes in Computer Science  
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimizations?  ...  We then examine whether scalable pointer analyses are inaccurate on the remaining 5% alias queries because they are context-insensitive.  ...  Acknowledgements We would like to thank Tom Reps and Rakesh Ghiya for helpful discussions, and Jim Larus and the anonymous referees for suggestions on the paper.  ... 
doi:10.1007/3-540-47764-0_15 fatcat:zfoofsjv25gttkx2zstj6p2ncu

DISK: A Distributed Framework for Single-Source SimRank with Accuracy Guarantee

Yue Wang, Ruiqi Xu, Zonghao Feng, Yulin Che, Lei Chen, Qiong Luo, Rui Mao
2020 Proceedings of the VLDB Endowment  
Measuring similarities among different nodes is important in graph analysis. SimRank is one of the most popular similarity measures.  ...  In the offline phase, a tree-based method is used to estimate the diagonal correction matrix of SimRank accurately, and in the online phase, single-source similarities are computed iteratively.  ...  Efficiency Next, we test the impact of 1) ϵ d and ϵ, 2) the number of processor cores p, 3) different optimization techniques and 4) the size of graph |G |, on the efficiency of DISK, for both offline  ... 
doi:10.5555/3430915.3442434 dblp:journals/pvldb/0012XFC00M20 fatcat:m6fuzp64g5hgrf5n5r2v6pmewm

Optimizing C Multithreaded Memory Management Using Thread-Local Storage [chapter]

Yair Sade, Mooly Sagiv, Ran Shaham
2005 Lecture Notes in Computer Science  
Technically, we reduce the problem of estimating thread-local storage to the problem of escape analysis and provide an efficient escape analysis for C.  ...  The usage of scalable points-to analysis algorithms and the fact that our reduction is efficient, guarantees that our static analysis technique is scalable.  ...  We could see the impact of the synchronization contentions by examining the memory allocation benchmarks suite.  ... 
doi:10.1007/978-3-540-31985-6_10 fatcat:xsgm7tr5xzelbajtissjcdribi

Hardware–compiler co-design for adjustable data power savings

Hillery C. Hunter, Erik M. Nystrom, Daniel A. Connors, Wen-mei W. Hwu
2009 Microprocessors and microsystems  
Building upon the compiler techniques presented in [1], we evaluate the severity of the current on-chip storage power problem and detail how SRAM structures can be built to enable data power savings for  ...  We show how the implemented compiler techniques can be applied to other problems in the embedded/media processing domain, and present net data power savings results for a suite of media and telecommunication  ...  Acknowledgments The authors would like to thank Shane Ryoo for his contributions to the memory profiler used in this work.  ... 
doi:10.1016/j.micpro.2009.02.003 fatcat:566u73invvbrflkbooart45gqe

ScaleUPC

Weiming Zhao, Zhenlin Wang
2009 Proceedings of the Third Conference on Partitioned Global Address Space Programing Models - PGAS '09  
As the communication cost for remote accesses is removed because all accesses are physically local in a multi-core, we find that the overhead of pointer arithmetic on shared data accesses becomes a prominent  ...  The reason is that directly mapping the UPC logical memory layout to physical memory, as used in most of the existing UPC compilers, incurs prohibitive address calculation overhead.  ...  Acknowledgements We would like to thank the anonymous reviewers for their useful comments on this paper. This work is supported by NSF Career CCF-0643664, NSF CCF-0811427, and NSF CCF-0833082.  ... 
doi:10.1145/1809961.1809976 fatcat:g5q23kqffredjeb7rexpuicix4

A probabilistic pointer analysis for speculative optimizations

Jeff Da Silva, J. Gregory Steffan
2006 Proceedings of the 12th international conference on Architectural support for programming languages and operating systems - ASPLOS-XII  
Many compiler optimizations rely on accurate pointer analysis, and to ensure correctness cannot optimize in the maybe case.  ...  Pointer analysis is a critical compiler analysis used to disambiguate the indirect memory references that result from the use of pointers and pointer-based data structures.  ...  The next chapter will introduce an innovative and scalable probabilistic pointer analysis algorithm that targets speculative optimization.  ... 
doi:10.1145/1168857.1168908 dblp:conf/asplos/SilvaS06 fatcat:cohhfsmjfna5jhjmub524jypve

A probabilistic pointer analysis for speculative optimizations

Jeff Da Silva, J. Gregory Steffan
2006 SIGARCH Computer Architecture News  
Many compiler optimizations rely on accurate pointer analysis, and to ensure correctness cannot optimize in the maybe case.  ...  Pointer analysis is a critical compiler analysis used to disambiguate the indirect memory references that result from the use of pointers and pointer-based data structures.  ...  The next chapter will introduce an innovative and scalable probabilistic pointer analysis algorithm that targets speculative optimization.  ... 
doi:10.1145/1168919.1168908 fatcat:iw46qhcuujf4pnfr27kywksgne

A probabilistic pointer analysis for speculative optimizations

Jeff Da Silva, J. Gregory Steffan
2006 SIGPLAN notices  
Many compiler optimizations rely on accurate pointer analysis, and to ensure correctness cannot optimize in the maybe case.  ...  Pointer analysis is a critical compiler analysis used to disambiguate the indirect memory references that result from the use of pointers and pointer-based data structures.  ...  The next chapter will introduce an innovative and scalable probabilistic pointer analysis algorithm that targets speculative optimization.  ... 
doi:10.1145/1168918.1168908 fatcat:6uf3s6adtvdjxc6od3f6zwdggy

A probabilistic pointer analysis for speculative optimizations

Jeff Da Silva, J. Gregory Steffan
2006 ACM SIGOPS Operating Systems Review  
Many compiler optimizations rely on accurate pointer analysis, and to ensure correctness cannot optimize in the maybe case.  ...  Pointer analysis is a critical compiler analysis used to disambiguate the indirect memory references that result from the use of pointers and pointer-based data structures.  ...  The next chapter will introduce an innovative and scalable probabilistic pointer analysis algorithm that targets speculative optimization.  ... 
doi:10.1145/1168917.1168908 fatcat:jvi37qdrvfbpvpa6jipbg5s2k4

Programmer specified pointer independence

David Koes, Mihai Budiu, Girish Venkataramani
2004 Proceedings of the 2004 workshop on Memory system performance - MSP '04  
Good alias analysis is essential in order to achieve high performance on modern processors, yet interprocedural analysis does not scale well.  ...  We present a source code annotation, #pragma independent, which is a more flexible, intuitive and useful way for the programmer to provide pointer aliasing information than the current C99 restrict keyword  ...  Acknowledgments Dan Vogel wrote the scripts which back-annotate the source files with pragma starting from the collected instrumentation.  ... 
doi:10.1145/1065895.1065905 dblp:conf/ACMmsp/KoesBV04 fatcat:bb6b7q36sfb75f3pbhieolwwje

Reducing false sharing on shared memory multiprocessors through compile time data transformations

Tor E. Jeremiassen, Susan J. Eggers
1995 SIGPLAN notices  
The reduction in false sharing positively impacts both execution time and program scalability when executed on a KSR2.  ...  We have developed compiler algorithms that analyze explicitly parallel programs and restructure their shared data to reduce the number of false sharing misses.  ...  Singh and Josep Torrellas for providing us with many of the programs in our workload, Craig Chambers, Kathryn McKinley, Anne Rogers, Jean-Loup Baer and Dean Tullsen for helpful comments on an earlier draft  ... 
doi:10.1145/209937.209955 fatcat:uf2xx3wdl5ejlh7oqdtgava7la

Reducing false sharing on shared memory multiprocessors through compile time data transformations

Tor E. Jeremiassen, Susan J. Eggers
1995 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '95  
The reduction in false sharing positively impacts both execution time and program scalability when executed on a KSR2.  ...  We have developed compiler algorithms that analyze explicitly parallel programs and restructure their shared data to reduce the number of false sharing misses.  ...  Singh and Josep Torrellas for providing us with many of the programs in our workload, Craig Chambers, Kathryn McKinley, Anne Rogers, Jean-Loup Baer and Dean Tullsen for helpful comments on an earlier draft  ... 
doi:10.1145/209936.209955 dblp:conf/ppopp/JeremiassenE95 fatcat:yhe746shrnfonmr5yrxiud5sgu

An Empirical Study of Function Pointers Using SPEC Benchmarks [chapter]

Ben-Chung Cheng, Wen-mei W. Hwu
2000 Lecture Notes in Computer Science  
From the experience of implementing a call graph extractor in the IMPACT compiler, we found the call graph construction problem has evolved into an interprocedural pointer analysis problem.  ...  Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms designed for Fortran can  ...  And whether the optimal number of iterations can be achieved depends on if the BoundTo analysis is performed in the top-down traversal and the BoundToR analysis is performed in the bottom-up traversal  ... 
doi:10.1007/3-540-44905-1_38 fatcat:wqyrg5kpajadhm5festicvrmt4

An effective pointer replication algorithm in P2P networks

Jian Zhou, Laxmi N. Bhuyan, Anirban Banerjee
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
In this paper, we propose an On-line Pointer 1 Replication (OPR) algorithm in structured P2P networks which yields a significantly low worst case query latency.  ...  Also, the degree of replication achieved by OPR is dynamically adaptable to the instantaneous query arrival rate and churn characteristics of the system in order to reduce total control traffic.  ...  The large amount of control traffic generated to propagate topology changes may impact the scalability of the systems.  ... 
doi:10.1109/ipdps.2008.4536227 dblp:conf/ipps/ZhouBB08 fatcat:r23mf4ds7rd7do4xrhgexy3h6m

Marple

Wei Le, Mary Lou Soffa
2013 ACM Transactions on Software Engineering and Methodology  
An important contribution of the work is the design of a demand-driven analysis that effectively addresses scalability challenges faced by traditional path-sensitive fault detection.  ...  By applying demand-driven analysis for scalability, Marple is also the first framework that achieves interprocedural, path-sensitive precision without compromising coverage and generality of the fault  ...  The benchmarks are chosen either 1) because they contain known faults of one of the four types for estimating false negatives of our analysis (these faults are either reported by users or discovered by  ... 
doi:10.1145/2491509.2491512 fatcat:54oidq5o2nci7ep4rfyvukt2jq
« Previous Showing results 1 — 15 out of 8,356 results