💾 Simulator Memori

Visualisasi Hierarki Memori dan Teknik Akses

Kontrol Simulasi

Mode Akses

Memory Configuration

🏗️ Memory Hierarchy

CPU Registers

Size: 512 bytes Speed: 0.25 ns
R0: 0
R1: 0
R2: 0
R3: 0
R4: 0
R5: 0
R6: 0
R7: 0

L1 Cache

Size: 64 KB Speed: 0.5 ns
Hits: 0
Misses: 0
Hit Rate: 0%

L2 Cache

Size: 256 KB Speed: 2 ns
Hits: 0
Misses: 0
Hit Rate: 0%

Main Memory (RAM)

Size: 8 GB Speed: 10 ns
Stack
Heap
Data
Code

Secondary Storage (SSD)

Size: 512 GB Speed: 25,000 ns
Page Reads: 0
Page Writes: 0

🎯 Memory Access Simulation

CPU Request
→
L1 Cache
→
L2 Cache
→
Main Memory
→
Storage
Access Result: -
Access Time: -
Data Value: -

📊 Performance Metrics

Cache Performance

0%
0 ns
0

Access Patterns

0
0:0
0%

Bandwidth Utilization

0 MB/s
0%
0 GB/s

🗺️ Memory Mapping Techniques

Direct Mapping

Setiap blok memory hanya dapat ditempatkan di satu lokasi cache tertentu.

Block 0
Block 1
Block 2
Block 3
↓
Line 0
Line 1
Cache Line = Memory Block % Number of Cache Lines

Fully Associative Mapping

Setiap blok memory dapat ditempatkan di lokasi cache mana pun.

Block 0
Block 1
Block 2
Block 3
↓
Any Line
Any Line
Any Line

Set Associative Mapping

Cache dibagi menjadi set-set, setiap blok dapat ditempatkan di set tertentu.

Block 0
Block 1
Block 2
Block 3
↓
Set 0
Line 0
Line 1
Set 1
Line 2
Line 3
Set = Memory Block % Number of Sets

🎓 Konsep Hierarki Memori

Prinsip Lokalitas

  • Temporal Locality: Data yang baru diakses akan diakses lagi
  • Spatial Locality: Data di lokasi berdekatan akan diakses

Cache Organization

  • Block/Line: Unit transfer antara cache dan memory
  • Tag: Identifier untuk blok memory
  • Valid Bit: Menandakan data valid
  • Dirty Bit: Menandakan data telah dimodifikasi

Replacement Policies

  • LRU: Least Recently Used
  • FIFO: First In First Out
  • Random: Pemilihan acak

Write Policies

  • Write-Through: Langsung menulis ke memory
  • Write-Back: Menulis hanya ketika digantikan