This document discusses performance optimization in Ruby. It provides 6 tips for optimizing Ruby code, including always having benchmarking tests, upgrading to newer Ruby versions, trying alternative Ruby implementations like JRuby, profiling methods, identifying bottlenecks, and considering alternative languages like Elixir. It also lists some tools for profiling Ruby code, such as MethodProfiler, KCacheGrind, RubyProf, and DTrace.

1. PERFORMANCE
OPTIMIZATION IN RUBYPRATHMESH RANAUT
© Prathmesh Ranaut, 2017

2. © Prathmesh Ranaut, 2017

3. ☃ -> "
© Prathmesh Ranaut, 2017

4. WHO AM I
> Computer Science Undergrad
> Helped ! of ruby apps improve
performance
© Prathmesh Ranaut, 2017

5. > Celluloid - Concurrent ruby framework
> Improved performance by 300%
© Prathmesh Ranaut, 2017

6. WHAT IS PERFORMANCE
OPTIMIZATION? !
© Prathmesh Ranaut, 2017

7. DOING
MOREWITH
LESS
© Prathmesh Ranaut, 2017

8. HOW?
© Prathmesh Ranaut, 2017

9. TIP #1
© Prathmesh Ranaut, 2017

10. ALWAYS HAVE A BENCHMARKING SUITE
© Prathmesh Ranaut, 2017

11. BECHMARK-IPS
© Prathmesh Ranaut, 2017

12. require "benchmark/ips"
Benchmark.ips do |ips|
ips.report("addition") { 1 + 2 }
end
© Prathmesh Ranaut, 2017

13. require "benchmark/ips"
Benchmark.ips do |ips|
ips.report("addition") { 1 + 2 }
end
Warming up --------------------------------------
addition 325.015k i/100ms
Calculating -------------------------------------
addition 12.544M (± 8.5%) i/s - 62.403M in 5.012765s
© Prathmesh Ranaut, 2017

14. class Worker
include Celluloid
def hashed(hash, key)
hash[key]
end
end
# Worker pool of different sizes
pool_10 = Worker.pool(size: 10)
pool_100 = Worker.pool(size: 100)
hash = {}
ENTRIES = 10_000
TESTS = 100_000
# Using a constant key, to derive consistent benchmarking results
KEY = 500
# Populate hash array
ENTRIES.times do |i|
hash[i] = i
end
Benchmark.bmbm do |ips|
puts "Finding the key : #{KEY}"
ips.report("pool - 10") do
TESTS.times do
pool_10.async.hashed(hash, KEY)
end
end
ips.report("pool - 100") do
TESTS.times do
pool_100.async.hashed(hash, KEY)
end
end
end
© Prathmesh Ranaut, 2017

15. TIP #2
© Prathmesh Ranaut, 2017

16. UPGRADE RUBY
© Prathmesh Ranaut, 2017

17. RUBY 1.9
> YARV
© Prathmesh Ranaut, 2017

18. RUBY 1.9
> YARV
RUBY 2.0
> Copy-on-Write
© Prathmesh Ranaut, 2017

19. RUBY 2.1
> Generation GC
RUBY 2.4
> Improves the speed to access an instance variable
© Prathmesh Ranaut, 2017

20. TIP #3
© Prathmesh Ranaut, 2017

21. TRY ANOTHER IMPLEMENTATION OF
RUBY
© Prathmesh Ranaut, 2017

22. RUBY 2.3 VS JRUBY
RUBY 2.3
Calculating -------------------------------------
addition 12.544M (± 8.5%) i/s - 62.403M
JRUBY
Calculating -------------------------------------
addition 22.929M (± 9.3%) i/s - 113.127M
© Prathmesh Ranaut, 2017

23. TIP #4
© Prathmesh Ranaut, 2017

24. PROFILE YOUR METHODS
© Prathmesh Ranaut, 2017

25. TIP #5
© Prathmesh Ranaut, 2017

26. FIGURE OUT THE BOTTLENECK
I/O OR CPU OR MEMORY
© Prathmesh Ranaut, 2017

27. TIP #6
© Prathmesh Ranaut, 2017

28. SWITCH TO ELIXIR
© Prathmesh Ranaut, 2017

29. TRY MULTITHREADING
© Prathmesh Ranaut, 2017

30. TOOLS
THAT MAKE MY LIFE EASIER
© Prathmesh Ranaut, 2017

31. METHOD PROFILER
HTTPS://GITHUB.COM/CHANGE/METHOD_PROFILER
© Prathmesh Ranaut, 2017

32. profiler = MethodProfiler.observe(BazingaClass)
# Do stuff with the BazingaClass
puts profiler.report
© Prathmesh Ranaut, 2017

33. © Prathmesh Ranaut, 2017

34. KCACHEGRIND
HTTPS://KCACHEGRIND.GITHUB.IO/
© Prathmesh Ranaut, 2017

35. © Prathmesh Ranaut, 2017

36. RUBYPROF
HTTPS://GITHUB.COM/RUBY-PROF/RUBY-PROF
© Prathmesh Ranaut, 2017

37. require 'ruby-prof'
# profile the code
result = RubyProf.profile do
# ... code to profile ...
end
# print a graph profile to text
printer = RubyProf::GraphPrinter.new(result)
printer.print(STDOUT, {})
© Prathmesh Ranaut, 2017

38. © Prathmesh Ranaut, 2017

39. ObjectSpace.count_objects
© Prathmesh Ranaut, 2017

40. {
:TOTAL=>30165,
:FREE=>2216,
:T_OBJECT=>928,
:T_CLASS=>574,
:T_MODULE=>38,
:T_FLOAT=>4,
:T_STRING=>13182,
:T_REGEXP=>77,
:T_ARRAY=>2715,
:T_HASH=>88,
:T_STRUCT=>3,
:T_BIGNUM=>2,
:T_FILE=>30,
:T_DATA=>363,
:T_MATCH=>233,
:T_COMPLEX=>1,
:T_SYMBOL=>6,
:T_IMEMO=>4530,
:T_NODE=>5138,
:T_ICLASS=>37
}
© Prathmesh Ranaut, 2017

41. DTRACE
© Prathmesh Ranaut, 2017

42. THANK YOU
&
QUESTIONSHELLO@PRATHMESHRANAUT.COM
HTTPS://TWITTER.COM/PRATHMESHRANAUT
© Prathmesh Ranaut, 2017