 | 2008 |
|---|
| 14 |       | Benoit Boissinot,
Sebastian Hack,
Daniel Grund,
Benoît Dupont de Dinechin,
Fabrice Rastello:
Fast liveness checking for ssa-form programs.
CGO 2008: 35-44 |
| 13 | | Benoît Dupont de Dinechin:
Inter-block Scoreboard Scheduling in a JIT Compiler for VLIW Processors.
Euro-Par 2008: 370-381 |
| 2006 |
|---|
| 12 | | F. Blachot,
Benoît Dupont de Dinechin,
Guillaume Huard:
SCAN: A Heuristic for Near-Optimal Software Pipelining.
Euro-Par 2006: 289-298 |
| 2005 |
|---|
| 11 | | Jean-Michel Muller,
Arnaud Tisserand,
Benoît Dupont de Dinechin,
Christophe Monat:
Division by Constant for the ST100 DSP Microprocessor.
IEEE Symposium on Computer Arithmetic 2005: 124-130 |
| 2000 |
|---|
| 10 | | Benoît Dupont de Dinechin,
François de Ferrière,
Christophe Guillon,
Artour Stoutchinin:
Code generator optimizations for the ST120 DSP-MCU core.
CASES 2000: 93-102 |
| 1999 |
|---|
| 9 | | Benoît Dupont de Dinechin:
Extending Modulo Scheduling with Memory Reference Merging.
CC 1999: 274-287 |
| 1997 |
|---|
| 8 |  | Robert W. Numrich,
Jon L. Steidel,
Brian H. Johnson,
Benoît Dupont de Dinechin,
Gary Elsesser,
Greg Fischer,
Tom MacDonald:
Definition of the F-- Extension to Fortran 90.
LCPC 1997: 292-306 |
| 7 | | Benoît Dupont de Dinechin:
A Unified Software Pipeline Construction Scheme for Modulo Scheduled Loops.
LCPC 1997: 382-393 |
| 6 | | Benoît Dupont de Dinechin:
A Unified Software Pipeline Construction Scheme for Modulo Scheduled Loops.
PaCT 1997: 189-200 |
| 1996 |
|---|
| 5 | | Benoît Dupont de Dinechin:
Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates.
LCPC 1996: 231-245 |
| 1995 |
|---|
| 4 | | Benoît Dupont de Dinechin:
Insertion Scheduling: An Alternative to List Scheduling for Modulo Schedulers.
LCPC 1995: 31-45 |
| 1994 |
|---|
| 3 | | Benoît Dupont de Dinechin:
An Introduction to Simplex Scheduling.
IFIP PACT 1994: 327-330 |
| 1992 |
|---|
| 2 | | Benoît Dupont de Dinechin:
StaCS: a Static Control Superscalar architecture.
MICRO 1992: 282-291 |
| 1991 |
|---|
| 1 | | Benoît Dupont de Dinechin:
A ultra fast Euclidean division algorithm for prime memory systems.
SC 1991: 56-65 |
