Swapping Problems a Addresses different as swaps in and out Static relocation/dynamic relocation a Memory holes Memory compaction 口 Require cPu time a Move 4 byes in 20ns, then 5 sec to compact 1 GB a How much memory allocate for a program Programs tend to grow Both data segment(heap)and stackSwapping ◼ Problems ❑ Addresses different as swaps in and out ◼ Static relocation/dynamic relocation ❑ Memory holes ◼ Memory compaction ❑ Require CPU time ❑ Move 4 byes in 20ns, then 5 sec to compact 1 GB ❑ How much memory allocate for a program ◼ Programs tend to grow ◼ Both data segment (heap) and stack