Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Q: why are we using 2 rb + 4 lru bits to implement pseudo LRU algorithum? #129

Open
Nameer-Iqbal-Ansari opened this issue Jun 5, 2023 · 2 comments

Comments

@Nameer-Iqbal-Ansari
Copy link

In the pseudo LRU algorithm we can maintain a track for lru way with the 3 bits tree based pseudo lru algorithm, but we are using 4 bits for lru and 2 rb bits as to start searching for the possible replacement way.

@fei-g
Copy link
Contributor

fei-g commented Jun 8, 2023

There are different implementation choices when doing a pseudo LRU. I agree that our current implementation is not the most resource-efficient one in terms of the number of bits used.

Students have characterized different cache replacement policies in OpenPiton as course projects. But I don't remember if anyone compared the one-bit-per-way PLRU with the tree-based PLRU. You are welcome to implement and characterize that.

@Nameer-Iqbal-Ansari
Copy link
Author

HI fei-g,
Yes, Since me and my group members are doing our graduation Final year project on OpenPiton we found out about this, So yes we can work on this specific.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants