Sign in to follow this  
  • entries
    375
  • comments
    1136
  • views
    297499

Z

Sign in to follow this  
superpig

63 views

Followup to my previous post.

In an 100-instruction function, do we necessarily care about all 100 instructions? Given our two sequential processes, what if we were to identify all external state accessed or modified by those processes (which should be fairly easy - for starters we can get a list of all non-stack memory addresses), forget about any state that is only used by one process, and considered the result? We'd have a list of 'interactions' between the processes.

Could we then process our 100-instruction program again, looking for instructions that refer to one of the interactions on our list, and breaking the instructions into section with one interaction per section? Think of each section as an 'instruction' from my previous post.

The way of arranging two 5-element programs is going to be smaller than two 100-element programs. The value is definitely less than 5^6 (15625).
Sign in to follow this  


0 Comments


Recommended Comments

There are no comments to display.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now