Mateo Valero

Mateo Valero

Auto-generated profile, based on publicly available information

Mateo Valero

Barcelona Supercomputing Center, Barcelona, Spain

Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 January 2011 in The International Journal of High Performance Computing Applications
Verified
Journal Article
Closed access
JDJack Dongarra
Jack Dongarra
PBPete Beckman
Pete Beckman
TMTerry Moore
Terry Moore
PAPatrick Aerts
Patrick Aerts
GAGiovanni Aloisio
Giovanni Aloisio
KYKathy Yelick
Kathy Yelick
Over the last 20 years, the open-source community has provided more and more software on which the world’s high-performance computing systems depend for performance and productivity. The community has invested millions of dollars and years of effort to build key components. However, although the investments in these separate software elements have been tremendously valuable, a great deal of productivity has also been lost because of the lack of planning, coordination, and key integration of technologies necessary to make them work together smoothly and efficiently, both within individual petascale systems and between different systems. It seems clear that this completely uncoordinated development model will not provide the software needed to support the unprecedented parallelism required for peta/ exascale computation on millions of cores, or the flexibility required to exploit new hardware models and features, such as transactional memory, speculative execution, and graphics processing units. This report describes the work of the community to prepare for the challenges of exascale computing, ultimately combing their efforts in a coordinated International Exascale Software Project.

1 May 2016 in Journal of Computational Science
Verified
Journal Article
Open access
MVMariano Vázquez
Mariano Vázquez
GHGuillaume Houzeaux
Guillaume Houzeaux
SKSeid Koric
Seid Koric
AAAntoni Artigues
Antoni Artigues
JAJazmin Aguado-Sierra
Jazmin Aguado-Sierra
MVMateo Valero
Mateo Valero
Alya is a multi-physics simulation code developed at Barcelona Supercomputing Center (BSC). From its inception Alya code is designed using advanced High Performance Computing programming techniques to solve coupled problems on supercomputers efficiently. The target domain is engineering, with all its particular features: complex geometries and unstructured meshes, coupled multi-physics with exotic coupling schemes and physical models, ill-posed problems, flexibility needs for rapidly including new models, etc. Since its beginnings in 2004, Alya has scaled well in an increasing number of processors when solving single-physics problems such as fluid mechanics, solid mechanics, acoustics, etc. Over time, we have made a concerted effort to maintain and even improve scalability for multi-physics problems. This poses challenges on multiple fronts, including: numerical models, parallel implementation, physical coupling models, algorithms and solution schemes, meshing process, etc. In this paper, we introduce Alya's main features and focus particularly on its solvers. We present Alya's performance up to 100.000 processors in Blue Waters, the NCSA supercomputer with selected multi-physics tests that are representative of the engineering world. The tests are incompressible flow in a human respiratory system, low Mach combustion problem in a kiln furnace, and coupled electro-mechanical contraction of the heart. We show scalability plots for all cases and discuss all aspects of such simulations, including solver convergence.Peer ReviewedPostprint (published version

23 May 2005 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
CAC. Alvarez
C. Alvarez
JCJ. Corbal
J. Corbal
MVM. Valero
M. Valero
Instruction memoization is a promising technique to reduce the power consumption and increase the performance of future low-end/mobile multimedia systems. Power and performance efficiency can be improved by reusing instances of an already executed operation. Unfortunately, this technique may not always be worth the effort due to the power consumption and area impact of the tables required to leverage an adequate level of reuse. In this paper, we introduce and evaluate a novel way of understanding multimedia floating-point operations based on the fuzzy computation paradigm: performance and power consumption can be improved at the cost of small precision losses in computation. By exploiting this implicit characteristic of multimedia applications, we propose a new technique called tolerant memoization. This technique expands the capabilities of classic memoization by associating entries with similar inputs to the same output. We evaluate this new technique by measuring the effect of tolerant memoization for floating-point operations in a low-power multimedia processor and discuss the trade-offs between performance and quality of the media outputs. We report energy improvements of 12 percent for a set of key multimedia applications with small LUT of 6 Kbytes, compared to 3 percent obtained using previously proposed techniques.

1 December 2012
Verified
Conference Paper
Closed access
NDNam Duong
Nam Duong
DZDali Zhao
Dali Zhao
TKTaesu Kim
Taesu Kim
RCRosario Cammarota
Rosario Cammarota
MVMateo Valero
Mateo Valero
AVAlexander V. Veidenbaum
Alexander V. Veidenbaum
Cache management policies such as replacement, bypass, or shared cache partitioning have been relying on data reuse behavior to predict the future. This paper proposes a new way to use dynamic reuse distances to further improve such policies. A new replacement policy is proposed which prevents replacing a cache line until a certain number of accesses to its cache set, called a Protecting Distance (PD). The policy protects a cache line long enough for it to be reused, but not beyond that to avoid cache pollution. This can be combined with a bypass mechanism that also relies on dynamic reuse analysis to bypass lines with less expected reuse. A miss fetch is bypassed if there are no unprotected lines. A hit rate model based on dynamic reuse history is proposed and the PD that maximizes the hit rate is dynamically computed. The PD is recomputed periodically to track a program's memory access behavior and phases. Next, a new multi-core cache partitioning policy is proposed using the concept of protection. It manages lifetimes of lines from different cores (threads) in such a way that the overall hit rate is maximized. The average per-thread lifetime is reduced by decreasing the thread's PD. The single-core PD-based replacement policy with bypass achieves an average speedup of 4.2% over the DIP policy, while the average speedups over DIP are 1.5% for dynamic RRIP (DRRIP) and 1.6% for sampling dead-block prediction (SDP). The 16-core PD-based partitioning policy improves the average weighted IPC by 5.2%, throughput by 6.4% and fairness by 9.9% over thread-aware DRRIP (TA-DRRIP). The required hardware is evaluated and the overhead is shown to be manageable.

20 June 2009
Verified
Conference Paper
Open access
PDF file
MPMarco Paolieri
Marco Paolieri
EQEduardo Quiñones
Eduardo Quiñones
FCFrancisco J. Cazorla
Francisco J. Cazorla
GBGuillem Bernat
Guillem Bernat
MVMateo Valero
Mateo Valero

1 December 2009 in IEEE Embedded Systems Letters
Verified
Journal Article
Closed access
MPMarco Paolieri
Marco Paolieri
EQEduardo Quinones
Eduardo Quinones
FCFrancisco J. Cazorla
Francisco J. Cazorla
MVMateo Valero
Mateo Valero
Multicore processors (CMPs) represent a good solution to provide the performance required by current and future hard real-time systems. However, it is difficult to compute a tight WCET estimation for CMPs due to interferences that tasks suffer when accessing shared hardware resources. We propose an analyzable JEDEC-compliant DDRx SDRAM memory controller (AMC) for hard real-time CMPs, that reduces the impact of memory interferences caused by other tasks on WCET estimation, providing a predictable memory access time and allowing the computation of tight WCET estimations.