Patents by Inventor Debashis Ganguly

Debashis Ganguly has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11893266
    Abstract: A method of managing data during execution of an application for use in a system that includes a host memory, a near memory, and a near device associated with the near memory. The application uses a working set of data that is distributed between the far memory and the near memory. The method includes counting a number of times that the near device accesses a unit of the working set of data from the far memory, determining whether the number of times exceeds a dynamically changing access counter threshold, wherein the dynamically changing access counter threshold is calculated dynamically based on a static threshold that is set for the system, and responsive to determining that the number of times exceeds the dynamically changing access counter threshold, migrating the unit of data from the far memory to the near memory.
    Type: Grant
    Filed: April 17, 2020
    Date of Patent: February 6, 2024
    Assignee: University of Pittsburgh—Of the Commonwealth System of Higher Education
    Inventors: Debashis Ganguly, Rami G. Melhem, Ziyu Zhang, Jun Yang
  • Publication number: 20220214825
    Abstract: A method of managing data during execution of an application for use in a system that includes a host memory, a near memory, and a near device associated with the near memory. The application uses a working set of data that is distributed between the far memory and the near memory. The method includes counting a number of times that the near device accesses a unit of the working set of data from the far memory, determining whether the number of times exceeds a dynamically changing access counter threshold, wherein the dynamically changing access counter threshold is calculated dynamically based on a static threshold that is set for the system, and responsive to determining that the number of times exceeds the dynamically changing access counter threshold, migrating the unit of data from the far memory to the near memory.
    Type: Application
    Filed: April 17, 2020
    Publication date: July 7, 2022
    Applicant: UNIVERSITY OF PITTSBURGH-OF THE COMMONWEALTH SYSTEM OF HIGHER EDUCATION
    Inventors: Debashis Ganguly, Rami G. Melhem, Ziyu Zhang, Jun Yang
  • Publication number: 20220197811
    Abstract: A data management method wherein a working set is distributed between near and far memories includes migrating first data from the far to the near memory according to a prefetcher algorithm. The first data (a subset of the working set) is maintained in the near memory in data structures according to predetermined semantics of the prefetcher that dictate that certain of the first data is prefetched when a first function evaluates as true. The method further includes detecting that the near memory has reached capacity, and in response, adaptively migrating a portion of the first data out of the near and into the far memory according to an eviction algorithm that is based on the set of prefetcher semantics such that certain of the portion of the first data is evicted when a second function evaluates as true, wherein the second function equals the inverse of the first function.
    Type: Application
    Filed: April 17, 2020
    Publication date: June 23, 2022
    Applicant: UNIVERSITY OF PITTSBURGH-OF THE COMMONWEALTH SYSTEM OF HIGHER EDUCATION
    Inventors: Debashis Ganguly, Rami G. Melhem, Ziyu Zhang, Jun Yang