Filters








118,247 Hits in 4.6 sec

Effects of pointers on data dependences

A. Orso, S. Sinha, M.J. Harrold
Proceedings 9th International Workshop on Program Comprehension. IWPC 2001  
This technique facilitates the use of slicing for program understanding because a user can either augment a slice incrementally, by incorporating data dependences based on their relevance, or focus on  ...  This paper presents a technique for computing and classifying data dependences that takes into account the complexities introduced by specific language constructs, such as pointers, arrays, and structures  ...  work was supported in part by a grant from Boeing Commercial Airplanes to Georgia Tech, by National Science Foundation awards CCR-9707792, CCR-9988294, and CCR-0096321 to Georgia Tech, and by the State of  ... 
doi:10.1109/wpc.2001.921712 dblp:conf/iwpc/OrsoSH01 fatcat:2oen5pn3l5c3xik345szkmq3qm

Improving program slicing with dynamic points-to data

Markus Mock, Darren C. Atkinson, Craig Chambers, Susan J. Eggers
2002 Proceedings of the tenth ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '02/FSE 10  
We identified Amdahl's law as the reason for this behavior: C programs appear to have a large fraction of direct data dependences so that reducing spurious dependences via pointers is only of limited benefit  ...  smaller call graph, which leads to fewer data dependences.  ...  The effects of ignoring control dependences on slice size are shown in Figure 2 .  ... 
doi:10.1145/587059.587062 fatcat:mlfri5ztaza3jnetehvla6dv6u

Improving program slicing with dynamic points-to data

Markus Mock, Darren C. Atkinson, Craig Chambers, Susan J. Eggers
2002 Software engineering notes  
We identified Amdahl's law as the reason for this behavior: C programs appear to have a large fraction of direct data dependences so that reducing spurious dependences via pointers is only of limited benefit  ...  smaller call graph, which leads to fewer data dependences.  ...  The effects of ignoring control dependences on slice size are shown in Figure 2 .  ... 
doi:10.1145/605466.605477 fatcat:bqieussvyvcgvlsamn7ke2cjmm

Improving program slicing with dynamic points-to data

Markus Mock, Darren C. Atkinson, Craig Chambers, Susan J. Eggers
2002 Proceedings of the tenth ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '02/FSE 10  
We identified Amdahl's law as the reason for this behavior: C programs appear to have a large fraction of direct data dependences so that reducing spurious dependences via pointers is only of limited benefit  ...  smaller call graph, which leads to fewer data dependences.  ...  The effects of ignoring control dependences on slice size are shown in Figure 2 .  ... 
doi:10.1145/587051.587062 dblp:conf/sigsoft/MockACE02 fatcat:wo4o64ia2fdmjpfukh7a6eptbe

An empirical examination of the prevalence of inhibitors to the parallelizability of open source software systems

Saleh M. Alnaeli, Jonathan I. Maletic, Michael L. Collard
2015 Empirical Software Engineering  
This fact is somewhat contradictory to the literature, which is primarily focused on the removal of data dependencies within loops.  ...  Results of this paper also show that function calls via function pointers and virtual methods have very little impact on the for-loop parallelization process.  ...  Much of the literature on removal and detection of inhibitors is focused on data dependency.  ... 
doi:10.1007/s10664-015-9385-5 fatcat:eqvpjsvnabeyhbyninijnbnk5i

Effective jump-pointer prefetching for linked data structures

Amir Roth, Gurindar S. Sohi
1999 SIGARCH Computer Architecture News  
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency.  ...  On a suite of pointer intensive programs, jumppointer prefetching reduces memory stall time by 72% for software, 83% for cooperative and 55% for hardware, producing speedups of 15%, 20% and 22% respectively  ...  Acknowledgements The authors thank Milo Martin, Marci McCoy, and Craig Zilles for their comments on several drafts of this paper, and the anonymous referees for their suggestions.  ... 
doi:10.1145/307338.300989 fatcat:tt5txwocevehhdlxd67jkbp3i4

Exploiting producer patterns and L2 cache for timely dependence-based prefetching

Chungsoo Lim, Gregory T. Byrd
2008 2008 IEEE International Conference on Computer Design  
This paper proposes an architecture that efficiently prefetches for loads whose effective addresses are directly dependent on previously-loaded values.  ...  This dependence-based prefetching scheme covers most frequently missed loads in programs that contain linked data structures (LDS).  ...  TIMELY DEPENDENCE-BASED PREFETCHING A. Motivations Data dependence involving long memory latency is one of the biggest performance limiting issues in processor design.  ... 
doi:10.1109/iccd.2008.4751935 dblp:conf/iccd/LimB08 fatcat:umzst54birc5jjg57qeyy6zr44

Dependence based prefetching for linked data structures

Amir Roth, Andreas Moshovos, Gurindar S. Sohi
1998 Proceedings of the eighth international conference on Architectural support for programming languages and operating systems - ASPLOS-VIII  
Dependence-based prefetching achieves speedups of up to 2.5% on a suite of pointer-intensive programs.  ...  We introduce a dynamic scheme that captures the accesspatterns of linked data structures and can be used to predict future accesses with high accuracy.  ...  Acknowledgments The authors would like to thank Jim Smith, Mark Hill, Doug Burger, and Milo Martin for their comments on early versions of this paper, and the anonymous referees for their careful reviews  ... 
doi:10.1145/291069.291034 dblp:conf/asplos/RothMS98 fatcat:jul62swkkjbr5f24jf5qjciwoa

Dependence based prefetching for linked data structures

Amir Roth, Andreas Moshovos, Gurindar S. Sohi
1998 SIGPLAN notices  
Dependence-based prefetching achieves speedups of up to 2.5% on a suite of pointer-intensive programs.  ...  We introduce a dynamic scheme that captures the accesspatterns of linked data structures and can be used to predict future accesses with high accuracy.  ...  Acknowledgments The authors would like to thank Jim Smith, Mark Hill, Doug Burger, and Milo Martin for their comments on early versions of this paper, and the anonymous referees for their careful reviews  ... 
doi:10.1145/291006.291034 fatcat:fblqhoxlrvafpjqgjz6gcq3csi

The effects of the precision of pointer analysis [chapter]

Marc Shapiro, Susan Horwitz
1997 Lecture Notes in Computer Science  
However, the magnitude of the payoff in precision depends on the particular use of the points-to information.  ...  -How good are the "direct" effects of pointer analysis (the sizes of the computed points-to sets) at predicting the transitive effects? -What are the time trade-offs?  ...  Acknowledgements We would like to thank Bob Wardrop and Jonathan Goldstein for their helpful discussions of statistics.  ... 
doi:10.1007/bfb0032731 fatcat:2vwwrnhxxnavve35xrma2uaama

Dependence based prefetching for linked data structures

Amir Roth, Andreas Moshovos, Gurindar S. Sohi
1998 ACM SIGOPS Operating Systems Review  
Dependence-based prefetching achieves speedups of up to 2.5% on a suite of pointer-intensive programs.  ...  We introduce a dynamic scheme that captures the accesspatterns of linked data structures and can be used to predict future accesses with high accuracy.  ...  Acknowledgments The authors would like to thank Jim Smith, Mark Hill, Doug Burger, and Milo Martin for their comments on early versions of this paper, and the anonymous referees for their careful reviews  ... 
doi:10.1145/384265.291034 fatcat:4lkgda5hpbck3hbt6npl65jsoi

Speculative Prefetching of Induction Pointers [chapter]

Artour Stoutchinin, José Nelson Amaral, Guang R. Gao, James C. Dehnert, Suneel Jain, Alban Douillet
2001 Lecture Notes in Computer Science  
We present an automatic approach for prefetching data for linked list data structures.  ...  This regularity in the memory footprint of linked lists enables the development of a prefetching framework where the address of the element accessed in one of the future iterations of the loop is dynamically  ...  These mechanisms rely on the spatial and temporal locality of data that naturally occurs in regular programs. However, for irregular, pointer-based applications, prefetching is often less effective.  ... 
doi:10.1007/3-540-45306-7_20 fatcat:afgmfhlxkfelxao6ep32lmw2ha

A Study of Pointer-Chasing Performance on Shared-Memory Processor-FPGA Systems

Gabriel Weisz, Joseph Melber, Yu Wang, Kermin Fleming, Eriko Nurvitadhi, James C. Hoe
2016 Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays - FPGA '16  
The linked-list traversal is parameterized by node layout in memory, per-node data payload size, payload dependence, and traversal concurrency to capture the main performance effects of different pointerbased  ...  We make observations of the key effects on currently available systems including the Xilinx Zynq, the Intel QuickAssist QPI FPGA Platform, and the Convey HC-2.  ...  This is to model the effect of payload data dependence when traversing a real-world pointer-based data structure.  ... 
doi:10.1145/2847263.2847269 dblp:conf/fpga/WeiszMWFNH16 fatcat:mgozhfq3tbfula5wyij2epzs34

A general data dependence test for dynamic, pointer-based data structures

Joseph Hummel, Laurie J. Hendren, Alexandru Nicolau
1994 SIGPLAN notices  
However, data dependence testing is a difficult problem, particularly in the presence of pointers.  ...  In this paper we present a new technique for performing more accurate data dependence testing in the presence of dynamic, pointer-based data structures.  ...  One of the critical features of such compilers is accurate data dependence analysis [Ken90] .  ... 
doi:10.1145/773473.178262 fatcat:o33l4ghh5fdmxizz5fnn65yrci

On the importance of points-to analysis and other memory disambiguation methods for C programs

Rakesh Ghiya, Daniel Lavery, David Sehr
2001 SIGPLAN notices  
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)  ...  The study is based on empirical data collected for the SPEC CINT2000 C/C++ programs, running on the Itanium processor.  ...  The technique that proves most effective depends on the memory reference mix of the program, and the type of queries posed by the various optimizations in the compiler.  ... 
doi:10.1145/381694.378806 fatcat:uhdcholpsbcoth4hacef6g66rm
« Previous Showing results 1 — 15 out of 118,247 results