- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hello sir/madam,
Am studying "B.Tech Information Technology", Am in a hurry of selecting my final year projects.
An idea came to my mind that performing cache memory in a circular queueing method, means not the last accessed data in cache but last 10 fetched data in circular queue. so that every one wil access last 10 fetched data in cache.
pls tell me whether its possible or not and teach me how to access cache memory.
Am studying "B.Tech Information Technology", Am in a hurry of selecting my final year projects.
An idea came to my mind that performing cache memory in a circular queueing method, means not the last accessed data in cache but last 10 fetched data in circular queue. so that every one wil access last 10 fetched data in cache.
pls tell me whether its possible or not and teach me how to access cache memory.
Link Copied
1 Reply
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Your description seems reminiscent of the ring cache implemented in Intel 6 and 8 core CPUs (Westmere, Nehalem-EX). From the software point of view, this doesn't change means of access, except for increased importance of thread affinity.

Reply
Topic Options
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page