José Luis Sánchez

José Luis Sánchez

Auto-generated profile, based on publicly available information

José Luis Sánchez

Universidad de Castilla-La Mancha

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
13 September 2004 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
FAF.J. Alfaro
F.J. Alfaro
JSJ.L. Sanchez
J.L. Sanchez
JDJ. Duato
J. Duato
The InfiniBand architecture (IBA) has been proposed as an industry standard both for communication between processing nodes and I/O devices and for interprocessor communication. It replaces the traditional bus-based interconnect with a switch-based network for connecting processing nodes and I/O devices. It is being developed by the InfiniBand/sup SM/ Trade Association (IBTA) in the aim to provide the levels of reliability, availability, performance, scalability, and quality of service (QoS) required by present and future server systems. For this purpose, IBA provides a series of mechanisms that are able to guarantee QoS to the applications. In previous papers, we have proposed a strategy to compute the InfiniBand arbitration tables. In one of these, we presented and evaluated our proposal to treat traffic with bandwidth requirements. In another, we evaluated our strategy to compute the InfiniBand arbitration tables for traffic with delay requirements, which is a more complex task. In this paper, we evaluate both these proposals together. Furthermore, we also adapt these proposals in order to treat VBR traffic without QoS guarantees, but achieving very good results. Performance results show that, with a correct treatment of each traffic class in the arbitration of the output port, all traffic classes reach their QoS requirements.

1 September 2015
Verified
Conference Paper
Closed access
FAFranisco J. Andujar
Franisco J. Andujar
JVJuan A. Villar
Juan A. Villar
JSJose L. Sanchez
Jose L. Sanchez
FAFrancisco J. Alfaro
Francisco J. Alfaro
JEJesus Escudero-Sahuquillo
Jesus Escudero-Sahuquillo
Simulation is often used to evaluate the behaviour and measure the performance of computing systems. Specifically, in high-performance interconnection networks, the simulation has been extensively considered to verify the behaviour of the network itself and to evaluate its performance. In this context, network simulation must be fed with network traffic, also referred to as network workload, whose nature has been traditionally synthetic. These workloads can be used for the purpose of driving studies on network performance, but often such workloads are not accurate enough if a realistic evaluation is pursued. For this reason, other non-synthetic workloads have gained popularity over last decades since they are best to capture the realistic behaviour of existing applications. In this paper, we present the VEF traces framework, a self-related trace model, and all their associated tools. The main novelty of this framework is that, unlike existing ones, it does not provide a network simulation framework, but only offers an MPI task simulation framework, which allows one to use the MPI-based network traffic by any third-party network simulator, since this framework does not depend on any specific simulation platform.

1 July 2012
Verified
Conference Paper
Closed access
ASAlessandro Strano
Alessandro Strano
DBDavide Bertozzi
Davide Bertozzi
FTFrancisco Trivino
Francisco Trivino
JSJose L. Sanchez
Jose L. Sanchez
FAFrancisco J. Alfaro
Francisco J. Alfaro
JFJose Flich
Jose Flich
Current and future on-chip networks will feature an enhanced degree of reconfigurability. Power management and virtualization strategies as well as the need to survive to the progressive onset of wear-out faults are root causes for that. In all these cases, a non-intrusive and efficient reconfiguration method is needed to allow the network to function uninterruptedly over the course of the reconfiguration process while remaining deadlock-free. This paper is inspired by the overlapped static reconfiguration (OSR) protocol developed for off-chip networks. However, in its native form its implementation in NoCs is out-of-reach. Therefore, we provide a careful engineering of the NoC switch architecture and of the system-level infrastructure to support a cost-effective, complete and transparent reconfiguration process. Performance during the reconfiguration process is not affected and implementation costs (critical path and area overhead) are proved to be fully affordable for a constrained system. Less than 250 cycles are needed for the reconfiguration process of an 8×8 2D mesh with marginal impact on system performance.

1 March 2011 in Microprocessors and Microsystems
Verified
Journal Article
Closed access
FTFrancisco Triviño
Francisco Triviño
JSJosé L. Sánchez
José L. Sánchez
FAFrancisco J. Alfaro
Francisco J. Alfaro
JFJosé Flich
José Flich

25 May 2016 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
FAFrancisco J. Andújar
Francisco J. Andújar
FJFrancisco J.
Francisco J.
JVJuan A. Villar
Juan A. Villar
FAFrancisco J. Alfaro
Francisco J. Alfaro
JSJosé L. Sánchez
José L. Sánchez
JEJesus Escudero-Sahuquillo
Jesus Escudero-Sahuquillo

5 November 2007 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AMAlejandro Martinez
Alejandro Martinez
FAFrancisco J. Alfaro
Francisco J. Alfaro
JSJosé L. Sanchez
José L. Sanchez
FQFrancisco .J. Quiles
Francisco .J. Quiles
JDJosé Duato
José Duato
Virtual channels (VCs) are a popular solution for the provision of quality of service (QoS). Current interconnect standards propose 16 or even more VCs for this purpose. However, most implementations do not offer so many VCs because it is too expensive in terms of silicon area. Therefore, a reduction of the number of VCs necessary to support QoS can be very helpful in the switch design and implementation. In this paper, we show that this number of VCs can be reduced if the system is considered as a whole rather than each element being taken separately. The scheduling decisions made at network interfaces can be easily reused at switches without significantly altering the global behavior. In this way, we obtain a noticeable reduction of silicon area, component count and, thus, power consumption, and we can provide similar performance to a more complex architecture. We also show that this is a scalable technique, suitable for the foreseen demands of traffic.