TITLE

Probabilistic Alias Analysis of Executable Code

AUTHOR(S)
Yu-Min Lu; Peng-Sheng Chen
PUB. DATE
December 2011
SOURCE
International Journal of Parallel Programming;Dec2011, Vol. 39 Issue 6, p663
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper we present a method for flow-sensitive, context-insensitive probabilistic alias analysis at the assembly level. A memory disambiguation algorithm is also developed for revealing the probability of two registers holding the same memory location. The alias analysis and memory disambiguation algorithms are implemented based on the Diablo post-link optimizer. Experimental results show that the technique can estimate the probabilities that registers refer to the same memory address in benchmark programs with an overall average error of about 6.8%. The post-link optimizer can leverage the obtained quantitative information to facilitate aggressive analyses and optimizations.
ACCESSION #
63995377

 

Related Articles

  • Fuzzy artificial bees colony algorithm for solving traveling salesman problem. LIU Yin; MA Liang // Application Research of Computers / Jisuanji Yingyong Yanjiu;Sep2013, Vol. 30 Issue 9, p2694 

    Aiming at the premature convergence problem in traditional intelligent optimization algorithm, this paper proposed a fuzzy artificial bees colony algorithm, it based on the principles of fuzzy processing and bees colony behavior. It introduced fuzzy inputs and fuzzy outputs into the algorithm to...

  • Optimization of Transverse Load Factor of Helical and Spur Gears Using Genetic Algorithm. Milojevíc, Marija // Applied Mathematics & Information Sciences;Jul2013, Vol. 7 Issue 4, p1323 

    In this paper work, it was discussed the model of meshing gears such that the transverse load factor does not change over time and along the line of contact in order to determine if there is some deviations from the assumed and to determine the extent of their changes. During the optimization...

  • Reliable guaranteed cost control for stochastic distribution system. QU Yi; GUO Bao-long; LI A-hong; HE Zheng-han; WANG Da-wei // Application Research of Computers / Jisuanji Yingyong Yanjiu;Sep2013, Vol. 30 Issue 9, p2677 

    This paper presented a reliable guaranteed cost control for the control of the system output probability density functions (PDF) with which existed non-reliable controller using numerical solution optimization. It was noted that the performance index of the guaranteed cost was guaranteed to be...

  • A Model for Planning of Generalized Power Source in Active Distribution Network Based on The Glowworm Swarm Optimization Algorithm. Chao Pan; Tao Meng; Hang Yin; Kuo Su // Applied Mechanics & Materials;2014, Issue 681, p127 

    The problem of generalized power sources planning in distribution system is researched. Meanwhile, the active and reactive power of generalized power source are treated as control variables. In this paper a generalized index for probabilistic optimal planning is presented. Based on this, a new...

  • Learning to Optimize via Posterior Sampling. Russo, Daniel; Van Roy, Benjamin // Mathematics of Operations Research;Nov2014, Vol. 39 Issue 4, p1221 

    This paper considers the use of a simple posterior sampling algorithm to balance between exploration and exploitation when learning to optimize actions such as in multiarmed bandit problems. The algorithm, also known as Thompson Sampling and as probability matching, offers significant advantages...

  • EVALUATION OF VARIOUS COMPILER OPTIMIZATION TECHNIQUES RELATED TO MIBENCH BENCHMARK APPLICATIONS. Andrews, Jeyaraj; Sasikala, Thangappan // Journal of Computer Science;Jun2013, Vol. 9 Issue 6, p749 

    Tuning compiler optimization for a given application of particular computer architecture is not an easy task, because modern computer architecture reaches higher levels of compiler optimization. These modern compilers usually provide a larger number of optimization techniques. By applying all...

  • Sparse Conditional Constant Propagation.  // Network Dictionary;2007, p457 

    A definition of the term "Sparse Conditional Constant Propagation" is presented. It refers to an optimization frequently utilized in compilers after conversion to static single assignment form (SSA). This algorithm simultaneously removes dead code and propagates constants throughout a program....

  • CLOMP: Accurately Characterizing OpenMP Application Overheads. Bronevetsky, Greg; Gyllenhaal, John; de Supinski, Bronis R. // International Journal of Parallel Programming;Jun2009, Vol. 37 Issue 3, p250 

    Despite its ease of use, OpenMP has failed to gain widespread use on large scale systems, largely due to its failure to deliver sufficient performance. Our experience indicates that the cost of initiating OpenMP regions is simply too high for the desired OpenMP usage scenario of many...

  • Power-Aware Compilation for Register File Energy Reduction. Ayala, Josá L.; Veidenbaum, Alexander; López-Vallejo, Marisa // International Journal of Parallel Programming;Dec2003, Vol. 31 Issue 6, p451 

    Most power reduction techniques have focused on gating the clock to unused functional units to minimize static power consumption, while system level optimizations have been used to deal with dynamic power consumption. Once these techniques are applied, register file power consumption becomes a...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics