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:
Aug. 15, 2017

Filed:

Aug. 27, 2015
Applicant:

Qualcomm Incorporated, San Diego, CA (US);

Inventors:

Dario Suarez Gracia, Palo Alto, CA (US);

Tushar Kumar, San Francisco, CA (US);

Aravind Natarajan, Sunnyvale, CA (US);

Ravish Hastantram, San Jose, CA (US);

Gheorghe Calin Cascaval, Palo Alto, CA (US);

Han Zhao, Santa Clara, CA (US);

Assignee:

QUALCOMM Incorporated, San Diego, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/46 (2006.01); G06F 15/173 (2006.01); G06F 1/00 (2006.01); G06F 9/48 (2006.01); G06F 9/50 (2006.01); G06F 12/0806 (2016.01); G06F 12/0862 (2016.01); G06F 12/12 (2016.01); G06F 11/34 (2006.01);
U.S. Cl.
CPC ...
G06F 9/48 (2013.01); G06F 9/4806 (2013.01); G06F 9/4831 (2013.01); G06F 9/4837 (2013.01); G06F 9/4843 (2013.01); G06F 9/4881 (2013.01); G06F 9/4893 (2013.01); G06F 9/50 (2013.01); G06F 9/5005 (2013.01); G06F 9/505 (2013.01); G06F 9/5011 (2013.01); G06F 9/5016 (2013.01); G06F 9/5022 (2013.01); G06F 9/5027 (2013.01); G06F 9/5033 (2013.01); G06F 9/5038 (2013.01); G06F 9/5044 (2013.01); G06F 9/5055 (2013.01); G06F 9/5083 (2013.01); G06F 9/5094 (2013.01); G06F 11/3419 (2013.01); G06F 11/3466 (2013.01); G06F 12/0806 (2013.01); G06F 12/0862 (2013.01); G06F 12/12 (2013.01); G06F 2212/62 (2013.01);
Abstract

Various embodiments include methods for data management in a computing device utilizing a plurality of processing units. Embodiment methods may include generating a data transfer heuristic model based on measurements from a plurality of sample data transfers between a plurality of data storage units. The generated data transfer heuristic model may be used to calculate data transfer costs for each of a plurality of tasks. The calculated data transfer costs may be used to schedule execution of the plurality of tasks in an execution order on selected ones of the plurality of processing units. The data transfer heuristic model may be updated based on measurements of data transfers occurring during the executions of the plurality of tasks (e.g., time, power consumption, etc.). Code executing on the processing units may indicate to a runtime when certain data blocks are no longer needed and thus may be evicted and/or pre-fetched for others.


Find Patent Forward Citations

Loading…