DRAM

Definition:

• Has Capacitor and accessed through Transistor
• Can loose the power of its capaity over time, therefore need to be refreshed periodically → dynamic

Loading step:

• After Compilation Process, it is executable, it is then load by Loader into memory to be process(es) along with DLLs

Memory Map:

1. Stack:
   • Stack
   • Automatic storage for managing procedure called (e.g., local variables within a function)
   • Store:
     • Function calls (main, callees∂)
     • Local variables (Pointer)
   • grows downward
     • fp points at the start (larger address hex)
     • sp points to the top of stack (smaller address hex)
     • Push by ADDI sp, sp, -4 and SW x1, 0(sp)
     • Pop by LW x1, 0(sp) and ADDI sp, sp, 4
2. Heap:
   • Heap
   • Store dynamic data (create at runtime)
     • ex: malloc in C, new in Java
3. Global data:
   • Global variables
     • ex: static variables in C, constant arrays and string
     • Variables defined outside of any function
   • Gloabal pointer (GP) is used initialized to address allowing ±offsets into this segment
4. Text:
   • Store the content of programs (code and text, images,…)
   • Where PC will be taking instructions from
5. Reservered