Concurrent Programming with Ruby and Tuple Spaces
•Download as ODP, PDF•
25 likes•5,442 views
Ruby threads are limited due to the Global Interpreter Lock. Therefore, the best way to do parallel computing with Ruby is to use multiple processes but how do you get these processes to communicate? This session will provide some strategies for handling multi-process communication in Ruby, with a focus on the use of TupleSpaces. A TupleSpace provides a repository of tuples that can be accessed concurrently to implement a Blackboard system. Ruby ships with a built-in implementation of a TupleSpace with the Rinda library. During the session, Luc will demonstrate how to use Rinda and will highlight other libraries/projects that facilitate interprocess communication and parallel computing in Ruby.
![The Free Lunch is Over: A Fundamental Turn Toward Concurrency in Software Source: http://www.gotw.ca/publications/concurrency-ddj.htm “ The major processor manufacturers and architectures have run out of room with most of their traditional approaches to boosting CPU performance. Instead of driving clock speeds ands straight-line instruction throughput ever higher, they are instead turning en masse to hyperthreading and multicore architectures. […] And that puts us at a fundamental turning point in software development, at least for the next few years...” – Herb Sutter – March 2005](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
What's hot
What's hot (20)
Viewers also liked
Similar to Concurrent Programming with Ruby and Tuple Spaces
Similar to Concurrent Programming with Ruby and Tuple Spaces (20)
Recently uploaded
Recently uploaded (20)
Concurrent Programming with Ruby and Tuple Spaces
- 1. Concurrent Programming with Ruby and Tuple Spaces Luc Castera Founder / messagepub.com
- 2. The Free Lunch is Over: A Fundamental Turn Toward Concurrency in Software Source: http://www.gotw.ca/publications/concurrency-ddj.htm “ The major processor manufacturers and architectures have run out of room with most of their traditional approaches to boosting CPU performance. Instead of driving clock speeds ands straight-line instruction throughput ever higher, they are instead turning en masse to hyperthreading and multicore architectures. […] And that puts us at a fundamental turning point in software development, at least for the next few years...” – Herb Sutter – March 2005
- 3. Outline 1. The problem with Ruby Threads 2. Multiple Ruby Processes 3. Inter-process Communication with TupleSpaces
- 4. PART 1 The Problem With Threads A closer look at the Ruby threading model
- 5. 3 Types of Threading Models: 1 : N 1 : 1 M : N
- 6. 3 Types of Threading Models: 1 : N 1 : 1 M : N Kernel Threads User-Space Threads
- 7. 1 : N -> Green Threads One kernel thread for N user threads aka “lightweight threads”
- 9. 10 ms
- 10. 10 ms
- 11. 10 ms
- 12. 10 ms
- 13. 10 ms
- 14. 10 ms
- 15. 10 ms
- 16. 10 ms
- 17. RUBY 1.8
- 21. Example: mysql gem (solution: NeverBlock mysqlplus)
- 22. blocking
- 23. 1 : 1 -> Native Threads 1 kernel thread for each user thread
- 27. Low limit on number of threads
- 28. Linux kernel bug with lots of threads
- 29. RUBY 1.9
- 30. I lied.
- 34. “ Concurrency is a myth in Ruby” – Ilya Grigorik
- 35. Unless you are using JRuby.
- 38. Fibers are green threads, but scheduling must be done by the programmer and not the VM.
- 39. Faster and cheaper then native threads.
- 40. Implemented for Ruby 1.8 by Aman Gupta.
- 44. M : N -> Hybrid Model M kernel threads for N user threads “ best of both worlds”
- 47. Not all threads are blocked by blocking system calls
- 49. Green threads doing blocking I/O operations will block all other green threads sharing same kernel thread
- 50. Difficult to write, maintain, and debug code
- 52. “ Writing multi-threaded code is really, really hard. And it is hard because of Shared Memory.” – Jim Weirich The Other Problem with Threads http://rubyconf2008.confreaks.com/what-all-rubyist-should-know-about-threads.html
- 53. Multi-Threaded Code is Hard + Concurrency is a myth = FAIL!
- 54. Stop thinking in threads Design your application to use multiple processes
- 55. PART 2 Multiple Ruby Processes
- 58. Take advantage of multiple CPUs (Performance)
- 59. Not all threads are blocked by blocking system calls.
- 60. Scalability
- 62. Uses a lot of memory (loading Ruby VM for every process)
- 63. Need a way for processes to communicate!
- 64. Latency Starting/Stopping Fault-Tolerance Monitoring
- 65. but we will focus on...
- 66. How do the processes communicate?
- 68. Sockets
- 71. Tokyo Cabinet
- 73. XMPP
- 74. TupleSpaces
- 75. Examples
- 77. Communication between processes is done via the database.
- 80. Uses RabbitMQ/AMQP for IPC
- 82. Actors are kinda like threads, with messaging baked-in.
- 83. Each Actor has a mailbox.
- 84. It's like coding erlang in Ruby.
- 85. Messages are passed between actors using TCP sockets.
- 88. “ Erlang provides a sledgehammer for the problems of concurrent programming. But, sometimes you don't need a sledgehammer... just a flyswatter will do.” – Tony Arcieri
- 91. Uses UDP Sockets for IPC
- 93. PART 3 TupleSpaces I nterprocess Communication with TupleSpaces
- 95. [:add, 1, 2] [:result, 79] [:add, 60, 5] [:token] [:search, “linda”] [:where_is, :waldo [:subtract, 10, 2] [:save, 7864] The Blackboard Metaphor
- 96. [:add, 1, 2] [:result, 79] [:add, 60, 5] [:token] [:search, “linda”] [:where_is, :waldo [:subtract, 10, 2] [:save, 7864] The Blackboard Metaphor [:add, nil, nil]
- 97. [:add, 1, 2] [:result, 79] [:add, 60, 5] [:token] [:search, “linda”] [:where_is, :waldo [:subtract, 10, 2] [:save, 7864] The Blackboard Metaphor [nil]
- 98. [:add, 1, 2] [:result, 79] [:add, 60, 5] [:token] [:search, “linda”] [:where_is, :waldo [:subtract, 10, 2] [:save, 7864] The Blackboard Metaphor [:where_is, :waldo]
- 100. Linda was developed by David Gelernter and Nicholas Carriero at Yale University.
- 101. Implementations exists for most languages.
- 102. The Ruby implementation is Rinda.
- 103. Rinda is a built-in library, so no need to install.
- 105. read_all
- 106. write
- 107. take
- 108. notify
- 110. read_all
- 111. write
- 112. take
- 113. notify Reads tuple, but does not remove it. Blocking, by default, but takes an additional timeout argument.
- 115. read_all
- 116. write
- 117. take
- 118. notify Returns all tuples matching tuple. Does not remove the found tuples.
- 120. read_all
- 121. write
- 122. take
- 123. notify Adds Tuple Takes an optional timeout parameter
- 125. read_all
- 126. write
- 127. take
- 128. notify Atomic Read + Delete Blocking, by default, but takes an additional timeout argument.
- 130. read_all
- 131. write
- 132. take
- 134. Take
- 135. Delete
- 140. Start a Tuple Space on port 1234
- 141. Clients/Agents
- 143. DEMO Rinda
- 144. RingServer
- 150. This is also a TupleSpace
- 151. SPOF
- 152. Rinda is not persistent... If it crashes while you have tuples in the space, you lose them all.
- 153. Only Ruby
- 155. For now, only supports: take, read, and write
- 157. Server Just start the redis-server: $ redis-server
- 158. Client/Agents
- 159. DEMO Blackboard
- 162. I would like that Erlang implementation to be easily used from other programming languages also.
- 164. Ruby-library to talk to blackboard in erlang
- 165. Thank you! Luc Castera Founder / messagepub.com
- 166. Questions?Feedback? [email_address] www.speakerrate.com Luc Castera Founder / messagepub.com
- 179. http://erlang.org/
- 182. http://revactor.org/
- 191. JavaSpaces Principles, Patterns, and Practice – Freeman, Hupfer, et. al.