Look ahead LRU array update scheme to minimize clobber in sequentially accessed memory

A machine-readable medium having stored thereon a plurality of executable instructions to perform a method comprising:

• selecting a victim set from a sequentially accessed memory;
• selecting a victim way for said selected victim set;
• reading a next way pointer from a trace line of a trace currently stored in said selected victim way, if said selected victim way has said next way pointer;
• writing a next line of said new trace into said selected victim way over said trace line of said currently stored trace;
• and
• forcing a replacement algorithm of a next victim set to select a next victim way for the next victim set using said next way pointer, if said trace line of said currently stored trace is not an active trace tail line.

A method comprising:

• selecting a victim set from a sequentially accessed memory;
• selecting a victim way for said selected victim set;
• reading a next way pointer from a trace line of a trace currently stored in said selected victim way, if said selected victim way has said next way pointer;
• writing a next line of said new trace into said selected victim way over said trace line of said currently stored trace;
• and
• storing said next way pointer, if said next line of said new trace is not a last line of said new trace.

A machine-readable medium having stored thereon a plurality of executable instructions to perform a method comprising:

• selecting a victim set from a sequentially accessed memory;
• selecting a victim way for said selected victim set;
• reading a next way pointer from a trace line of a trace currently stored in said selected victim way, if said selected victim way has said next way pointer;
• writing a next line of said new trace into said selected victim way over said trace line of said currently stored trace;
• and
• storing said next way pointer, if said next line of said new trace is not a last line of said new trace.

A processor comprising:

• an execution component;
• a front end component coupled to said execution component, said front end component to provide instructions to said execution component;
• and
• a retirement component coupled to said execution component to receive results from the execution of said provided instructions, said front end component including a machine-readable medium having stored thereon a plurality of executable instructions to perform a method comprising:
• selecting a victim set from a sequentially accessed memory;
• selecting a victim way for said selected victim set;
• reading a next way pointer from a trace line of a trace currently stored in said selected victim way, if said selected victim way has said next way pointer;
• writing a next line of said new trace into said selected victim way over said trace line of said currently stored trace;
• and
• forcing a replacement algorithm of a next victim set to select a next victim way for the next victim set using said next way pointer, if said trace line of said currently stored trace is not an active trace tail line.

A computer system comprising:

• a memory to provide program instructions;
• and
• a processor coupled to said memory to receive and execute said program instructions, said processor including:
• an execution component;
• a front end component coupled to said execution component, said front end component to provide instructions to said execution component;
• and
• a retirement component coupled to said execution component to receive results from the executing of said provided instructions, said front end component including a machine-readable medium having stored thereon a plurality of executable instructions to perform a method including:
• selecting a victim set from a sequentially accessed memory;
• selecting a victim way for said selected victim set;
• reading a next way pointer from a trace line of a trace currently stored in said selected victim way, if said selected victim way has said next way pointer;
• writing a next line of said new trace into said selected victim way over said trace line of said currently stored trace;
• and
• forcing a replacement algorithm of a next victim set to select a next victim way for the next victim set using said next way pointer, if said trace line of said currently stored trace is not an active trace tail line.