IP Library Granted Patent US 7,568,076
Granted Patent B2
US 7,568,076 · App. 11/836,872 · Granted Jul 28, 2009

Variable store gather window

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,568,076
App. No.
11/836,872
Granted
Jul 28, 2009
Kind
B2
Abstract

A processor includes at least one instruction execution unit that executes store instructions to obtain store operations and a store queue coupled to the instruction execution unit. The store queue includes a queue entry in which the store queue gathers multiple store operations during a store gathering window to obtain a data portion of a write transaction directed to lower level memory. In addition, the store queue includes dispatch logic that varies a size of the store gathering window to optimize store performance for different store behaviors and workloads.

Claims (22)

1. A method of operating a processor, said method comprising:

at least one instruction execution unit executing store instructions to obtain store operations;

in a queue entry of a store queue coupled to said instruction execution unit, gathering multiple store operations during a store gathering window to obtain a data portion of a write transaction directed to lower level memory;

selecting a store gathering window duration for said queue entry;

maintaining a count of a number of consecutive clock cycles for which a store operation is not gathered in said queue entry;

comparing the count and said store gathering window duration and responsive thereto, generating a dispatch signal to cause dispatch of a write transaction from said queue entry; and

varying a duration of said store gathering window.

2. The method of claim 1 , wherein said duration of the store gathering window comprises a selected number of clock cycles.

3. The method of claim 1 , wherein:

said queue entry comprises a first queue entry;

said store gathering window is a first store gathering window;

said store queue includes a second queue entry; and

said method further comprises applying a second store gathering window of different duration to said second queue entry.

4. The method of claim 1 , wherein:

said store queue includes a plurality of queue entries including said queue entry; and

said method further comprising allocating said plurality of queue entries to store operations prior to said gathering.

5. The method of claim 1 , and further comprising gathering said multiple store operations at a cache memory in a cache hierarchy of the processor.

6. The method of claim 1 , wherein:

said queue entry comprises a first queue entry;

said store queue includes a second queue entry; and

said varying step includes decreasing a duration of the store gathering window applied to the first queue entry in response to the gathering a store operation in the second queue entry.

7. The method of claim 1 , wherein said varying step comprises increasing a duration of the store gathering window applied to the queue entry in response to gathering a store operation in the queue entry.

Assignments (2)
CHANGE OF NAME Recorded Dec 20, 2021
From: FACEBOOK, INC.
To: META PLATFORMS, INC.
Reel/Frame 058553/0802 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 4, 2012
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: FACEBOOK, INC.
Reel/Frame 027991/0416 →