15 citations · 19 across the 8 of their papers we have counts for
10 papers
LACIN: Linearly Arranged Complete Interconnection Networks
Ramón Beivide, Cristóbal Camarero, Carmen Martínez +2
Several interconnection networks are based on the complete graph topology. Networks with a moderate size can be based on a single complete graph. However, large-scale networks such…
Deadlock-free routing for Full-mesh networks without using Virtual Channels
Alejandro Cano, Cristóbal Camarero, Carmen Martínez +1
High-radix, low-diameter networks like HyperX and Dragonfly use a Full-mesh core, and rely on multiple virtual channels (VCs) to avoid packet deadlocks in adaptive routing. However…
Achieving High-Performance Fault-Tolerant Routing in HyperX Interconnection Networks
Cristóbal Camarero, Alejandro Cano, Carmen Martínez +1
Interconnection networks are key actors that condition the performance of current large datacenter and supercomputer systems. Both topology and routing are critical aspects that mu…
Analysing Mechanisms for Virtual Channel Management in Low-Diameter networks
Alejandro Cano, Cristóbal Camarero, Carmen Martínez +1
To interconnect their growing number of servers, current supercomputers and data centers are starting to adopt low-diameter networks, such as HyperX, Dragonfly and Dragonfly+. Thes…
Simple, Fast and Practicable Algorithms for Cholesky, LU and QR Decomposition Using Fast Rectangular Matrix Multiplication
Cristóbal Camarero
This note presents fast Cholesky/LU/QR decomposition algorithms with time complexity when using the fastest known matrix multiplication. The algorithms have potentia…
Projective Networks: Topologies for Large Parallel Computer Systems
Cristóbal Camarero, Carmen Martínez, Enrique Vallejo +1
The interconnection network comprises a significant portion of the cost of large parallel computers, both in economic terms and power consumption. Several previous proposals exploi…
Identifying Codes of Degree 4 Cayley Graphs over Abelian Groups
Cristóbal Camarero, Carmen Martínez, Ramón Beivide
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this constr…
Quasi-perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
Cristóbal Camarero, Carmen Martínez
A construction of 2-quasi-perfect Lee codes is given over the space for prime, and . It is known that there are infin…
Classes of Symmetric Cayley Graphs over Finite Abelian Groups of Degrees 4 and 6
Cristóbal Camarero, Carmen Martínez, Ramón Beivide
The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.
Symmetric Interconnection Networks from Cubic Crystal Lattices
Cristóbal Camarero, Carmen Martínez, Ramón Beivide
Torus networks of moderate degree have been widely used in the supercomputer industry. Tori are superb when used for executing applications that require near-neighbor communication…