Keshlash assotsiativligi arxitekturasi uchun quyidagi asosiy variantlar mavjud: - To’g’rida-to’g’ri tasvirlangan kesh – TSQning ma’lum bir sohasi uchun keshning aniqlangan ma’lim bir sohasi javobgar
- To’liq assiotsiativ kesh – keshning ixtiyoriy sohasi TSQning ixtiyoriy sohasi bilan bog’lanishi mumkin
- Aralash kesh (assotsiativ-to’plami)
- 1. A switch algorithm based on the first use(LRU - Least Recently Used )
- 2. FIFO principle on running algorithm ( first from , first goes - First In First Out )
- 3. Eng kam used lines exchange algorithms (LFU - Least Frequently Used )
- 4. Replacement for lines optional selection .
- 1. Eng oldin foydalanishga asoslangan almashtirish algoritmi (LRU – Least Recently Used)
- 2. FIFO tamoili bo’yicha ishlaydigan algoritm (birinchi kelgan, birinchi ketadi – First In First Out)
- 3. Eng kam ishlatiladigan satrlarni almashtirish algoritmi (LFU – Least Frequently Used)
- 4. Almashtirish uchun satrlarni ixtiyoriy tanlash.
Controllers information when cache- to memory places ? Controllers information when cache- to memory places ?
- On demand on demand . _
- Speculative download ( speculative load ). Algorithm data in the cache to him real appeal without doing much before placement meaning holds . In cache controllers close in the future to the processor which memory places necessary showing a how many algorithms available .
Kontroller ma’lumotlarni qachon kesh-xotiraga joylaydi? Kontroller ma’lumotlarni qachon kesh-xotiraga joylaydi?
- Talab bo’yicha yuklash (on demand).
- Spekulyativ yuklash (speculative load). Algoritm ma’lumotni kesh xotirasida unga haqiqiy murojaat qilishdan ancha oldin joylashtirishni nazarda tutadi. Kesh kontrollerida yaqin kelajakda protsessorga qaysi xotira joylari kerakligini ko’rsatadigan bir nechta algoritmlar mavjud.
Do'stlaringiz bilan baham: |
