Patents by Inventor Balaji Palanisamy

Balaji Palanisamy 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: 8972986
    Abstract: Computing resource allocation for map-reduce job execution comprises determining the volume of input data to the map-phase and the reduce-phase of a map-reduce job prior to execution. Based on said determination, data blocks and virtual machines (VMs) are selectively placed for locality aware map-reduce job execution on a cluster of computing nodes in a network. Selectively placing data blocks and VMs comprises integrally placing the data and the VMs at selected nodes to lower data transfer network hops for a map-phase and a shuffle-phase of the map-reduce job upon execution by the VMs.
    Type: Grant
    Filed: May 25, 2012
    Date of Patent: March 3, 2015
    Assignee: International Business Machines Corporation
    Inventors: Balaji Palanisamy, Aameek Singh
  • Publication number: 20130318525
    Abstract: Computing resource allocation for map-reduce job execution comprises determining the volume of input data to the map-phase and the reduce-phase of a map-reduce job prior to execution. Based on said determination, data blocks and virtual machines (VMs) are selectively placed for locality aware map-reduce job execution on a cluster of computing nodes in a network. Selectively placing data blocks and VMs comprises integrally placing the data and the VMs at selected nodes to lower data transfer network hops for a map-phase and a shuffle-phase of the map-reduce job upon execution by the VMs.
    Type: Application
    Filed: May 25, 2012
    Publication date: November 28, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Balaji Palanisamy, Aameek Singh
  • Publication number: 20130290940
    Abstract: Provided is a method of symbol-based merging of computer programs. A source program file and a destination program file, wherein the source file is a later generated version of the destination program file, is parsed to identify symbols present in the source program file and the destination program file. A mapping of the symbols present in the source program file and the destination program file is generated. From the mapping, symbols that were modified, added or deleted in the source program file since it was generated from the destination program file are identified. The identified symbols are merged.
    Type: Application
    Filed: June 29, 2012
    Publication date: October 31, 2013
    Inventors: Balaji Palanisamy, Satheesh Kumar Murugan