From: watson1978@...
Date: 2017-05-08T16:29:40+00:00
Subject: [ruby-core:81040] [Ruby trunk Bug#13503] Improve performance of some Time & Rational methods

Issue #13503 has been updated by watson1978 (Shizuo Fujita).


normalperson (Eric Wong) wrote:
>  Maybe CPU and compiler differences can account for this.
>  What CPU and compiler are you using?
>  I tested with AMD FX-8320 @ 3.5GHz + gcc (via Debian 4.9.2-10)

I have used MacBook Pro (Retina, 15-inch, Late 2013) and my enviroment is

* OS : macOS 10.12.4
* CPU : Intel Core i7 2.6 GHz
* Compiler : clang-802.0.42 in Xcode 8.3.2

In additional, I turned off turbo boost feater in Intel CPU when measured the benchmark using https://github.com/rugarciap/Turbo-Boost-Switcher

Thank you.

----------------------------------------
Bug #13503: Improve performance of some Time & Rational methods
https://bugs.ruby-lang.org/issues/13503#change-64699

* Author: watson1978 (Shizuo Fujita)
* Status: Open
* Priority: Normal
* Assignee: 
* Target version: 
* ruby -v: 
* Backport: 2.2: UNKNOWN, 2.3: UNKNOWN, 2.4: UNKNOWN
----------------------------------------
Some Time methods will call internal quov() function.
quov() calls Rational#quo -> f_muldiv() -> i_gcd() in rational.c
i_gcd() will calculate GCD using Euclidean's Algorithm and it lose a long time in modulo method (ie "x = y % x;").

This patch will replace i_gcd() with Stein's algorithm which is faster algorithm for GCD.
(https://en.wikipedia.org/wiki/Binary_GCD_algorithm)

Some Rational methods also call i_gcd(). 

### Before
~~~
Calculating -------------------------------------
         Time#subsec      2.017M (�� 8.6%) i/s -     10.052M in   5.020331s
              Time#-      4.246M (�� 1.1%) i/s -     21.259M in   5.006968s
          Time#round    402.944k (��11.0%) i/s -      1.996M in   5.014424s
           Time#to_f      5.627M (�� 1.3%) i/s -     28.195M in   5.011366s
           Time#to_r      1.927M (�� 8.2%) i/s -      9.590M in   5.009198s
          Rational#+      3.894M (�� 1.0%) i/s -     19.545M in   5.019923s
          Rational#-      3.811M (�� 1.0%) i/s -     19.125M in   5.018842s
          Rational#*      5.148M (�� 1.1%) i/s -     25.858M in   5.023586s
~~~

### After
~~~
Calculating -------------------------------------
         Time#subsec      2.648M (�� 3.0%) i/s -     13.257M in   5.010600s
              Time#-      4.265M (�� 1.4%) i/s -     21.372M in   5.012480s
          Time#round    393.309k (��12.5%) i/s -      1.934M in   5.000319s
           Time#to_f      5.638M (�� 2.0%) i/s -     28.223M in   5.008422s
           Time#to_r      2.313M (�� 5.2%) i/s -     11.568M in   5.015379s
          Rational#+      4.366M (�� 1.6%) i/s -     21.846M in   5.004487s
          Rational#-      4.443M (�� 1.2%) i/s -     22.255M in   5.009509s
          Rational#*      5.776M (�� 1.1%) i/s -     28.888M in   5.002322s
~~~

### Test code
~~~
require 'benchmark/ips'

Benchmark.ips do |x|
  x.report "Time#subsec" do |t|
    time = Time.now
    t.times { time.subsec }
  end

  x.report "Time#-" do |t|
    time1 = Time.now
    time2 = Time.now
    t.times { time1 - time2 }
  end

  x.report "Time#round" do |t|
    time = Time.now
    t.times { time.round }
  end

  x.report "Time#to_f" do |t|
    time = Time.now
    t.times { time.to_f }
  end

  x.report "Time#to_r" do |t|
    time = Time.now
    t.times { time.to_r }
  end

  x.report "Rational#+" do |t|
    rat1 = 1/2r
    rat2 = 1/3r
    t.times { rat1 + rat2 }
  end

  x.report "Rational#-" do |t|
    rat1 = 1/3r
    rat2 = 1/2r
    t.times { rat1 - rat2 }
  end

  x.report "Rational#*" do |t|
    rat1 = 1/3r
    rat2 = 1/2r
    t.times { rat1 * rat2 }
  end
end
~~~




-- 
https://bugs.ruby-lang.org/

Unsubscribe: <mailto:ruby-core-request@ruby-lang.org?subject=unsubscribe>
<http://lists.ruby-lang.org/cgi-bin/mailman/options/ruby-core>