use Perl

• Finding the bottleneck... (Score:2)

  by pmichaud (6013)

  For the most part, Rakudo development has been focused more on speed than features. We're also somewhat hampered by the fact that Parrot doesn't have many good profiling tools so that we can figure out where the bottlenecks are. Those are supposed to be in place for the next major release in July.

  This post generated a lot of very fruitful discussion on #parrot today. Many people speculated about why the loop might be as slow as it is, and offered suggestions about improving Rakudo's code generation. Wha
  • Re:Finding the bottleneck... an update (Score:2)

    by pmichaud (6013)

    As mentioned previously, I'm reporting back with our status. In the course of investigating this program, we discovered that postfix:<> was in fact very badly implemented, making it far more expensive than it needed to be. Fixing this ended up requiring quite a few internal changes to Rakudo, and I've discovered even more things we want to fix/avoid when running Rakudo in Parrot.

    That said, here's where things stand now. I used the following code as a bench mark (basically same as original, cut the
    • Re:Finding the bottleneck... an update (Score:1)

      by korpenkraxar (9237) on 2009.06.01 18:19 (#68902) Journal

      It seems you are indeed right about the postfix being an important bottleneck. It never even occurred to me to change that to some other way of incrementing $i, but this is how it looks for me doing 10000 iterations:
      
      $i++; # 7.5s
      
      $i += 1; # 3.5s
      
      $i = $i + 1; # 3.5s
      
      In all cases it uses the expected ~130MB RAM, so at least there does not seem to be a significant leak specific to one of these expressions.

      Reply to This

      Parent