-
Notifications
You must be signed in to change notification settings - Fork 1.5k
fix(storage): optimize gRPC writer with zero-copy and lazy allocation #13481
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
Summary of ChangesHello @cpriti-os, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request significantly optimizes the gRPC writer by eliminating unnecessary double-buffering, which can reduce memory usage by up to 50% for large file uploads and parallel composite uploads. The core improvements involve introducing a zero-copy path for efficient data transfer and implementing lazy allocation for the internal write buffer, ensuring that memory is only used when strictly necessary. Highlights
Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Code Review
This pull request introduces a significant optimization to the gRPC writer by implementing a zero-copy path and lazy allocation of the internal buffer. The changes are well-structured, and the logic for handling zero-copy writes, including partial sends and retries, appears robust. The addition of comprehensive tests that verify memory addresses is excellent and provides strong confidence in the correctness of the optimization. I've found one potential issue regarding integer overflow on 32-bit systems, for which I've left a specific comment. Overall, this is a great improvement for memory efficiency.
Co-authored-by: gemini-code-assist[bot] <176961590+gemini-code-assist[bot]@users.noreply.github.com>
tritone
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Great optimization!
Looks like there are some failing emulator tests involving progress func callbacks, race detector issues, and a deadlock. LMK if you have any questions about any of these. Probably you'll need to work on thread safety between the buffer alloc and the pipelined sends.
In addition we'd probably want to think about how to message this -- does this change how the writer "should" be used for gRPC? Do we want to suggest buffer pooling in the user application?
Finally, it'd be useful to get a pprof CPU/memory profile for before/after on this.
This change eliminates unnecessary double-buffering in the gRPC writer,
reducing memory usage by up to 50% for Parallel Composite Uploads (PCU)
and large single-shot uploads.
Key changes:
gRPCWriter: If the input slice islarge enough (>= chunk size) or if in one-shot mode, the writer now
passes the user's memory directly to the gRPC transport layer instead
of copying it into an internal buffer.
w.buf) is nowinitialized to
niland is only allocated if the "Slow Path" (buffering)is triggered. This allows purely zero-copy workloads to run with
near-zero overhead.
chunkSizetogRPCWriterto support logic whenw.bufis nil.optimization is active and strictly correct during retries.