Small data optimization - Nikolai Vazquez 

🔔 FOLLOW RUSTLAB CHANNEL 🔔
ABSTRACT:
Outline:
- (1 min) Brief introduction of myself.
- (3 min) Discuss various crates for small string/vector optimizations.
 - Why they differ from one another.
 - Benefits: cache locality and less heap usage.
- (20 min) How to implement small data optimization:
 - (5 min) `enum` using no `unsafe`:
  - Demonstrates a core strength of Rust.
 - (12 min) Using `unsafe` to eke out as much performance as possible:
  - Benefits include: no wasted bytes and fine control over mutation strategies, like copy-on-write.
  - Need to be actively aware of all possible cases.
   - Niche optimization (e.g. `Option`) requires special care.
  - Test with MIRI: undefined behavior and endianness.
 - (3 min) Interning.
  - Deduplicating small strings.
  - Local versus global.
- (6 min) Conclusion:
 - "Small" changes meaning based on the context.
 - Rust can provide optimizations seen in C/C++ but it doesn't have to be difficult.
 - Don't need to reach for `unsafe` unless you are bringing something new to the table and have tested all possible cases.
- (10 min) Questions
This channel is dedicated to the videos of the RustLab conference.
⚙️ Follow us on TWITTER:
/ rustlab_conf
⚙️ Follow us on FACEBOOK:
/ rustlabconference
RustLab is the first Italian international conference on the Rust programming language, organized by Develer.
Develer is not just an Italian company projecting and releasing hardware and software solutions for the industrial environment, but is also an ensemble of people sharing their great passion for new technologies and how they can be applied to your everyday life.
⚙️ Follow DEVELER on INSTAGRAM:
/ wearedeveler
⚙️ Follow DEVELER on FACEBOOK:
/ we.are.develer
⚙️ Follow DEVELER on TWITTER:
/ develer
⚙️ Follow DEVELER on LINKEDIN:
/ 114426
⚙️ Follow DEVELER on TELEGRAM: t.me/wearedeveler
⚙️ Follow DEVELER on TIK TOK:
/ wearedeveler

Наука