Slide 1

Slide 1 text

Hello, CityJS Athens πŸ‘‹ πŸ‡¬πŸ‡· DEEP DIVING ON CONCURRENT REACT β€’ THE 31ST OF MAY, 2023.

Slide 2

Slide 2 text

DEEP DIVING ON CONCURRENT REACT MATHEUS ALBUQUERQUE β€’ @ythecombinator

Slide 3

Slide 3 text

DEEP DIVING ON CONCURRENT REACT πŸ§‘πŸ« @techlabs 🐦 @ythecombinator πŸ‘¨πŸ’» @medallia ↑ ALL THE LINKS! πŸ€“ ⚑ Perf GDE

Slide 4

Slide 4 text

DEEP DIVING ON CONCURRENT REACT 🀿 DEEP DIVE! LET’S DISCUSS MORE AFTER! ↑ ALL THE LINKS! πŸ€“

Slide 5

Slide 5 text

#QUESTION πŸ€” Who here works with React?

Slide 6

Slide 6 text

#DISCLAIMER 😌 This is a deep dive for those who are interested in API discussions. You don’t need to know all of that to be productive with React.

Slide 7

Slide 7 text

#QUESTION πŸ€” If you were to summarize Concurrent React in one word/expression, what’d be your pick?

Slide 8

Slide 8 text

#QUESTION πŸ€” If you were to summarize Concurrent React in one word/expression, what’d be your pick? e.g. fibers = units of work Concurrent React = ???

Slide 9

Slide 9 text

DEEP DIVING ON CONCURRENT REACT If you were to summarize Concurrent React in one word/expression, what’d be your pick?

Slide 10

Slide 10 text

The Main Thread DEEP DIVING ON CONCURRENT REACT

Slide 11

Slide 11 text

LONG TASKS

Slide 12

Slide 12 text

LONG TASKS

Slide 13

Slide 13 text

LONG TASKS

Slide 14

Slide 14 text

LONG TASKS

Slide 15

Slide 15 text

#RESEARCH πŸ“š Phone users experience slow First Input Delay on 7x more websites. — Web Almanac By HTTP Archive, 2021

Slide 16

Slide 16 text

↝ LONG TASKS DELAYED TTI ↝ MOBILE HAD UP TO ˜12X LONGER LONG TASKS ↝ OLDER DEVICES COULD BE SPENDING HALF OF THEIR LOAD-TIME ON LONG TASKS — AKAMAI AND CHROME RESEARCH, 2017 LONG TASKS

Slide 17

Slide 17 text

— AKAMAI AND CHROME RESEARCH, 2017 BUSINESS OUTCOMES

Slide 18

Slide 18 text

#QUESTION πŸ€” How to avoid blocking the main thread?

Slide 19

Slide 19 text

TASK RUNNING STRATEGIES A B C D

Slide 20

Slide 20 text

TASK RUNNING STRATEGIES PARALLELISM CONCURRENCY SCHEDULING

Slide 21

Slide 21 text

TASK RUNNING STRATEGIES PARALLELISM CONCURRENCY SCHEDULING

Slide 22

Slide 22 text

WORKERS ↝ DATA EXCHANGE IS THROUGH MESSAGE-PASSING ↝ NO ACCESS TO ANY VARIABLES/CODE FROM THE PAGE THAT CREATED THEM OR VICE VERSA ↝ NO ACCESS TO THE DOM, MAKING UI UPDATES FROM A WORKER BARELY IMPOSSIBLE ↝ TWO MODELS: ACTORS & SHARED MEMORY 🀿

Slide 23

Slide 23 text

🎭 ACTORS ↝ EACH ACTOR FULLY OWNS THE DATA IT IS OPERATING ON ↝ ACTORS CAN ONLY SEND/REACT TO MESSAGES ↝ THE MAIN THREAD IS ACTOR THAT OWNS THE DOM/UI ↝ postMessage HAS NO BUILT-IN UNDERSTANDING OF REQUEST AND RESPONSE ↝ BALANCE: MOVING CODE TO A WORKER VS COMMUNICATION OVERHEAD / WORKER BEING BUSY ↝ ONE DEDICATED TYPE: SharedArrayBuffer ↝ IF SENT VIA postMessage, THE OTHER END GETS A HANDLE TO THE EXACT SAME MEMORY CHUNK ↝ MOST OF THE WEB APIS ARE BUILT NO CONCURRENT ACCESS TO OBJECTS ↝ YOU BUILD YOUR OWN CONCURRENT DATA STRUCTURES ↝ NO DIRECT WAY OF WORKING ON FAMILIAR OBJECTS/ARRAYS; JUST A SERIES OF BYTES πŸ”— SHARED MEMORY

Slide 24

Slide 24 text

🎭 ACTORS ↝ EACH ACTOR FULLY OWNS THE DATA IT IS OPERATING ON ↝ ACTORS CAN ONLY SEND/REACT TO MESSAGES ↝ THE MAIN THREAD IS ACTOR THAT OWNS THE DOM/UI ↝ postMessage HAS NO BUILT-IN UNDERSTANDING OF REQUEST AND RESPONSE ↝ BALANCE: MOVING CODE TO A WORKER VS COMMUNICATION OVERHEAD / WORKER BEING BUSY ↝ ONE DEDICATED TYPE: SharedArrayBuffer ↝ IF SENT VIA postMessage, THE OTHER END GETS A HANDLE TO THE EXACT SAME MEMORY CHUNK ↝ MOST OF THE WEB APIS ARE BUILT NO CONCURRENT ACCESS TO OBJECTS ↝ YOU BUILD YOUR OWN CONCURRENT DATA STRUCTURES ↝ NO DIRECT WAY OF WORKING ON FAMILIAR OBJECTS/ARRAYS; JUST A SERIES OF BYTES πŸ”— SHARED MEMORY

Slide 25

Slide 25 text

WEB ASSEMBLY ↝ THE BEST EXPERIENCE FOR SHARED-MEMORY MODEL ↝ DOESN’T OFFER THE "COMFORT" OF JAVASCRIPT ↝ FASTER WHEN YOU STAY WITHIN WASM ↝ JAVASCRIPT IS OFTEN FASTER AT DOM AND HIGH- LEVEL UI LIBRARIES CAN BE MORE PERFORMANT THAN LOW-LEVEL WASM IMPLEMENTATIONS 🀿

Slide 26

Slide 26 text

↝ Atomics ↝ BuffferBackedObject ↝ Comlink ↝ WorkerDOM ↝ AND MUCH MORE!

Slide 27

Slide 27 text

WORKERS ↝ GOOD FOR DATA PROCESSING AND CRUNCHING NUMBERS ↝ HARD TO USE FOR UI-RELATED STUFF ↝ HARDER THAN ADJUSTING WORK FOR A SCHEDULER

Slide 28

Slide 28 text

TASK RUNNING STRATEGIES PARALLELISM CONCURRENCY SCHEDULING

Slide 29

Slide 29 text

#QUESTION πŸ€” If you were to summarize Concurrent React in one word/expression, what’d be your pick?

Slide 30

Slide 30 text

Scheduling in React DEEP DIVING ON CONCURRENT REACT

Slide 31

Slide 31 text

HEURISTICS COOPERATIVE MULTITASKING WITH A SINGLE INTERRUPTIBLE RENDERING THREAD PRIORITY LEVELS REGISTER CALLBACKS WITH DIFFERENT PRIORITY LEVELS IN THE BROWSER RENDER LANES ABSTRACTIONS AROUND A BITMASK; BRING GRANULARITY, AVOID OVERHEAD & ALLOW BATCHING SCHEDULING IN REACT

Slide 32

Slide 32 text

↝ A COOPERATIVE MULTITASKING MODEL ↝ A SINGLE INTERRUPTIBLE RENDERING THREAD ↝ RENDERING CAN BE INTERLEAVED WITH OTHER MAIN THREAD TASKS (AND OTHER REACT RENDERS) ↝ AN UPDATE CAN HAPPEN IN THE BACKGROUND WITHOUT BLOCKING THE RESPONSE TO NEW INPUT SCHEDULING IN REACT

Slide 33

Slide 33 text

↓ ORIGINAL RENDER TASK USER INPUT β†’ ↑ HIGHER PRIORITY RENDER TASK ↓ RESUME ORIGINAL RENDER TASK

Slide 34

Slide 34 text

↝ IT YIELDS EXECUTION IS BACK TO THE MAIN THREAD EVERY 5MS ↝ IT'S SMALLER THAN A SINGLE FRAME EVEN ON 120FPS, SO IT WON'T BLOCK ANIMATIONS ↝ IN PRACTICE, RENDERING IS INTERRUPTIBLE HEURISTICS

Slide 35

Slide 35 text

PRIORITY LEVELS

Slide 36

Slide 36 text

PRIORITY LEVELS

Slide 37

Slide 37 text

PRIORITY TIMEOUT WHEN I m m ediate SYNCHRONOUSLY TASKS THAT NEED TO RUN SYNCHRONOUSLY UserBlocking 250MS RESULTS OF A USER INTERACTION (E.G. A BUTTON CLICK) Normal 5S UPDATES THAT DON’T HAVE TO FEEL INSTANTANEOUS Low 10S TASKS THAT CAN BE DEFERRED BUT MUST STILL COMPLETE EVENTUALLY (E.G. AN ANALYTICS NOTIFICATION) Idle NO TIMEOUT TASKS THAT DO NOT HAVE TO RUN AT ALL (E.G. HIDDEN OFFSCREEN CONTENT)

Slide 38

Slide 38 text

↝ ONE LANE = ONE BIT IN A BITMASK ↝ ONE UPDATE IN REACT = ONE LANE ↝ UPDATES IN THE SAME LANE RENDER IN THE SAME BATCH. DIFFERENT LANES, SEPARATE BATCHES. ↝ 31 LEVELS OF GRANULARITY (= ONE BITMASK) RENDER LANES 🀿

Slide 39

Slide 39 text

↝ ALLOWS TO CHOOSE WHETHER TO RENDER MULTIPLE TRANSITIONS IN A SINGLE BATCH OR RENDER THEM INDEPENDENTLY ↝ REDUCES OVERHEAD OF MULTIPLE LAYOUT PASSES, STYLE RECALCULATIONS, AND MULTIPLE PAINTS RENDER LANES 🀿

Slide 40

Slide 40 text

No content

Slide 41

Slide 41 text

No content

Slide 42

Slide 42 text

#QUESTION πŸ€” How do we benefit from these in our everyday projects?

Slide 43

Slide 43 text

Scheduling in React [for the rest of us] DEEP DIVING ON CONCURRENT REACT

Slide 44

Slide 44 text

SCHEDULING IN REACT HANDLING LOTS OF DATA WITH THE useTransition HOOK TACKLING WASTED RENDERS WITH THE useSyncExternalStore HOOK HYDRATION IMPROVEMENTS WITH SELECTIVE HYDRATION & CONCURRENT REACT PROFILER ENHANCEMENTS INSPECT TRANSITIONS, GET WARNS, AND MUCH MORE!

Slide 45

Slide 45 text

#1 HANDLING LARGE SETS OF DATA DEEP DIVING ON CONCURRENT REACT

Slide 46

Slide 46 text

πŸ˜” NON-PRACTICAL… ↝ FINDING PRIMES ↝ CRACKING PASSWORDS ↝ SIERPINSKI TRIANGLE 😊 PRACTICAL… ↝ RENDERING MANY DATA-POINTS ↝ RENDERING ON A ↝ PROCESSING DATA

Slide 47

Slide 47 text

😊 PRACTICAL… ↝ RENDERING MANY DATA-POINTS ↝ RENDERING ON A ↝ PROCESSING DATA πŸ˜” NON-PRACTICAL… ↝ FINDING PRIMES ↝ CRACKING PASSWORDS ↝ SIERPINSKI TRIANGLE

Slide 48

Slide 48 text

DAILY VISITORS (BEFORE)

Slide 49

Slide 49 text

DAILY VISITORS (BEFORE) const DailyVisitors = () = > { const [data, setData] = useState(initialData); useEffect(() = > { setData(initialData); }, []); const onChange = (newData) = > { setData(newData); }; return ( ); }; export default DailyVisitors;

Slide 50

Slide 50 text

DAILY VISITORS (AFTER) const DailyVisitors = () = > { const [data, setData] = useState(initialData); const [, startTransition] = useTransition(); useEffect(() = > { setData(initialData); }, []); const onChange = (newData) = > { startTransition(() = > { setData(newData); }); }; return ( ); }; export default DailyVisitors;

Slide 51

Slide 51 text

DAILY VISITORS (AFTER)

Slide 52

Slide 52 text

↝ ˜100K + POINTS PLOTTED ↝ SUPPORT FOR SEARCHING AND FILTERING ↝ USED WORKERS + REDUX-SAGA UTILITIES + DEBOUNCING ↝ COULD'VE USED TRANSITIONS CASE #1: MAPS

Slide 53

Slide 53 text

CASE #2: ADMIN PANEL ↝ THOUSANDS OF REAL-TIME PLAYERS MESSAGING ↝ SUPPORT FOR SEARCHING AND FILTERING ↝ USED VIRTUALIZATION AND MEMOIZATION ↝ COULD'VE USED TRANSITIONS

Slide 54

Slide 54 text

#2 TACKLING WASTED RENDERS DEEP DIVING ON CONCURRENT REACT

Slide 55

Slide 55 text

useSyncExternalStore() function useSyncExternalStore( subscribe: (onStoreChange: () = > void) = > () = > void, getSnapshot: () = > Snapshot, getServerSnapshot?: () = > Snapshot ): Snapshot;

Slide 56

Slide 56 text

DEEP DIVING ON CONCURRENT REACT

Slide 57

Slide 57 text

No content

Slide 58

Slide 58 text

#QUESTION πŸ€” How do we benefit from these in our everyday projects?

Slide 59

Slide 59 text

No content

Slide 60

Slide 60 text

useLocation() function Pathname() { const { pathname } = useLocation(); return ; } function Hash() { const { hash } = useLocation(); return ; }

Slide 61

Slide 61 text

useLocation() function Pathname() { const { pathname } = useLocation(); return ; } function Hash() { const { hash } = useLocation(); return ; } OVER-RETURNING HOOK

Slide 62

Slide 62 text

SPEAKERS LIST [BEFORE]

Slide 63

Slide 63 text

useLocation() function Pathname() { const { pathname } = useLocation(); return ; } function Hash() { const { hash } = useLocation(); return ; }

Slide 64

Slide 64 text

function useHistorySelector(selector) { const history = useHistory(); return useSyncExternalStore(history.listen, () = > selector(history)); } function Pathname() { const pathname = useHistorySelector((history) = > history.location.pathname); return ; } function Hash() { const hash = useHistorySelector((history) = > history.location.hash); return ; } useHistorySelector()

Slide 65

Slide 65 text

function useHistorySelector(selector) { const history = useHistory(); return useSyncExternalStore(history.listen, () = > selector(history)); } function Pathname() { const pathname = useHistorySelector((history) = > history.location.pathname); return ; } function Hash() { const hash = useHistorySelector((history) = > history.location.hash); return ; } useHistorySelector()

Slide 66

Slide 66 text

SPEAKERS LIST [AFTER]

Slide 67

Slide 67 text

#3 HYDRATION IMPROVEMENTS DEEP DIVING ON CONCURRENT REACT

Slide 68

Slide 68 text

HYDRATION (BEFORE) FETCHING DATA (SERVER) RENDERING HTML (SERVER) LOADING CODE (CLIENT) HYDRATING TIME TO FIRST BYTE FIRST CONTENTFUL PAINT TIME TO INTERACTIVE

Slide 69

Slide 69 text

↝ HYDRATION COULD ONLY BEGIN AFTER THE ENTIRE DATA WAS FETCHED AND RENDERED ↝ USERS COULDN’T INTERACT WITH THE PAGE UNTIL HYDRATION WAS COMPLETE FOR THE WHOLE PAGE ↝ PARTS OF YOUR APP THAT LOAD FAST WOULD ALWAYS HAVE TO WAIT FOR THE SLOW ONES HYDRATION (BEFORE)

Slide 70

Slide 70 text

DEEP DIVING ON CONCURRENT REACT

Slide 71

Slide 71 text

HYDRATION (BEFORE) FETCHING DATA (SERVER) RENDERING HTML (SERVER) LOADING CODE (CLIENT) HYDRATING TIME TO FIRST BYTE FIRST CONTENTFUL PAINT TIME TO INTERACTIVE

Slide 72

Slide 72 text

HYDRATION (AFTER) TIME TO FIRST BYTE FIRST CONTENTFUL PAINT TIME TO INTERACTIVE […] FETCHING DATA (SERVER) RENDERING HTML (SERVER) HYDRATING LOADING CODE (CLIENT) […] […] […] […] […] […]

Slide 73

Slide 73 text

↝ pipeToNodeStream + createRoot + ↝ REACT PRIORITIZES HYDRATING THE PARTS THAT THE USER INTERACTED WITH BEFORE THE REST ↝ COMPONENTS CAN BECOME INTERACTIVE FASTER BY ALLOWING THE BROWSER TO DO OTHER WORK AT THE SAME TIME AS HYDRATION HYDRATION (AFTER)

Slide 74

Slide 74 text

↝ REACT WON'T WAIT FOR HUGE COMPONENTS TO LOAD TO CONTINUE STREAMING HTML FOR THE REST OF THE PAGE ↝ WHEN THE HTML BECOMES AVAILABLE ON THE SERVER, IT WILL BE ADDED TO THE SAME STREAM ALONG WITH A SCRIPT TAG AND INSERTED IN THE RIGHT PLACE HYDRATION (AFTER)

Slide 75

Slide 75 text

DEEP DIVING ON CONCURRENT REACT

Slide 76

Slide 76 text

#4 PROFILER ENHANCEMENTS DEEP DIVING ON CONCURRENT REACT

Slide 77

Slide 77 text

TRANSITIONS β€” INTRODUCING A NEW REACT PROFILER, BY BRIAN VAUGHN

Slide 78

Slide 78 text

β€” INTRODUCING A NEW REACT PROFILER, BY BRIAN VAUGHN WARNS

Slide 79

Slide 79 text

The Future DEEP DIVING ON CONCURRENT REACT

Slide 80

Slide 80 text

↝ I/O LIBRARIES LIKE react-fetch ↝ BUILT-IN FOR DATA FETCHING LIBRARIES TO INTEGRATE WITH ↝ FOR CPU-BOUND TREES TO IMMEDIATELY FALLBACK WITHOUT EVEN TRYING TO RENDER THE FUTURE 🀿

Slide 81

Slide 81 text

↝ useInsertionEffect FOR STYLESHEET LIBRARIES ↝ THE COMPONENT ↝ SERVER COMPONENTS ↝ NATIVE SCHEDULING PRIMITIVES ON THE BROWSER THE FUTURE 🀿

Slide 82

Slide 82 text

DEEP DIVING ON CONCURRENT REACT

Slide 83

Slide 83 text

SCHEDULING API ↝ A MORE ROBUST SOLUTION FOR SCHEDULING TASKS ↝ CONTROL AND SCHEDULE PRIORITIZED TASKS IN A UNITED AND FLEXIBLE WAY ↝ INTEGRATED DIRECTLY INTO THE EVENT LOOP ↝ ALIGNED WITH THE WORK OF THE REACT TEAM AND IN COOPERATION WITH GOOGLE, W3C AND OTHERS

Slide 84

Slide 84 text

scheduler.postTask() SCHEDULE AND CONTROL PRIORITIZING TASKS. scheduler.wait() YIELD AND RESUME AFTER SOME AMOUNT OF TIME OR PERHAPS AFTER AN EVENT HAS OCCURRED. scheduler.yield() BREAK UP LONG TASKS BY YIELDING TO THE BROWSER AND CONTINUING AFTER BEING RESCHEDULED. isInputPending() DETERMINE IF THE CURRENT TASK IS BLOCKING INPUT EVENTS. SCHEDULING API

Slide 85

Slide 85 text

SCHEDULING API

Slide 86

Slide 86 text

Closing Notes DEEP DIVING ON CONCURRENT REACT

Slide 87

Slide 87 text

DEEP DIVING ON CONCURRENT REACT

Slide 88

Slide 88 text

#1 DEEP DIVING ON CONCURRENT REACT REACT IS NOT REACTIVE, BUT IT IS CONCURRENT AND THAT MIGHT BE ENOUGH FOR YOU

Slide 89

Slide 89 text

No content

Slide 90

Slide 90 text

#2 DEEP DIVING ON CONCURRENT REACT REACT HAS BEEN PUSHING WEB APIS TO THE FUTURE E.G. THE SCHEDULER API

Slide 91

Slide 91 text

DEEP DIVING ON CONCURRENT REACT

Slide 92

Slide 92 text

No content

Slide 93

Slide 93 text

🀿

Slide 94

Slide 94 text

export const Hello = () = > { const value = usePromise(() = > delay("Hey there! πŸ‘‹", 3000)); return {value}; }; function Demo() { return ( }> ); } 🀿

Slide 95

Slide 95 text

DID WE JUST CREATE React.use()? πŸ€”

Slide 96

Slide 96 text

YES, WE DID πŸ€“

Slide 97

Slide 97 text

#3 DEEP DIVING ON CONCURRENT REACT UNDERSTANDING THESE INTERNALS AND THEIR RATIONALES HELPS US IMPLEMENT OUR OWN ABSTRACTIONS E.G. FIRST CLASS SUPPORT FOR PROMISES

Slide 98

Slide 98 text

#4 DEEP DIVING ON CONCURRENT REACT SCHEDULING DOES NOT NECESSARILY MEAN BETTER PERFORMANCE 🀿

Slide 99

Slide 99 text

#5 DEEP DIVING ON CONCURRENT REACT THERE'S NO SILVER BULLET. IDENTIFY YOUR CORE METRICS.

Slide 100

Slide 100 text

#6 DEEP DIVING ON CONCURRENT REACT THERE’S A LOT OF INFORMATION OUT THERE

Slide 101

Slide 101 text

No content

Slide 102

Slide 102 text

#7 DEEP DIVING ON CONCURRENT REACT ALWAYS TRY TO CORRELATE BUSINESS METRICS WITH PERFORMANCE

Slide 103

Slide 103 text

DEEP DIVING ON CONCURRENT REACT THAT’S ALL, FOLKS! Ξ΅Ο…Ο‡Ξ±ΟΞΉΟƒΟ„ΟŽ! 🀝 πŸ‡¬πŸ‡· QUESTIONS? ↑ ALL THE LINKS! πŸ€“ MATHEUS ALBUQUERQUE β€’ @ythecombinator