| 2007 |
| 13 | EE | Ayose Falcón,
Paolo Faraboschi,
Daniel Ortega:
Combining Simulation and Virtualization through Dynamic Sampling.
ISPASS 2007: 72-83 |
| 2005 |
| 12 | EE | Sherif M. Yacoub,
John Burns,
Paolo Faraboschi,
Daniel Ortega,
José L. Abad Peiro,
Vinay Saxena:
Document digitization lifecycle for complex magazine collection.
ACM Symposium on Document Engineering 2005: 197-206 |
| 11 | EE | Daniel Ortega,
Salvador Revelo,
José Mariano Fernández,
Pedro Bañuelos:
Output Voltage Effects in a 2x2 SMC Caused by Time Index Change.
CONIELECOMP 2005: 100-105 |
| 2004 |
| 10 | EE | Adrián Cristal,
Daniel Ortega,
Josep Llosa,
Mateo Valero:
Out-of-Order Commit Processors.
HPCA 2004: 48-59 |
| 9 | EE | Rubén González,
Adrián Cristal,
Daniel Ortega,
Alexander V. Veidenbaum,
Mateo Valero:
A Content Aware Integer Register File Organization.
ISCA 2004: 314-324 |
| 8 | EE | Adrián Cristal,
Josep Llosa,
Mateo Valero,
Daniel Ortega:
Future ILP processors.
IJHPCN 2(1): 1-10 (2004) |
| 7 | EE | Daniel Ortega,
Mateo Valero,
Eduard Ayguadé:
Dynamic Memory Instruction Bypassing.
International Journal of Parallel Programming 32(3): 199-224 (2004) |
| 2003 |
| 6 | EE | Daniel Ortega,
Eduard Ayguadé,
Mateo Valero:
Dynamic memory instruction bypassing.
ICS 2003: 316-325 |
| 5 | EE | Adrián Cristal,
Daniel Ortega,
Josep Llosa,
Mateo Valero:
Kilo-instruction Processors.
ISHPC 2003: 10-25 |
| 2002 |
| 4 | EE | Daniel Ortega,
Eduard Ayguadé,
Jean-Loup Baer,
Mateo Valero:
Cost-Effective Compiler Directed Memory Prefetching and Bypassing.
IEEE PACT 2002: 189-198 |
| 2001 |
| 3 | EE | Daniel Ortega,
Mateo Valero,
Eduard Ayguadé:
A novel renaming mechanism that boosts software prefetching.
ICS 2001: 501-510 |
| 1999 |
| 2 | EE | Daniel Ortega,
Ivan Martel,
Venkata Krishnan,
Eduard Ayguadé,
Mateo Valero:
Quantifying the Benefits of SPECint Distant Parallelism in Simultaneous Multi-Threading Architectures.
IEEE PACT 1999: 117-124 |
| 1 | EE | Ivan Martel,
Daniel Ortega,
Eduard Ayguadé,
Mateo Valero:
Increasing effective IPC by exploiting distant parallelism.
International Conference on Supercomputing 1999: 348-355 |