Celluloid
Async Ruby

Celluloid | Async Ruby | |
---|---|---|
2 | 23 | |
3,884 | 2,220 | |
0.1% | 0.8% | |
0.0 | 9.0 | |
about 1 year ago | 6 days ago | |
Ruby | Ruby | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Celluloid
-
There are a *lot* of actor framework projects on Cargo.
Speaking as someone who has used Erlang longer than most, who created a pre-Elixir-like language for Erlang's BEAM VM, and who routinely listens to Carl Hewitt's rants about why Erlang actors are bad, and who tried to make a Ruby actor library after using innumerable other library-level actor solutions...
-
Best of (Ruby) Gems Series - What's Next? What's Hot?
Celluloid
Async Ruby
-
Building a Multi-Connection Redis Server with Ruby's Async Library [Part 1]
Recently I've started Codecrafters' Build your own Redis (which I highly recommend!). One of the first steps is to make a TCP server that can accept more than one connection. I noticed that all the provided solutions use threads or IO#Select, and none of them use a fiber-based solution with Async. In this really short article, I'll show how one could achieve the result using Async.
-
Rack for Ruby: Socket Hijacking
Since the threading problem is specific to the Puma web server, let's look at another option: Falcon. This is a new, highly concurrent Rack-compliant web server built on the async gem. It uses Ruby Fibers instead of Threads, which are cheaper to create and have much lower overhead.
-
Persistent Redis Connections in Sidekiq with Async::Redis: A Deep Dive.
Async is a composable asynchronous I/O framework for Ruby. It allows you to do things concurrently using Fibers. Since 3.0, Ruby has a fiber scheduler and Ruby core supports it. This means you can have non-blocking I/O without much effort, for example, when using Net::HTTP. If you perform a blocking operation, such as an HTTP call, inside a fiber, it will immediately yield so that another fiber can become active and do some useful work instead of blocking and waiting for the HTTP call to complete.
-
EventMachine Performance Spikes
The Async gem is the natural successor, It's actively maintained, and allows you write synchronous code is if it wasn't non-blocking, and most libraries don't need any special support for Async (exceptions are gems with C extensions that do I/O and DB libraries with connection pooling that would otherwise be thread-based).
-
Philosophy of Coroutines
https://github.com/socketry/async uses coroutines and I think in general it’s been a great model with very few downsides in practice.
-
Is ruby really slow?
There's async I/O. Here's a library that leans on Ruby 3's fiber scheduler.
-
Show HN: Goru, an experimental, Go-inspired concurrency library for Ruby
Hey folks, wanted to show this off and get feedback. Still early/experimental but there are quite a few concepts I'm excited about here. This project came about while writing a program in Go and loving its approach to concurrency. Being a long-time Rubyist I immediately started to think about what similar concepts might look like in Ruby.
I set out with two main design constraints:
1. Lightweight: I didn't want routines to be backed by fibers or threads. Having been involved some in the async project (https://github.com/socketry/async), I had some experience using fibers for concurrency but was curious if they could be avoided.
2. Explicitness: Routine behavior must be written to describe exactly how it is to behave. I always felt like concurrent code was hard to fully understand because of the indirection involved. On the spectrum between tedium and magical I wanted to err more on the side of tedium with Goru.
Goru routines are just blocks that are called once for every tick of the reactor. It is up to the developer to implement behavior in terms of a state machine, where on each tick the routine takes some action and then updates the state of the routine for the next tick. This fulfills both design constraints:
1. Because routines are just blocks, they weigh in at about ~345 bytes of memory overhead.
2. Routine behavior is explicit because it is written as a state machine inside the block.
Couple more features worth noting:
* Goru includes channels for buffered reading/writing (similar to channels in Go).
* Goru ships with primitives for non-blocking IO to easily build things like http servers.
Curious your thoughts!
- Twitter (re)Releases Recommendation Algorithm on GitHub
-
Simple MapReduce that melt my brain (yes, fibers there)
For those who are interested here is the question.
- How does Ruby handle parallel HTTP requests in separate threads?
What are some alternatives?
Concurrent Ruby - Modern concurrency tools including agents, futures, promises, thread pools, supervisors, and more. Inspired by Erlang, Clojure, Scala, Go, Java, JavaScript, and classic concurrency patterns.
EventMachine - EventMachine: fast, simple event-processing library for Ruby programs
Polyphony - Fine-grained concurrency for Ruby
