Inventor · disambiguated record
Roch G. Archambault
Also filed as: ARCHAMBAULT ROCH · ARCHAMBAULT ROCH G · ARCHAMBAULT ROCH GEORGES
32 granted patents·6 pending applications·491 citations·filing 1997–2015
97Inventor score
Technology areasG06F
Top patents by PatentIndex Score
38 records- 0195US6651246B1Loop allocation for optimizing compilersIBM·Filed 2000·Granted Nov 18, 2003·137 cites·33 claims
- 0289US8161464B2Compiling source codeARCHAMBAULT ROCH GEORGES·Filed 2006·Granted Apr 17, 2012·24 cites·18 claims
- 0382US8146070B2Method and apparatus for optimizing software program using inter-procedural strength reductionARCHAMBAULT ROCH GEORGES·Filed 2008·Granted Mar 27, 2012·11 cites·2 claims
- 0482US7856627B2Method of SIMD-ization through data reshaping, padding, and alignmentIBM·Filed 2006·Granted Dec 21, 2010·12 cites·6 claims
- 0581US7765534B2Compiler with cache utilization optimizationsIBM·Filed 2004·Granted Jul 27, 2010·31 cites·27 claims
- 0680US8490065B2Method and apparatus for software-assisted data cache and prefetch controlARCHAMBAULT ROCH·Filed 2005·Granted Jul 16, 2013·14 cites·20 claims
- 0780US8037462B2Framework for parallelizing general reductionIBM·Filed 2006·Granted Oct 11, 2011·11 cites·10 claims
- 0880US6173444B1Optimizing compilation of pointer variables in the presence of indirect function callsIBM·Filed 1997·Granted Jan 9, 2001·93 cites·8 claims
- 0977US8332833B2Procedure control descriptor-based code specialization for context sensitive memory disambiguationARCHAMBAULT ROCH GEORGES·Filed 2007·Granted Dec 11, 2012·8 cites·30 claims
- 1077US7168070B2Aggregate bandwidth through management using insertion of reset instructions for cache-to-cache data transferIBM·Filed 2004·Granted Jan 23, 2007·27 cites·25 claims
- 1175US7590977B2Method and system for reducing memory reference overhead associated with threadprivate variables in parallel programsIBM·Filed 2005·Granted Sep 15, 2009·6 cites·8 claims
- 1274US7818731B2Method and system for reducing memory reference overhead associated with treadprivate variables in parallel programsIBM·Filed 2008·Granted Oct 19, 2010·5 cites·28 claims
- 1372US8117604B2Architecture cloning for power PC processorsARCHAMBAULT ROCH G·Filed 2006·Granted Feb 14, 2012·6 cites·6 claims
- 1472US7100156B2Interprocedural dead store eliminationIBM·Filed 2001·Granted Aug 29, 2006·17 cites·18 claims
- 1571US8458679B2May-constant propagationARCHAMBAULT ROCH G·Filed 2010·Granted Jun 4, 2013·3 cites·19 claims
- 1671US7380086B2Scalable runtime system for global address space languages on shared and distributed memory machinesIBM·Filed 2003·Granted May 27, 2008·22 cites·8 claims
- 1769US9110684B2Data splitting for recursive data structuresARCHAMBAULT ROCH G·Filed 2007·Granted Aug 18, 2015·4 cites·15 claims
- 1867US7669194B2Fine-grained software-directed data prefetching using integrated high-level and low-level code analysis optimizationsIBM·Filed 2004·Granted Feb 23, 2010·11 cites·9 claims
- 1967US7555748B2Method and apparatus for improving data cache performance using inter-procedural strength reduction of global objectsIBM·Filed 2004·Granted Jun 30, 2009·12 cites·3 claims
- 2066US8423979B2Code generation for complex arithmetic reduction for architectures lacking cross data-path supportARCHAMBAULT ROCH GEORGES·Filed 2006·Granted Apr 16, 2013·4 cites·15 claims
- 2165US8191057B2Systems, methods, and computer products for compiler support for aggressive safe load speculationARCHAMBAULT ROCH G·Filed 2007·Granted May 29, 2012·4 cites·2 claims
- 2265US8191056B2Sparse vectorization without hardware gather/scatterARCHAMBAULT ROCH GEORGES·Filed 2006·Granted May 29, 2012·5 cites·30 claims
- 2363US9946523B2Multiple pass compiler instrumentation infrastructureARCHAMBAULT ROCH G·Filed 2010·Granted Apr 17, 2018·2 cites·17 claims
- 2462US8352684B2Optimal cache replacement scheme using a training operationIBM·Filed 2008·Granted Jan 8, 2013·2 cites·17 claims
- 2562US7340733B2Optimizing source code for iterative executionIBM·Filed 2002·Granted Mar 4, 2008·8 cites·48 claims
- 2659US8413127B2Fine-grained software-directed data prefetching using integrated high-level and low-level code analysis optimizationsARCHAMBAULT ROCH G·Filed 2009·Granted Apr 2, 2013·1 cites·20 claims
- 2759US7877739B2Method of partially copying first and last private arrays for parallelized loops based on array data flowIBM·Filed 2006·Granted Jan 25, 2011·2 cites·6 claims
- 2857US8091079B2Implementing shadow versioning to improve data dependence analysis for instruction schedulingARCHAMBAULT ROCH G·Filed 2007·Granted Jan 3, 2012·1 cites·5 claims
- 2956US7472382B2Method for optimizing software program using inter-procedural strength reductionIBM·Filed 2004·Granted Dec 30, 2008·4 cites·1 claims
- 3052US7506331B2Method and apparatus for determining the profitability of expanding unpipelined instructionsIBM·Filed 2004·Granted Mar 17, 2009·3 cites·4 claims
- 3150US10095491B2Data splitting for recursive data structuresIBM·Filed 2015·Granted Oct 9, 2018·0 cites·13 claims
- 3250US2008028381A1Optimizing source code for iterative executionIBM·Filed 2007·Application pending·0 cites
- 3348US7530063B2Method and system for code modification based on cache structureIBM·Filed 2004·Granted May 5, 2009·1 cites·30 claims
- 3446US2006048118A1Method and apparatus for optimizing code with artificial statementsIBM·Filed 2004·Application pending·0 cites
- 3546US2005080981A1Structure and method for managing workshares in a parallel regionIBM·Filed 2004·Application pending·0 cites
- 3642US2002095667A1Optimizing compilation by forward store movementFiled 2001·Application pending·0 cites
- 3740US2007088937A1Computer-implemented method and processing unit for predicting branch target addressesIBM·Filed 2005·Application pending·0 cites
- 3837US2011093838A1Managing speculative assist threadsIBM·Filed 2010·Application pending·0 cites
Join the waitlist — get patent alerts
Get an alert when Roch G. Archambault files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Identity basis: PatentsView inventor disambiguation (2025Q4-odp release). How scoring works →