Venue: JSYS 2023 March_Papers

Reviews:

final_score: rating: Strong accept: excellent paper that will help the community
review_content: summary of review: This paper proposes a simple solution to the cluster sending problem. 
strengths: The solution is simple.
The paper presents evaluation results.
weaknesses: The discussion on asynchrony is hand-wavy. 
detailed comments: This revision has addressed previous reviewer concerns.
review_title: null

final_score: rating: Strong accept: excellent paper that will help the community
review_content: summary of review: The paper deals with the practical need to support the sharding of data among independent fault-tolerant clusters. It improves the message complexity of byzantine fault tolerant sending of values among clusters.  

The authors addressed the issues raised in prior reviews.
strengths: Improves the expected message complexity of a relevant problem 

Can be applied to actual systems

Includes theory and experiments

weaknesses: Nothing to point out 
detailed comments: Nothing to point out
review_title: null

final_score: rating: Strong accept: excellent paper that will help the community
review_content: summary of review: The authors provide a new algorithm, "probabilistic cluster-sending techniques," to improve the message complexity from previously linear in the size of the cluster involved to constant. For practical systems, this is a great improvement. I am happy to see that the authors addressed my previous comments.
strengths: It substantially improves the message complexity.
weaknesses: Does not provide any result on bit complexity, i.e., total number of bits transmitted.
detailed comments: Bit complexity is also an improvant complexity measure as it has to do with the throughput of the systems. Some discussion on bit complexity should be added.
review_title: null

final_score: rating: Strong accept: excellent paper that will help the community
review_content: summary of review: This paper studies the cluster-sending problem defined from Hellings et al. [DISC 2019].
The authors addressed the previous review comments. The model description, the discussions in asynchronous settings, the discussion for multi-cluster cluster-sending problem, and the figures are improved. I recommend accepting this paper.


strengths: The main contribution of this paper are:
* Give a protocol with an expected constant inter-cluster messages.
* Give a protocol with an expected constant and worst-case linear inter-cluster messages.
* Brings attention to the cluster sending problem when local and global communication have huge differences in costs.

weaknesses: * nothing I can think of for now.
detailed comments: Small Typo:

* There seem to be a missing factorial on page 18 (x=x(x-1)!)
review_title: null

Meta-review: Congratulations on getting your manuscript accepted! 

The meta-review contains details about the reviewers' expectations for the final version. Please reach out to the Area Chairs if anything is unclear.

Romain Jacob, JSys Editor-in-Chief
Decision: Strong accept: excellent paper that will help the community