Since it might have sounded differently, most of the things I wrote are
something that CEP-21 _enables_ us to do.
But CEP-21 will just (more or less) make cluster operations consistent. The
rest of the things - are just features that we will implement on top of it. We
will need people to adopt
Right, all of the things you describe will be possible post CEP-21, just not
immediately. My point is that CEP-21 has a specific scope and a lot of the
great planned improvements necessarily fall outside of that.
> On 20 Oct 2022, at 15:42, Alex Petrov wrote:
>
> > by default C* does prohibit
> by default C* does prohibit concurrent bootstraps (behaviour which can be
> overridden with the cassandra.consistent.rangemovement system property). But
> there's nothing to stop you fully bootstrapping additional nodes in series,
> then removing them in the same way.
I think there are multip
> Add A' to the cluster with the same keyspace as A.
Can you clarify what you mean here?
> Currently these operations have to be performed in sequence. My
> understanding is that you can't add more than one node at a time.
To ensure consistency guarantees are honoured, by default C* does pro
My understanding of our process is (assuming we have 3 nodes A,B,C):
- Add A' to the cluster with the same keyspace as A.
- Remove A from the cluster.
- Add B' to the cluster
- Remove B from the cluster
- Add C' to the cluster
- Remove C from the cluster.
Currently these operati
I'm not sure I 100% understand the question, but the things covered in CEP-21
won't enable you to as an operator to bootstrap all your new nodes without
fully joining, then perform an atomic CAS to replace the existing members.
CEP-21 alone also won't solve all cross-version streaming issues, wh
After CEP-21 would it be possible to take a cluster of 6 nodes, spin up 6
new nodes to duplicate the 6 existing nodes and then spin down the original
6 nodes. Basically, I am thinking of the case where a cluster is running
version x.y.z and want to run x.y.z+1, can they spin up an equal number of
