Home/ Questions/Q 725273
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-14T06:19:06+00:00

Ever looked at the Computer Language Benchmarks Game (formerly known as the Great Language

  • 0

Ever looked at the Computer Language Benchmarks Game (formerly known as the Great Language Shootout)?

Perl has some pretty healthy competition there at the moment. It also occurs to me that there’s probably some places that Perl’s scores could be improved. The biggest one is in the chameneos-redux script right now—the Perl version runs the worst out of any language: 1,626 times slower than the C baseline solution!

There are some restrictions on how the programs can be made and optimized, and there is Perl’s interpreted runtime penalty, but 1,626 times? There’s got to be something that can get the runtime of this program way down.

Taking a look at the source code and the challenge, how can the speed be improved?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I ran the source code through the Devel::SmallProf profiler. The profile output is a little too verbose to post here, but you can see the results yourself using $ perl -d:SmallProf chameneos.pl 10000 (no need to run it for 6000000 meetings unless you really want to!) See perlperf for more details on some profiling tools in Perl.

    It turns out that using semaphores is the major bottleneck. The lion’s share of total CPU time is spent on checking whether a semaphore is locked or not. Although I haven’t had enough time to look at why the source code uses semaphores, it may be that you can work around having to use semaphores altogether. That’s probably your best shot at improving the code’s performance.

    • 0