Register renaming: Foundations — Hinglish deep dive

5.3.4 · D1 · Hardware › Advanced Microarchitecture › Register renaming

Is page pe kuch bhi assume nahi kiya gaya. Parent note Register renaming padhne se pehle, aapko clearly samajhna hoga ki register kya hota hai, "dependency" asal mein kya hai, aur uske formulas mein har arrow aur bracket ka kya matlab hai. Hum har piece ko build karenge, usse ek picture se anchor karenge, aur tabhi use karenge.

1. Register kya hota hai?

Socho ek row of labelled cups. Har cup exactly ek value hold karta hai. Processor sirf unhi values pe arithmetic kar sakta hai jo cups mein baithi hain — un values pe nahi jo abhi bhi main memory mein hain.

2. Architectural vs physical registers

Parent note registers ko lamaat do kinds mein split karta rehta hai. Yeh split is topic ka poora dil hai, isliye hum dono ko zero se define karte hain.

Notation $R_{a r c h}$ ka matlab sirf hai "koi architectural register", aur $R_{p h y s}$ ka matlab hai "koi physical register". Subscript ek label on the label hai jo batata hai ki aap kis world mein hain: visible naming world, ya hidden storage world.

3. Arrow padhna: `→` (the "points to" relation)

Parent note aisi cheezein likhta hai jaise $RAT [R_{1}] \to P_{10}$ . Ek bhi formula padhne se pehle, aapko pata hona chahiye ki yahan us arrow ka kya matlab hai.

Toh $R_{1} \to P_{10}$ ko out loud padhte hain: "naam R1 abhi physical box P10 ki taraf point kar raha hai; R1 ki value chahiye toh P10 ke andar dekho."

4. Dependency kya hoti hai?

Instructions ek sequence banati hain. Kabhi-kabhi baad ki instruction ko pehli ka wait karna padta hi hai; kabhi-kabhi yeh sirf aisa lagta hai. Parent note inhe RAW, WAR, WAW kehta hai. Aao har naam ka matlab samjhein.

Letters Read aur Write ke liye hain, jo same register pe time order mein apply hote hain. Naam ko "X-After-Y" ki tarah padhein:

Yeh picture difference clearly dikhati hai:

5. `op` aur instruction shape `Rdest ← Rsrc1 op Rsrc2`

Parent note jo har arithmetic instruction rename karta hai, uski yeh shape hoti hai. Har symbol decode karo:

Toh ADD R1, R2, R3 ka matlab hai $R_{1} \leftarrow R_{2} + R_{3}$ : R2 aur R3 padhlo, unhe add karo, R1 mein store karo.

6. Bookkeeping structures: RAT, Free list, ROB

Ye teen har formula mein aate hain. Ye sirf teen simple containers hain.

Square-bracket notation $RAT [R_{1}]$ sirf table lookup hai — jaise ek spreadsheet ka cell "R1" read karna. Agar $RAT [R_{1}] = P_{10}$ , toh R1 abhi P10 mein rehta hai.

7. Sizing formula mein `≥`

Parent note ke end mein $N_{p h y s} \geq N_{a r c h} + N_{R O B}$ aata hai. Decode karo:

Prerequisite map

Ek arrow ke left mein jo cheez hai, woh aapko pehle se picture mein honi chahiye, tab hi uske right wali cheez samajh aayegi. Renaming (bottom right) in sab ke upar baitta hai.

Connections

Parent: Register renaming — yeh foundations wahan apply karo.
Renaming exist karta hai Out-of-Order Execution ko feed karne aur Instruction-Level Parallelism (ILP) badhane ke liye.
Mapping mechanism Tomasulo's Algorithm ka modern descendant hai; purane Scoreboarding se contrast karo.
Commit/undo machinery Reorder Buffer (ROB) mein rehti hai.
Wide fetch jisme bahut saare free boxes chahiye: Superscalar Execution. Branches ke paas speculative renaming: Branch Prediction. Memory-side hazards: Memory Disambiguation.

Equipment checklist

A register is a

CPU ke andar ek tiny fast storage box jo exactly ek number hold karti hai.

The difference between an architectural and a physical register is

architectural = ek naam jo program bolne ki permission rakhta hai (fixed, kam); physical = silicon mein ek actual storage box (hidden, zyada).

The arrow in

R_{1} \to P_{10}

means

"naam R1 abhi box P10 ki taraf point kar raha hai" — ek lookup/pointer, equality NAHI.

RAW stands for and means

Read After Write — baad ki instruction woh value read karti hai jo pehli ne write ki thi; ek TRUE dependency.

WAR and WAW are called false dependencies because

ye sirf same naam pe clash hain; baad wale writer ko alag box de do toh ye khatam ho jaate hain, kyunki koi real data flow nahi hoti.

RAT [R_{2}]

means

alias table mein R2 ki row look up karo aur padhlo ki woh abhi kaunsi physical box ki taraf point kar rahi hai.

FreeList.pop() does

pile se ek currently-empty physical box uthata hai taaki use nayi destination ko assign kiya ja sake.

The ROB records the old physical mapping so that

agar exception instruction ko cancel kare toh pointer restore kiya ja sake, aur yeh bhi pata chale ki commit hone pe kaunsi box free karni hai.

In Rdest ← Rsrc1 op Rsrc2, the ← means

"ki value mein jaata hai" — right side compute karo, phir destination mein store karo.

N_{p h y s} \geq N_{a r c h} + N_{R O B}

says

aapko kam se kam ek box har committed naam ke liye aur ek har in-flight instruction ke liye chahiye, warna decode stall ho jaata hai (register pressure).