Patents by Inventor Sreenivas Makineedi

Sreenivas Makineedi 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).

  • Publication number: 20170161168
    Abstract: A system and method tests computer software using tracking bits in branch instructions to track portions of the software that have been tested. The tracking bits are bits of a branch programming instruction and may be repurposed hint bits used in the prior art to control pre-fetch of instructions. A branch tracking unit sets bits in a branch instruction of an application or program being tested. The branch tracing unit sets a first bit if a branch is taken and sets a second tracking bit if the branch is not taken. The modified program instructions can be analyzed after running the test inputs to determine if any branches in the software have not been exercised by the test inputs.
    Type: Application
    Filed: March 3, 2016
    Publication date: June 8, 2017
    Inventors: Gaurav Batra, Demetrice Browder, Douglas J. Griffith, Sreenivas Makineedi
  • Publication number: 20170161072
    Abstract: A system and method tests computer software using tracking bits in branch instructions to track portions of the software that have been tested. The tracking bits are bits of a branch programming instruction and may be repurposed hint bits used in the prior art to control pre-fetch of instructions. A branch tracking unit sets bits in a branch instruction of an application or program being tested. The branch tracing unit sets a first bit if a branch is taken and sets a second tracking bit if the branch is not taken. The modified program instructions can be analyzed after running the test inputs to determine if any branches in the software have not been exercised by the test inputs.
    Type: Application
    Filed: December 7, 2015
    Publication date: June 8, 2017
    Inventors: Gaurav Batra, Demetrice Browder, Douglas J. Griffith, Sreenivas Makineedi
  • Patent number: 9483184
    Abstract: A system and method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Grant
    Filed: December 19, 2014
    Date of Patent: November 1, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Patent number: 9461715
    Abstract: A server and rack system includes at least one server rack; multiple server slots within the rack; multiple near field communication (NFC) tags; a server located within one of the server slots; an NFC reader within and powered by the server; and an entity that needs to receive locations of servers within racks of the system. Each of the multiple NFC tags is positioned on the rack so as to individually correspond, on a one-to-one basis, with each of the multiple server slots, and each of the NFC tags is programmed with an identifier of the specific rack and slot with which it corresponds, and the NFC reader is positioned such that, when power is supplied to the NFC reader by the server, the NFC reader will read the identifier that corresponds to the slot the server is located within and automatically communicate that identifier to the entity.
    Type: Grant
    Filed: January 4, 2016
    Date of Patent: October 4, 2016
    Assignee: International Business Machines Corporation
    Inventors: Anand T. Desai, Douglas Griffith, Sreenivas Makineedi, Srinivasa R. Muppala
  • Publication number: 20160267025
    Abstract: A method for privilege based memory pinning is provided. The method includes receiving a request to pin an amount of address space memory from a process executing on an operating system. The operating system includes a configurable mode of operation. In mandatory mode, the operating system executes the request to pin address space memory based on the role hierarchy-based privilege level of the requestor process. When the requested amount is greater than the operating system's amount of memory that can be used to pin memory, the operating system fails the request. However, when the operating can satisfy the request from processes having a lower privilege level relative to the requestor process, memory is unpinned from one or more of these processes.
    Type: Application
    Filed: September 21, 2015
    Publication date: September 15, 2016
    Inventors: Sreenivas Makineedi, Srinivasa Raghavan M. Parthasarathi
  • Publication number: 20160266833
    Abstract: A method for privilege based memory pinning is provided. The method includes receiving a request to pin an amount of address space memory from a process executing on an operating system. The operating system includes a configurable mode of operation. In mandatory mode, the operating system executes the request to pin address space memory based on the role hierarchy-based privilege level of the requestor process. When the requested amount is greater than the operating system's amount of memory that can be used to pin memory, the operating system fails the request. However, when the operating can satisfy the request from processes having a lower privilege level relative to the requestor process, memory is unpinned from one or more of these processes.
    Type: Application
    Filed: March 11, 2015
    Publication date: September 15, 2016
    Inventors: Sreenivas Makineedi, Srinivasa Raghavan M. Parthasarathi
  • Publication number: 20160179400
    Abstract: A method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Application
    Filed: June 10, 2015
    Publication date: June 23, 2016
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Publication number: 20160179396
    Abstract: A system and method for setting a compression ratio for utilizing a compressed memory pool (which is backed by pinned memory) by a virtual memory manager (VMM). Compression of pages of corresponding segments can be tracked as part of a VMM paging algorithm that compresses pages to store in a compressed memory pool. A segment having pages with an average compression ratio below a threshold is identified. The identified segment pages are prevented from utilizing the compressed memory pool resulting in optimizing the use of the compressed memory pool.
    Type: Application
    Filed: December 19, 2014
    Publication date: June 23, 2016
    Inventors: Gaurav Batra, Sreenivas Makineedi
  • Publication number: 20110153978
    Abstract: A virtual memory method for allocating physical memory space required by an application by tracking the page space used in each of a sequence of invocations by an application requesting memory space; keeping count of the number of said invocations; and determining the average page space used for each of said invocations from the count and previous average. Then, this average page space is recorded as a predicted allocation for the next invocation. This recorded average space is used for the next invocation. If there is any additional page space required by said next invocation, this additional page space may be accessed through any conventional default page space allocation.
    Type: Application
    Filed: December 21, 2009
    Publication date: June 23, 2011
    Applicant: International Business Machines Corporation
    Inventors: Glen Edmond Chalemin, Sreenivas Makineedi, Vandana Mallempati
  • Patent number: 7805471
    Abstract: The present invention provides a computer implemented method for truncating a file in a file system. The file system receives a request to truncate a file to a target size, the file having a first inode. The file system creates a second inode to a transient directory, wherein the second inode holds a plurality of in-progress entries. The file system sets a target size in the first inode. The file system writes a truncate entry to a journal, the truncate entry comprising a predetermined size. The file system truncates the file by up to the predetermined size. The file system determines that the file is above the target size. Responsive to a determination that the file is above the target size, the file system repeats the truncating step and the determining step. Responsive to a determination that the file is not above the target size, the file system applies the in-progress entries from the transient directory.
    Type: Grant
    Filed: January 14, 2008
    Date of Patent: September 28, 2010
    Assignee: International Business Machines, Corporation
    Inventors: Shashidhar Bomma, Joon Chang, Ramesh Veeramalla, Sreenivas Makineedi
  • Publication number: 20090182792
    Abstract: The present invention provides a computer implemented method for truncating a file in a file system. The file system receives a request to truncate a file to a target size, the file having a first inode. The file system creates a second inode to a transient directory, wherein the second inode holds a plurality of in-progress entries. The file system sets a target size in the first inode. The file system writes a truncate entry to a journal, the truncate entry comprising a predetermined size. The file system truncates the file by up to the predetermined size. The file system determines that the file is above the target size. Responsive to a determination that the file is above the target size, the file system repeats the truncating step and the determining step. Responsive to a determination that the file is not above the target size, the file system applies the in-progress entries from the transient directory.
    Type: Application
    Filed: January 14, 2008
    Publication date: July 16, 2009
    Inventors: Shashidhar Bomma, Joon Chang, Ramesh Veeramalla, Sreenivas Makineedi