Patents by Inventor Rudrapatna K. Shyamasundar

Rudrapatna K. Shyamasundar 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: 8959525
    Abstract: Embodiments of the invention provide efficient scheduling of parallel computations for higher productivity and performance. Embodiments of the invention provide various methods effective for affinity driven and distributed scheduling of multi-place parallel computations with physical deadlock freedom.
    Type: Grant
    Filed: October 28, 2009
    Date of Patent: February 17, 2015
    Assignee: International Business Machines Corporation
    Inventors: Shivali Agarwal, Ankur Narang, Rudrapatna K. Shyamasundar
  • Patent number: 8347061
    Abstract: Techniques for providing safe user-managed memory are provided. The techniques include performing memory allocation in constant time, performing memory de-allocation in constant time, performing memory access overhead for safety checking in constant time, and using the memory allocation, memory de-allocation and memory access overhead to protect at least one memory access, user-specified allocation and de-allocation with at least one exception for said user-managed memory.
    Type: Grant
    Filed: April 29, 2008
    Date of Patent: January 1, 2013
    Assignee: International Business Machines Corporation
    Inventors: Pradeep Varma, Rudrapatna K. Shyamasundar
  • Patent number: 8156385
    Abstract: Embodiments of the invention provide a table-free technique for detecting all temporal and spatial memory access errors in programs supporting general pointers. Embodiments of the invention provide such error checking using constant-time operations. Embodiments of the invention rely on fat pointers, whose size is contained within standard scalar sizes (up to two words) so that atomic hardware support for operations upon the pointers is obtained along with meaningful casts in-between pointers and other scalars. Optimized compilation of code becomes possible since the scalarized-for-free encoded pointers get register allocated and manipulated. Backward compatibility is enabled by the scalar pointer sizes, with automatic support provided for encoding and decoding of fat pointers in place for interaction with unprotected code.
    Type: Grant
    Filed: October 28, 2009
    Date of Patent: April 10, 2012
    Assignee: International Business Machines Corporation
    Inventors: Pradeep Varma, Rudrapatna K. Shyamasundar, Harshit J. Shah
  • Publication number: 20110099553
    Abstract: Embodiments of the invention provide efficient scheduling of parallel computations for higher productivity and performance. Embodiments of the invention provide various methods effective for affinity driven and distributed scheduling of multi-place parallel computations with physical deadlock freedom.
    Type: Application
    Filed: October 28, 2009
    Publication date: April 28, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Shivali Agarwal, Ankur Narang, Rudrapatna K. Shyamasundar
  • Publication number: 20110099429
    Abstract: Embodiments of the invention provide a table-free technique for detecting all temporal and spatial memory access errors in programs supporting general pointers. Embodiments of the invention provide such error checking using constant-time operations. Embodiments of the invention rely on fat pointers, whose size is contained within standard scalar sizes (up to two words) so that atomic hardware support for operations upon the pointers is obtained along with meaningful casts in-between pointers and other scalars. Optimized compilation of code becomes possible since the scalarized-for-free encoded pointers get register allocated and manipulated. Backward compatibility is enabled by the scalar pointer sizes, with automatic support provided for encoding and decoding of fat pointers in place for interaction with unprotected code.
    Type: Application
    Filed: October 28, 2009
    Publication date: April 28, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Pradeep Varma, Rudrapatna K. Shyamasundar, Harshit J. Shah
  • Publication number: 20090271763
    Abstract: Techniques for providing safe user-managed memory are provided The techniques include performing memory allocation in constant time, performing memory de-allocation in constant time, performing memory access overhead for safety checking in constant time, and using the memory allocation, memory de-allocation and memory access overhead to protect at least one memory access, user-specified allocation and de-allocation with at least one exception for said user-managed memory.
    Type: Application
    Filed: April 29, 2008
    Publication date: October 29, 2009
    Applicant: International Business Machines Corporation
    Inventors: Pradeep Varma, Rudrapatna K. Shyamasundar