Download to read offline
![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](https://image.slidesharecdn.com/performance-170210053950/85/Performance-Optimization-in-Ruby-14-320.jpg)
Performance Optimization in Ruby
- 1. PERFORMANCE OPTIMIZATION IN RUBYPRATHMESHRANAUT © Prathmesh Ranaut, 2017
- 2.
- 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.
- 8.
- 9. TIP #1 © PrathmeshRanaut, 2017
- 10. ALWAYS HAVE ABENCHMARKING SUITE © Prathmesh Ranaut, 2017
- 11.
- 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 defhashed(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 © PrathmeshRanaut, 2017
- 16. UPGRADE RUBY © PrathmeshRanaut, 2017
- 17. RUBY 1.9 > YARV ©Prathmesh Ranaut, 2017
- 18. RUBY 1.9 > YARV RUBY2.0 > Copy-on-Write © Prathmesh Ranaut, 2017
- 19. RUBY 2.1 > GenerationGC RUBY 2.4 > Improves the speed to access an instance variable © Prathmesh Ranaut, 2017
- 20. TIP #3 © PrathmeshRanaut, 2017
- 21. TRY ANOTHER IMPLEMENTATIONOF RUBY © Prathmesh Ranaut, 2017
- 22. RUBY 2.3 VSJRUBY 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 © PrathmeshRanaut, 2017
- 24. PROFILE YOUR METHODS ©Prathmesh Ranaut, 2017
- 25. TIP #5 © PrathmeshRanaut, 2017
- 26. FIGURE OUT THEBOTTLENECK I/O OR CPU OR MEMORY © Prathmesh Ranaut, 2017
- 27. TIP #6 © PrathmeshRanaut, 2017
- 28. SWITCH TO ELIXIR ©Prathmesh Ranaut, 2017
- 29. TRY MULTITHREADING © PrathmeshRanaut, 2017
- 30. TOOLS THAT MAKE MYLIFE EASIER © Prathmesh Ranaut, 2017
- 31.
- 32. profiler = MethodProfiler.observe(BazingaClass) #Do stuff with the BazingaClass puts profiler.report © Prathmesh Ranaut, 2017
- 33.
- 34.
- 35.
- 36.
- 37. require 'ruby-prof' # profilethe 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.
- 39.
- 40.
- 41.
- 42.