Patents by Inventor Robert S. Germain

Robert S. Germain 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: 10152337
    Abstract: Embodiments relate to data shuffling by logically rotating processing nodes. The nodes are logically arranged in a two or three dimensional matrix. Every time two of the nodes in adjacent rows of the matrix are aligned, adjacent nodes exchange data. The positional alignment is a logical alignment of the nodes. The nodes are logically arranged and rotated, and data is exchanged in response to the logical rotation.
    Type: Grant
    Filed: August 12, 2016
    Date of Patent: December 11, 2018
    Assignee: International Business Machines Corporation
    Inventors: Ronald J. Barber, Robert S. Germain, Guy M. Lohman, Rene Mueller, Ippokratis Pandis, Vijayshankar Raman
  • Publication number: 20160350142
    Abstract: Embodiments relate to data shuffling by logically rotating processing nodes. The nodes are logically arranged in a two or three dimensional matrix. Every time two of the nodes in adjacent rows of the matrix are aligned, adjacent nodes exchange data. The positional alignment is a logical alignment of the nodes. The nodes are logically arranged and rotated, and data is exchanged in response to the logical rotation.
    Type: Application
    Filed: August 12, 2016
    Publication date: December 1, 2016
    Applicant: International Business Machines Corporation
    Inventors: Ronald J. Barber, Robert S. Germain, Guy M. Lohman, Rene Mueller, Ippokratis Pandis, Vijayshankar Raman
  • Patent number: 9483311
    Abstract: Embodiments relate to data shuffling by logically rotating processing nodes. The nodes are logically arranged in a two or three dimensional matrix. Every time two of the nodes in adjacent rows of the matrix are positionally aligned, these adjacent nodes exchange data. The positional alignment is a logical alignment of the nodes. The nodes are logically arranged and rotated, and data is exchanged in response to the logical rotation.
    Type: Grant
    Filed: September 15, 2014
    Date of Patent: November 1, 2016
    Assignee: International Business Machines Corporation
    Inventors: Ronald J. Barber, Robert S. Germain, Guy M. Lohman, Rene Mueller, Ippokratis Pandis, Vijayshankar Raman
  • Publication number: 20160077878
    Abstract: Embodiments relate to data shuffling by logically rotating processing nodes. The nodes are logically arranged in a two or three dimensional matrix. Every time two of the nodes in adjacent rows of the matrix are positionally aligned, these adjacent nodes exchange data. The positional alignment is a logical alignment of the nodes. The nodes are logically arranged and rotated, and data is exchanged in response to the logical rotation.
    Type: Application
    Filed: September 15, 2014
    Publication date: March 17, 2016
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORTATION
    Inventors: Ronald J. Barber, Robert S. Germain, Guy M. Lohman, Rene Mueller, Ippokratis Pandis, Vijayshankar Raman
  • Patent number: 8560277
    Abstract: Techniques are disclosed for creating a load balanced spatial partitioning of a structured, diffusing system of particles. An exemplary method includes steps of determining a subset of a set of nodes within a given portion of the coordinate system intersected by a surface defined by points having a given distance from the surface of the given node; and mirroring the determined subset to at least another portion of the coordinate system.
    Type: Grant
    Filed: October 3, 2008
    Date of Patent: October 15, 2013
    Assignee: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubskiy
  • Patent number: 8549058
    Abstract: An information processing system for performing a transform of a multidimensional matrix in a distributed memory network. The method includes storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The system further includes a receiver for receiving results of the calculation of the transform of the matrix by the nodes.
    Type: Grant
    Filed: June 14, 2010
    Date of Patent: October 1, 2013
    Assignee: International Business Machines Corporation
    Inventors: Maria Eleftheriou, Blake G. Fitch, Robert S. Germain, Aleksandr Rayshubskly, T. J. Chris Ward
  • Patent number: 8484251
    Abstract: A computer readable storage medium for performing a transform of a multidimensional matrix in a distributed memory network by: storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The medium further receives results of the calculation of the transform of the matrix by the nodes.
    Type: Grant
    Filed: June 21, 2010
    Date of Patent: July 9, 2013
    Assignee: International Business Machines Corporation
    Inventors: Maria Eleftheriou, Blake G. Fitch, Robert S. Germain, Aleksandr Rayshubskiy, Thomas James Christopher Ward
  • Patent number: 8082108
    Abstract: An information processing system includes a processor configured for: defining a simulation space comprising a plurality of fragments and a plurality of processing nodes; determining a weight corresponding to the computational cost for a given pairwise fragment interaction; assigning the weight to the simulation space at a point between the two interacting fragments; performing a spatial partitioning of a volume of the simulation space such that all partitions have substantially the same weight; and assigning a computation of the pairwise fragment interaction to any node that has the positions of both groups of fragments.
    Type: Grant
    Filed: October 29, 2007
    Date of Patent: December 20, 2011
    Assignee: Internatinal Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael G. Pitman, Aleksandr Rayshubskly
  • Patent number: 8065090
    Abstract: A method for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions includes steps of: assigning a weight corresponding to a computational cost for a pair interaction of particles to a simulation space distance between the particles; performing a spatial partitioning of the simulation space; and assigning computation of pair interaction to any node that has the positions of both particles.
    Type: Grant
    Filed: October 29, 2007
    Date of Patent: November 22, 2011
    Assignee: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael G. Pitman, Aleksandr Rayshubskly
  • Patent number: 7860695
    Abstract: A method and system are disclosed for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions that is scalable to a very large number of nodes and has favorable communications characteristics including well defined bounds on the number of hops and the number of nodes to which a particle's position must be sent. To deal with structural imbalance, a weight is assigned corresponding to the computational cost for a particular pair interaction of particles or locally clustered groups of particles to simulation space at the midpoint of the distance between the particles or centers of the clusters. A spatial partitioning of the simulation volume is then carried out using a k-d tree or optimal recursive bisection (ORB) to divide the volume into sections that have approximately equal total weights.
    Type: Grant
    Filed: July 15, 2008
    Date of Patent: December 28, 2010
    Assignee: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubakly
  • Publication number: 20100257220
    Abstract: An information processing system for performing a transform of a multidimensional matrix in a distributed memory network. The method includes storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The system further includes a receiver for receiving results of the calculation of the transform of the matrix by the nodes.
    Type: Application
    Filed: June 14, 2010
    Publication date: October 7, 2010
    Applicant: International Business Machines Corporation
    Inventors: Maria Eleftheriou, Blake G. Fitch, Robert S. Germain, Aleksandr Rayshubskiy, T. J. C. Ward
  • Publication number: 20100257209
    Abstract: A computer readable storage medium for performing a transform of a multidimensional matrix in a distributed memory network by: storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The medium further receives results of the calculation of the transform of the matrix by the nodes.
    Type: Application
    Filed: June 21, 2010
    Publication date: October 7, 2010
    Applicant: International Business Machines Corporation
    Inventors: Maria Eleftheriou, Blake G. Fitch, Robert S. Germain, Aleksandr Rayshubskiy, T. J. C. Ward
  • Patent number: 7788310
    Abstract: A method, information processing system and computer readable medium for performing a transform of a multidimensional matrix in a distributed memory network. The method includes storing a multidimensional matrix of side N in a distributed memory network comprising a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N.sup.2 of the plurality of nodes. The method further includes receiving results of the calculation of the transform of the matrix by the nodes.
    Type: Grant
    Filed: July 8, 2004
    Date of Patent: August 31, 2010
    Assignee: International Business Machines Corporation
    Inventors: Maria Eleftheriou, Blake G. Fitch, Robert S. Germain, Aleksandr Rayshubskiy, Thomas James Christopher Ward
  • Publication number: 20100088080
    Abstract: Techniques are disclosed for creating a load balanced spatial partitioning of a structured, diffusing system of particles. An exemplary method includes steps of determining a subset of a set of nodes within a given portion of the coordinate system intersected by a surface defined by points having a given distance from the surface of the given node; and mirroring the determined subset to at least another portion of the coordinate system.
    Type: Application
    Filed: October 3, 2008
    Publication date: April 8, 2010
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubskiy
  • Publication number: 20080300839
    Abstract: Disclosed are a method of and system for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions that is scalable to a very large number of nodes and has favorable communications characteristics including well defined bounds on the number of hops and the number of nodes to which a particle's position must be sent. To deal with structural imbalance, we can assign a weight corresponding to the computational cost for a particular pair interaction of particles or locally clustered groups of particles to simulation space at the midpoint of the distance between the particles or centers of the clusters. We then carry out a spatial partitioning of the simulation volume using a k-d tree or optimal recursive bisection (ORB) to divide the volume into sections that have approximately equal total weights.
    Type: Application
    Filed: July 15, 2008
    Publication date: December 4, 2008
    Applicant: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubakly
  • Publication number: 20080189093
    Abstract: A method for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions includes steps of: assigning a weight corresponding to a computational cost for a pair interaction of particles to a simulation space distance between the particles; performing a spatial partitioning of the simulation space; and assigning computation of pair interaction to any node that has the positions of both particles.
    Type: Application
    Filed: October 29, 2007
    Publication date: August 7, 2008
    Applicant: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubskiy
  • Publication number: 20080183435
    Abstract: An information processing system includes a processor configured for: defining a simulation space comprising a plurality of fragments and a plurality of processing nodes; determining a weight corresponding to the computational cost for a given pairwise fragment interaction; assigning the weight to the simulation space at a point between the two interacting fragments; performing a spatial partitioning of a volume of the simulation space such that all partitions have substantially the same weight; and assigning a computation of the pairwise fragment interaction to any node that has the positions of both groups of fragments.
    Type: Application
    Filed: October 29, 2007
    Publication date: July 31, 2008
    Applicant: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubskiy
  • Publication number: 20070233440
    Abstract: Disclosed are a method of and system for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions that is scalable to a very large number of nodes and has favorable communications characteristics including well defined bounds on the number of hops and the number of nodes to which a particle's position must be sent. To deal with structural imbalance, we can assign a weight corresponding to the computational cost for a particular pair interaction of particles or locally clustered groups of particles to simulation space at the midpoint of the distance between the particles or centers of the clusters. We then carry out a spatial partitioning of the simulation volume using a k-d tree or optimal recursive bisection (ORB) to divide the volume into sections that have approximately equal total weights.
    Type: Application
    Filed: March 29, 2006
    Publication date: October 4, 2007
    Applicant: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Michael C. Pitman, Aleksandr Rayshubskiy
  • Patent number: 7085613
    Abstract: A method is provided for monitoring audio content in a video broadcast. According to the method, an audio datastream from the video broadcast is received, and audio identifying information is generated for audio content from the audio datastream. It is determined whether the audio identifying information generated for the received audio content matches audio identifying information in an audio content database. In one preferred embodiment, the audio identifying information is an audio feature signature that is based on audio content. Also provided is a system for monitoring audio content in a video broadcast.
    Type: Grant
    Filed: June 29, 2001
    Date of Patent: August 1, 2006
    Assignee: International Business Machines Corporation
    Inventors: Michael C. Pitman, Blake G. Fitch, Steven Abrams, Robert S. Germain
  • Patent number: 7062121
    Abstract: An information processing system, includes several processors, each having at least one optical fiber input and at least one optical fiber output; a controller having an optical fiber input and at least one fiber output; fibers, bundled for transmitting information; and a fiber bundle redriver, coupled to the controller, having an input channel and an output channel, for simultaneously redriving an optical signal received from any selected one of the plurality of input fibers onto substantially all of the plurality of output fibers. The fiber output of each of the plurality of processors and the at least one fiber output of the controller are respectively is coupled to the input channel of the fiber bundle redriver, and the at least one fiber input of each of said plurality of processors and the fiber input of the controller are respectively coupled to the output channel of the fiber bundle redriver.
    Type: Grant
    Filed: November 15, 2002
    Date of Patent: June 13, 2006
    Assignee: International Business Machines Corporation
    Inventors: Blake G. Fitch, Robert S. Germain, Glen W. Johnson, Daniel M. Kuchta, Jeannine M. Trewhella