The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Mar. 16, 2021

Filed:

Jan. 07, 2020
Applicant:

Microsoft Technology Licensing, Llc, Redmond, WA (US);

Inventors:

Jason Matthew Gould, Woodinville, WA (US);

Ivan Nevraev, Redmond, WA (US);

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 12/0802 (2016.01); G06F 12/06 (2006.01); G06T 1/60 (2006.01); G06F 9/50 (2006.01); G06F 12/0895 (2016.01); G06F 12/0862 (2016.01); G06T 15/00 (2011.01); G06F 12/0875 (2016.01); G06F 12/02 (2006.01);
U.S. Cl.
CPC ...
G06F 12/0646 (2013.01); G06F 9/5016 (2013.01); G06F 12/0802 (2013.01); G06F 12/0862 (2013.01); G06F 12/0895 (2013.01); G06T 1/60 (2013.01); G06T 15/005 (2013.01); G06F 12/023 (2013.01); G06F 12/0875 (2013.01); G06F 2212/1048 (2013.01); G06F 2212/302 (2013.01); G06F 2212/451 (2013.01); G06F 2212/455 (2013.01); G06F 2212/604 (2013.01); G06F 2212/608 (2013.01);
Abstract

Enhanced data buffer control in data systems is presented herein. In one example, a method includes establishing a pool of available memory pages tracked by memory pointers for use in a data structure, and processing requests for storing data to identify ones of the requests indicating data sizes that exceed a capacity of current pages included in the data structure. The method includes providing first pointers indicating start locations in the data structure to begin writing associated data, count information indicating quantities of the associated data able to be written in the current pages, and second pointers indicating at least one additional page in the data structure into which the associated data can be spanned from the current pages, where the at least one additional page is allocated from the pool of available memory pages in accordance with a fullness threshold for the data structure.


Find Patent Forward Citations

Loading…