Skip to main content

What are Suspense and Concurrent Mode in React? How do they affect rendering and performance?

 Suspense and Concurrent Mode are powerful features introduced by React to improve rendering efficiency, UX, and performance.

Let’s break them down:

What are Suspense and Concurrent Mode in React? How do they affect rendering and performance?

๐Ÿ’ค React Suspense

Suspense is a mechanism for waiting on something before rendering — usually for data or code splitting (like lazy-loading components).

Key use case:

  • Waiting for a lazy-loaded component (React.lazy)

  • Waiting for data (when used with libraries like Relay, SWR, or React Query)

Example: Lazy loading a component

import React, { Suspense, lazy } from 'react'; const Profile = lazy(() => import('./Profile')); function App() { return ( <div> <Suspense fallback={<div>Loading profile...</div>}> <Profile /> </Suspense> </div> ); }

The fallback UI is shown until Profile is ready to render.

For Data Fetching:

React 18 introduced experimental support for data fetching with Suspense, but for now, most people use Suspense in tandem with libraries that integrate with it.

⚛️ Concurrent Mode (now "Concurrent Features" in React 18+)

Concurrent Mode is a set of new rendering behaviors that let React work on multiple tasks simultaneously, interrupt rendering if needed, and prioritize urgent updates — leading to more responsive UIs.

It's not a new API, but a set of internal capabilities that you opt into via things like:

  • startTransition for low-priority updates

  • Automatic batching

  • Support for Suspense in data fetching

Key benefits:

  • Interruptible rendering: React can pause and resume rendering, skipping over work that’s not urgent.

  • Better perceived performance: Keeps the UI responsive while working on heavy updates.

  • Smarter updates: React can avoid blocking the main thread with non-critical updates.

Example: startTransition

jsx
import { useState, startTransition } from 'react'; function SearchComponent() { const [input, setInput] = useState(''); const [results, setResults] = useState([]); const handleChange = (e) => { const value = e.target.value; setInput(value); startTransition(() => { // Simulate expensive calculation or fetch const filtered = expensiveSearch(value); setResults(filtered); }); }; return ( <div> <input value={input} onChange={handleChange} /> <ul>{results.map(r => <li key={r.id}>{r.name}</li>)}</ul> </div> ); }

Updates inside startTransition are marked as non-urgent, so React will keep the input responsive and render the results in the background.

๐Ÿง  Summary: Suspense vs Concurrent Mode

FeatureSuspenseConcurrent Mode / Features
PurposeWait for async operationsImprove responsiveness & scheduling
Use casesLazy loading, data fetchingSmooth UI updates, background tasks
API<Suspense fallback={...} />startTransition, automatic batching
RenderingDelays part of the treeCan pause, resume, or drop rendering
PerformanceAvoids showing broken UIPrevents main thread blockage

Let me know if you want to see how Suspense can be used with data fetching libraries or integrated with server components — that’s where things get spicy! ๐ŸŒถ️

Popular posts from this blog

How does BGP prevent routing loops? Explain AS_PATH and loop prevention mechanisms.

 In Border Gateway Protocol (BGP), preventing routing loops is critical — especially because BGP is the inter-domain routing protocol used to connect Autonomous Systems (ASes) on the internet. ๐Ÿ”„ How BGP Prevents Routing Loops The main mechanism BGP uses is the AS_PATH attribute . ๐Ÿ” What is AS_PATH? AS_PATH is a BGP path attribute that lists the sequence of Autonomous Systems (AS numbers) a route has traversed. Each time a route is advertised across an AS boundary, the local AS number is prepended to the AS_PATH. Example: If AS 65001 → AS 65002 → AS 65003 is the route a prefix has taken, the AS_PATH will look like: makefile AS_PATH: 65003 65002 65001 It’s prepended in reverse order — so the last AS is first . ๐Ÿšซ Loop Prevention Using AS_PATH ✅ Core Mechanism: BGP routers reject any route advertisement that contains their own AS number in the AS_PATH. ๐Ÿ” Why It Works: If a route makes its way back to an AS that’s already in the AS_PATH , that AS kno...

What’s the impact of BGP full routes on router memory and performance?

Receiving full BGP routes (i.e., the full global BGP routing table) has a significant impact on a router's memory and performance. Here's a breakdown of the key impacts: ๐Ÿ”ง 1. Memory Usage (RAM) A full BGP table typically contains ~1 million IPv4 routes and growing (~200k+ IPv6 routes). Each BGP route consumes tens to hundreds of bytes of memory, depending on attributes (AS path, communities, etc.). This translates to hundreds of megabytes to several gigabytes of RAM just for storing the BGP RIB (Routing Information Base). The FIB (Forwarding Information Base) , which is installed into the router's hardware or kernel for actual packet forwarding, also consumes memory (especially in TCAM for hardware routers). ❗ Example A router might require 4–8 GB of RAM (or more) to comfortably handle full BGP routes with headroom for growth and stability. ๐Ÿง  2. CPU Utilization High CPU load during: Initial BGP session establishment (parsing all rout...

Explain the OSPF LSDB (Link State Database) and how SPF (Shortest Path First) algorithm works.

OSPF (Open Shortest Path First) is a link-state routing protocol , and the LSDB (Link-State Database) and SPF (Shortest Path First) algorithm are core to how OSPF calculates the best paths . Let’s break them down. ๐Ÿง  What is the OSPF LSDB (Link-State Database)? The LSDB is a map of the entire OSPF network area — each router stores a complete topology of its area. ๐Ÿ” Details: Built from LSAs (Link-State Advertisements) exchanged between routers. Contains info about: Routers and their interfaces Network segments Neighbor relationships Each OSPF router maintains an identical LSDB within the same area. ✅ Key Characteristics: Feature Description Scope One LSDB per OSPF area Source Built from received LSAs Consistency All routers in an area have identical LSDBs Purpose Used as input for SPF algorithm to calculate best paths ⚙️ How the SPF Algorithm Works in OSPF OSPF uses Dijkstra’s Shortest Path First (SPF) algorithm to compute the shortest (lowest-cost)...