Dear all,

to start with, im not asking for a code...im just too lost and need someone to guide me.

can anybody help me think about implementing a hash table to store MEMORY addresses and times for stores, and to look up matching addresses and times in the hash table for loads.

well i wana try to build "memory model " (model it on a store and load instructions) using a hashtable , by the "time" i mean the cycle time

your help is HIGHLY appreciated just to clarify things well i need the hash table for the same reason cache implementation uses a hashtable.

memory implementation RESEMBLES that of the cache but its a bit less complicated.

i tried to look at cache implementation..they used hashtable for the cache organization

Within the cache, there are three basic TYPES of organization:

Direct Mapped
Fully Associative
Set Associative


im going to USE the set assocative one...
so basically i want a general pseudocode for the memory implementation (for any kind of cpu)..i'll look for the details later cz i think i'll be WORKIN for the x86.