Name
Affiliation
Papers
PEDRO LÓPEZ
Universidad Politécnica de Valencia Facultad de Informática Camino de Vera s/n 46071 Valencia Spain
37
Collaborators
Citations 
PageRank 
44
639
64.48
Referers 
Referees 
References 
904
305
388
Search Limit
100904
Title
Citations
PageRank
Year
IODET: A HoL-blocking-aware Deterministic Routing Algorithm for Direct Topologies40.422012
Region-Based Routing: An Efficient Routing Mechanism to Tackle Unreliable Hardware in Network on Chips411.912007
Multi2Sim: A Simulation Framework to Evaluate Multicore-Multithreaded Processors842.732007
VB-MT: Design Issues and Performance of the Validation Buffer Microarchitecture for Multithreaded Processors20.372007
Applying the zeros switch-off technique to reduce static energy in data caches10.362006
A Memory-Effective Fault-Tolerant Routing Strategy for Direct Interconnection Networks00.342005
A Memory-Effective Routing Strategy for Regular Interconnection Networks211.742005
In-Order Packet Delivery in Interconnection Networks using Adaptive Routing60.912005
An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori331.482004
LASH-TOR: a generic transition-oriented routing algorithm251.222004
An Effective Fault-Tolerant Routing Methodology for Direct Networks50.522004
Applying In-Transit Buffers to Boost the Performance of Networks with Source Routing10.372003
Low-Fragmentation Mapping Strategies for Linear Forwarding Tables in InfiniBandTM00.342003
Supporting adaptive routing in IBA switches121.342003
Supporting Fully Adaptive Routing in InfiniBand Networks191.312003
Performance Evaluation of COWs under Real Parallel Applications00.342003
Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks261.872002
Boosting the performance of Myrinet networks181.162002
A First Implementation of In-Transit Buffers on Myrinet GM Software70.522001
Improving Network Performance by Reducing Network Contention in Source-Based COWs with a Low Path-Computation Overhead20.422001
Deadlock-Free Routing in InfiniBand through Destination Renaming282.072001
Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing131.592000
On the Influence of the Selection Function on the Performance of Networks of Workstations231.062000
A simple and efficient mechanism to prevent saturation in wormhole networks190.992000
Impact of Buffer Size on the Efficiency of Deadlock Detection20.391999
Edinet: An Execution Driven Interconnection Network Simulator for DSM Systems10.371998
A cost-effective methodology for the evaluation of interconnection networks10.361998
DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks211.091998
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks371.791997
Deadlock- and Livelock-Free Routing Protocols for Wave Switching50.501997
Efficient Adaptive Routing in Networks of Workstations with Irregular Topology423.141997
On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks161.111997
A High Performance Router Architecture for Interconnection Networks353.841996
Deadlock-Free Fully-Adaptive Minimal Routing Algorithms: Limitations and Solutions10.451995
Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes5222.221994
Bandwidth Requirements For Wormhole Switches: A Simple And Efficient Design10.401994
Deadlock-Free Adaptive Routing Algorithms for the 3D-Torus: Limitations and Solutions353.481993