Browse Prior Art Database

Method for dynamic management of lazy and eager memory buffers

IP.com Disclosure Number: IPCOM000109216D
Publication Date: 2005-Mar-23
Document File: 3 page(s) / 40K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a method for dynamic management of lazy and eager memory buffers. Benefits include improved functionality and improved performance.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 54% of the total text.

Method for dynamic management of lazy and eager memory buffers

Disclosed is a method for dynamic management of lazy and eager memory buffers. Benefits include improved functionality and improved performance.

Background

      A memory hierarchy can contain a collection of memory buffers for handling data movement within the design. Conventional buffer pools are typically all eager or all lazy. Among other reasons, this designation is made to simplify the allocation process.

      Lazy buffers contain valid data that can be moved to another level of the memory hierarchy when it meets readiness constraints. For example, a lazy buffer is not ready if it is being filled. The key feature of a lazy buffer is that it functions like a small cache because it can be used to satisfy loads and absorb stores. A buffer can be quickly deallocated and used for new operations if the pool of available buffers becomes too small.

      Eager buffers contain valid data. They are short-term buffers that provide no advantage by being allocated for a long time. Examples of eager buffer traffic include noncacheable transactions, first level cache evictions, and high level cache evictions.

General description

      The disclosed method is dynamic management of lazy and eager memory buffers. The method manages limited buffer resources for allocation.

      The key elements of the disclosed method include:

•     Allocation/replacement of eager and lazy buffers in a single managed pool

•     Round robin trimmer to feed an invalid pool

•     Round robin replacement that can skip not-ready entries

•     Invalid buffers

Advantages

      The disclosed method provides advantages, including:
•             Improved functionality due to providing dynamic management of lazy and eager memory buffers
•             Improved functionality due to providing the invalid buffer type, which is then immediately available for allocation

•     Improved performance due to using both lazy and eager buffers

Detailed description

             The disclosed method includes the dynamic management of lazy and eager memory buffers. The method adds a third type of buffer, invalid buffers. They do not contain data and are immediately available for a...