2008 |
42 | EE | José R. Herrero,
Juan J. Navarro:
Hypermatrix oriented supernode amalgamation.
The Journal of Supercomputing 46(1): 84-104 (2008) |
2007 |
41 | EE | José R. Herrero,
Juan J. Navarro:
Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking.
Appl. Algebra Eng. Commun. Comput. 18(3): 279-295 (2007) |
40 | EE | José R. Herrero,
Juan J. Navarro:
Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking.
Appl. Algebra Eng. Commun. Comput. 18(3): 279-295 (2007) |
39 | EE | José R. Herrero,
Juan J. Navarro:
Exploiting computer resources for fast nearest neighbor classification.
Pattern Anal. Appl. 10(4): 265-275 (2007) |
2006 |
38 | EE | José R. Herrero,
Juan J. Navarro:
Compiler-Optimized Kernels: An Efficient Alternative to Hand-Coded Inner Kernels.
ICCSA (5) 2006: 762-771 |
37 | | José R. Herrero,
Juan J. Navarro:
Sparse Hypermatrix Cholesky: Customization for High Performance.
IMECS 2006: 821-827 |
36 | EE | José R. Herrero,
Juan J. Navarro:
Using Non-canonical Array Layouts in Dense Matrix Operations.
PARA 2006: 580-588 |
2005 |
35 | EE | José R. Herrero,
Juan J. Navarro:
Efficient Implementation of Nearest Neighbor Classification.
CORES 2005: 177-186 |
34 | EE | José R. Herrero,
Juan J. Navarro:
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme.
PPAM 2005: 1058-1065 |
33 | EE | José R. Herrero,
Juan J. Navarro:
A Study on Load Imbalance in Parallel Hypermatrix Multiplication Using OpenMP.
PPAM 2005: 124-131 |
2004 |
32 | EE | José R. Herrero,
Juan J. Navarro:
Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization.
PARA 2004: 798-807 |
2003 |
31 | EE | José R. Herrero,
Juan J. Navarro:
Improving Performance of Hypermatrix Cholesky Factorization.
Euro-Par 2003: 461-469 |
30 | EE | Daniel Jiménez-González,
Juan J. Navarro,
Josep-Lluis Larriba-Pey:
CC-Radix: a Cache Conscious Sorting Based on Radix sort.
PDP 2003: 101-108 |
29 | | José R. Herrero,
Juan J. Navarro:
Automatic Benchmarking and Optimization of Codes: An Experience with Numerical Kernels.
Software Engineering Research and Practice 2003: 701-706 |
28 | | José R. Herrero,
Juan J. Navarro:
Building Software Via Shared Knowledge.
Software Engineering Research and Practice 2003: 861-870 |
2002 |
27 | EE | Daniel Jiménez-González,
Josep-Lluis Larriba-Pey,
Juan J. Navarro:
Case Study: Memory Conscious Parallel Sorting.
Algorithms for Memory Hierarchies 2002: 355-377 |
26 | EE | Daniel Jiménez-González,
Juan J. Navarro,
Josep-Lluis Larriba-Pey:
The Effect of Local Sort on Parallel Sorting Algorithms.
PDP 2002: 360-367 |
2001 |
25 | EE | Daniel Jiménez-González,
Juan J. Navarro,
Josep-Lluis Larriba-Pey:
Fast parallel in-memory 64-bit sorting.
ICS 2001: 114-122 |
1999 |
24 | EE | Daniel Jiménez-González,
Josep-Lluis Larriba-Pey,
Juan J. Navarro:
Communication conscious radix sort.
International Conference on Supercomputing 1999: 76-82 |
23 | EE | Daniel Jiménez-González,
E. Guinovart,
Josep-Lluis Larriba-Pey,
Juan J. Navarro:
Sorting on the SGI Origin 2000: Comparing MPI and Shared Memory Implementations.
SCCC 1999: 209-215 |
1998 |
22 | EE | Toni Juan,
Sanji Sanjeevan,
Juan J. Navarro:
Dynamic History-length Fitting: A Third Level of Adaptivity for Branch Prediction.
ISCA 1998: 155-166 |
1997 |
21 | EE | Toni Juan,
Tomás Lang,
Juan J. Navarro:
Reducing TLB power requirements.
ISLPED 1997: 196-201 |
20 | EE | Toni Juan,
Juan J. Navarro,
Olivier Temam:
Data Caches for Superscalar Processors.
International Conference on Supercomputing 1997: 60-67 |
19 | EE | Josep-Lluis Larriba-Pey,
Daniel Jiménez-González,
Juan J. Navarro:
An Analysis of Superscalar Sorting Algorithms on an R8000 Processor.
SCCC 1997: 125-134 |
1996 |
18 | EE | Toni Juan,
Tomás Lang,
Juan J. Navarro:
The Difference-bit Cache.
ISCA 1996: 114-120 |
17 | EE | Juan J. Navarro,
Elena García-Diego,
José R. Herrero:
Data Prefetching and Multilevel Blocking for Linear Algebra Operations.
International Conference on Supercomputing 1996: 109-116 |
16 | EE | Juan J. Navarro,
Elena García-Diego,
Josep-Lluis Larriba-Pey,
Toni Juan:
Block Algorithms for Sparse Matrix Computations on High Performance Workstations.
International Conference on Supercomputing 1996: 301-308 |
15 | | Josep-Lluis Larriba-Pey,
Juan J. Navarro,
Angel Jorba,
Oriol Roig:
Review of General and Toeplitz Vector Bidiagonal Solvers.
Parallel Computing 22(8): 1091-1126 (1996) |
1995 |
14 | | Josep-Lluis Larriba-Pey,
Michael Mascagni,
Angel Jorba,
Juan J. Navarro:
An Analysis of the Parallel Computation of Arbitrarily Branched Cable Neuron Models.
PPSC 1995: 373-378 |
13 | | José M. Cela,
Jesús Labarta,
Andrés Pérez,
Juan J. Navarro:
Performance on Distributed Memory Multicomputers of Domain Decomposition Solvers.
PPSC 1995: 391-392 |
12 | | Josep-Lluis Larriba-Pey,
Angel Jorba,
Juan J. Navarro:
A Generalized Criterion for the Early Termination of R-Cyclic Reduction and Divide and Conquer for Recurrences.
PPSC 1995: 448-453 |
1994 |
11 | EE | Juan J. Navarro,
Toni Juan,
Tomás Lang:
MOB forms: a class of multilevel block algorithms for dense linear algebra operations.
International Conference on Supercomputing 1994: 354-363 |
10 | EE | Josep-Lluis Larriba-Pey,
Juan J. Navarro,
Oriol Roig,
Angel Jorba:
A generalized vision of some parallel bidiagonal systems solvers.
International Conference on Supercomputing 1994: 404-411 |
1993 |
9 | | Josep-Lluis Larriba-Pey,
Angel Jorba,
Juan J. Navarro:
A Parallel Tridiagonal Solver for Vector Uniprocessors.
PPSC 1993: 590-597 |
1992 |
8 | | Mateo Valero,
Tomás Lang,
José M. Llabería,
Montse Peiron,
Eduard Ayguadé,
Juan J. Navarro:
Increasing the Number of Strides for Conflict-Free Vector Access.
ISCA 1992: 372-381 |
7 | EE | Miguel Valero-García,
Juan J. Navarro,
José María Llabería,
Mateo Valero,
Tomás Lang:
A method for implementation of one-dimensional systolic algorithms with data contraflow using pipelined functional units.
VLSI Signal Processing 4(1): 7-25 (1992) |
1991 |
6 | | Miguel Valero-García,
Juan J. Navarro,
José J. M. Liabería,
Mateo Valero,
Tomás Lang:
Mapping QR decomposition of a banded matrix on a ID systolic array with data contraflow and pipelined functional units.
Algorithms and Parallel VLSI Architectures 1991: 25-38 |
5 | | Agustin Fernández,
José M. Llabería,
Juan J. Navarro,
Miguel Valero-García:
Interleaving Partitions of Systolic Algorithms for Programming Distributed Memory Multiprocessors.
EDMCC 1991: 90-99 |
4 | | Mateo Valero,
Tomás Lang,
José María Llabería,
Montse Peiron,
Juan J. Navarro,
Eduard Ayguadé:
Conflict-Free Strides for Vectors in Matched Memories.
Parallel Processing Letters 1: 95-102 (1991) |
1989 |
3 | EE | Miguel Valero-García,
Juan J. Navarro,
José M. Llabería,
Mateo Valero:
Systematic Hardware Adaptation of Systolic Algorithms.
ISCA 1989: 96-104 |
1986 |
2 | | Juan J. Navarro,
José M. Llabería,
Mateo Valero:
Solving Matrix Problems with No Size Restriction on a Systolic Array Processor.
ICPP 1986: 676-683 |
1 | | Juan J. Navarro,
José M. Llabería,
Mateo Valero:
Computing Size-Independent Matrix Problems on Systolic Array Processors.
ISCA 1986: 271-278 |