Abstract: Predicting address matches between a read type operation and a write type operation based on address representations allows for efficient RAW bypass. The spatial locality characteristic of code allows for address match prediction with address representations that are smaller than the actual addresses, thus allowing for faster comparison. Operations for performing the RAW bypass commence upon predicting an address match. While these operations are being performed, other operations for verifying the prediction are performed. If the address match prediction is verified, then the RAW bypass has been performed without hindrance. If the address match is proved incorrect, then the corresponding read type operation is reissued and/or re-executed.