Patents by Inventor Erik P. Charlebois

Erik P. Charlebois 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).

  • Method of partially copying first and last private arrays for parallelized loops based on array data flow
    Patent number: 7877739
    Abstract: A computer-implemented method for determining whether an array within a loop can be privatized for that loop is presented. The method calculates the array sections that require first or last privatization and copies only those sections, reducing the privatization overhead of the known solutions.
    Type: Grant
    Filed: October 9, 2006
    Date of Patent: January 25, 2011
    Assignee: International Business Machines Corporation
    Inventors: Roch G. Archambault, Erik P. Charlebois, Guansong Zhang
  • Pattern matching and transformation of intermediate language expression trees
    Patent number: 7784038
    Abstract: A method, apparatus, and computer program product are provided by the present invention for a programming framework for easy pattern matching and transformation of intermediate language expression trees. With expression matching and transformation framework (EMTF) of the present invention, pattern matchers may be defined and embedded in a C++ program code in a manner that resembles their intermediate representation. EMTF also provides capabilities for unification, unbinding, transformation, intra-pattern referencing, common operators, creation of pattern objects in a storage pool. Recursive sub-expression matching and recursive transformation are also included.
    Type: Grant
    Filed: October 13, 2005
    Date of Patent: August 24, 2010
    Assignee: International Business Machines Corporation
    Inventors: Erik P. Charlebois, Arie Tal
  • METHOD OF PARTIALLY COPYING FIRST AND LAST PRIVATE ARRAYS FOR PARALLELIZED LOOPS BASED ON ARRAY DATA FLOW
    Publication number: 20080086271
    Abstract: A computer-implemented method for determining whether an array within a loop can be privatized for that loop is presented. The method calculates the array sections that require first or last privatization and copies only those sections, reducing the privatization overhead of the known solutions.
    Type: Application
    Filed: October 9, 2006
    Publication date: April 10, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Roch G. Archambault, Erik P. Charlebois, Guansong Zhang