Shevek (shevek) wrote,

After much reading of the algorithms book and help from friends, I have finally written a static analyser which determines under what conditions (in runtime) a basic block can no longer be reached. This allows me to automatically generate aggregating operations and schedule parallel programs which contain them. I should have finished it two weeks ago, but the solution, indeed even a precise definition of the problem, turned out to be nonobvious.

  • (no subject)

    Woken up at 3am, sounds like we're into a storm. This is still the overture, it's been thundering tremendously for 30 minutes now, and flashing with…

  • (no subject)

    The Russian greeted me with a smile which grew ever broader as I came into the room. It took me a minute to switch my head into the right language -…

  • (no subject)

    People here show their religion in their driving. Actually, they show that they have religion by driving at all, one has to put one's faith in some…

  • Post a new comment


    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 1 comment