A Reordering Technique for E cient Code Motion
نویسندگان
چکیده
Emerging design problems are prompting the use of code motion and speculative execution in high-level synthesis to shorten schedules and meet tight timeconstraints. However, some code motions are not worth doing from a worst-case execution perspective. We propose a technique that selects the most promising code motions, thereby increasing the density of optimal solutions in the search space.
منابع مشابه
Code Optimization as a Side E ect of Instruction Scheduling
An instruction scheduler utilizes code reordering techniques for generating schedules in which instructions can be issued without delays. In order to perform code reordering across branches, code motion is performed that hoists some instructions above branches and sinks others below branches. Following code reordering , compensation code must be introduced in order to preserve program semantics...
متن کاملReducing Startup Latency in Web and Desktop Applications
Application startup latency has become a performance problem for both desktop applications and web applications. In this paper, we show that much of the latency experienced during application startup can be avoided by more e ciently packing application code pages. To take advantage of more e cient packing, we describe the implementation of demand paging for web applications. Finally, we show th...
متن کاملSelective Block-Wise Reordering Technique for Very Low Bit-Rate Wavelet Video Coding∗
In this paper, we present a novel energy compaction method, called the selective block-wise reordering, which is used with SPIHT (SBR-SPIHT) coding for low rate video coding to enhance the coding efficiency for motion-compensated residuals. In the proposed coding system, the motion estimation and motion compensation schemes of H.263 are used to reduce the temporal redundancy. The residuals are ...
متن کامل. Motion-compensated two-link chain coding for binary shape sequence
In this paper, we present a motion compensated two-link chain coding technique to e ectively encode 2-D binary shape sequences for object-based video coding. This technique consists of a contour motion estimation and compensation algorithm and a two-link chain coding algorithm. The object contour is de ned on a 6-connected contour lattice for a smoother contour representation. The contour in th...
متن کاملBaer , Brian Bershad , and Tom
Application startup latency has become a performance problem for both desktop applications and web applications. In this paper, we show that much of the latency experienced during application startup can be avoided by more e ciently packing application code pages. To take advantage of more e cient packing, we describe the implementation of demand paging for web applications. Finally, we show th...
متن کامل