Abstract: A computer-implemented method and related systems for reducing memory access stalls and memory allocation requests in data-intensive applications are provided. Invariants associated with execution paths that access data in a memory of the data-intensive application are identified. At least one field specialization technique using at least one speccode segment is then applied. The speccode segment exploits the identified invariants, thereby reducing at least one of memory stalls and memory allocation requests in a data-intensive application. The field specialization technique may include specialized software prefetching, a data distribution-based hash function, process to CPU binding, memory segment reuse, or memory layout optimization, or any combination thereof.
Type:
Grant
Filed:
June 22, 2018
Date of Patent:
July 23, 2024
Assignee:
DATAWARE VENTURES, LLC
Inventors:
Rui Zhang, Richard T. Snodgrass, Christian Convey
Abstract: A method to minimize cache pressure using slot pressure profile (SPP)-guided Algorithm includes generating an intermediate SPP from a binary code of a DBMS. The generated intermediate SPP is received and a reference SPP is output. The reference SPP has a value assigned for each cache slot in a cache, whereby a cache slot value is indicative of cache pressure. The reference SPP is accepted and a candidate slot list related to the cache is produced by sorting the values in the reference SPP. A slot number among the candidate slot list is decided and passed to find an open memory address mapping to the decided slot number for a bee code, the bee code being a specialized version of a DBMS function created and loaded into the cache at run-time. A query with the bee code is executed using the open memory address found.
Type:
Grant
Filed:
December 14, 2016
Date of Patent:
August 4, 2020
Assignees:
ARIZONA BOARD OF REGENTS ON BEHALF OF THE UNIVERSITY OF ARIZONA, DATAWARE VENTURES, LLC
Inventors:
Richard T. Snodgrass, Saumya K. Debray, Rui Zhang, Yang Liu
Abstract: Three extensions to the conventional field specialization process are disclosed. The first extension is cross-application value flows, where a value transfers out of one application and subsequently into another application. The second extension is an inter-application analysis. Static and dynamic analysis is performed by a Spiff Toolset not just on the source code of a single application, but also across the data read and written by that application. The third extension is invariant cross-application termination, verifying the possibility of an invariant originating in an application and terminating in a specialization opportunity in a separate application. An ecosystem specification is disclosed to enable such field specialization broadening.
Type:
Grant
Filed:
December 14, 2015
Date of Patent:
July 30, 2019
Assignees:
DATAWARE VENTURES, LLC, THE ARIZONA BOARD OF REGENTS ON BEHALF OF THE UNIVERSITY OF ARIZONA
Inventors:
Richard T. Snodgrass, Saumya K. Debray, Rui Zhang