Assembly Programming

1. COMPUTER ORGANIZATION
& ASSEMBLY LANGUAGE
LECTURE # 2 WEEK 11 THEORY
BY MUHAMMAD JAFER
1

2. FULLY ASSOCIATIVE MAPING
• Placement is done on any where
• Sequential Searching Expensive
• Associate (Content Address) Memory
• Searching Parallel (Associatively)
• Validity Bit
2

3. MMU INTERPRET FULLY ASSOCIATIVE
3

4. MMU INTERPRET FULLY ASSOCIATIVE
4

5. SET ASSOCIATIVE MAPING
• Placement is done on any where
• Each Memory Belong to certain Set
• Associate (Content Address) Memory
• Searching Parallel (Associatively)
5

6. MMU INTERPRET SET ASSOCIATIVE
6

7. MMU INTERPRET SET ASSOCIATIVE
7

8. 8

9. REPLACEMENT TECHNIQUES
• RANDOM SELECTION
• FIRST IN FIRST OUT (FIFO)
• LEAST RECENTLY USED
• Cache Controller Circuit
• Hit Counter
9

10. CHAPTER REVIEW
• Fundamentals of Computer Organization and
Architecture by Mostafa Abd-Al-Barr & Hesham
AlRewini
• Chapter # 6
• Basic Concepts
• Cache Memory
10