A Simple, Linear-Time Algorithm for x86 Jump Encoding

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages

Scientific paper

The problem of space-optimal jump encoding in the x86 instruction set, also known as branch displacement optimization, is described, and a linear-time algorithm is given that uses no complicated data structures, no recursion, and no randomization. The only assumption is that there are no array declarations whose size depends on the negative of the size of a section of code (Hyde 2006), which is reasonable for real code.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Simple, Linear-Time Algorithm for x86 Jump Encoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Simple, Linear-Time Algorithm for x86 Jump Encoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple, Linear-Time Algorithm for x86 Jump Encoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-117274

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.