24 June 2008 in IEEE Transactions on Computers
In this paper we consider a broad family of toroidal networks, denoted as Gaussian networks, which include many previously proposed and used topologies. We will define such networks by means of the Gaussian integers, the subset of the complex numbers with integer real and imaginary parts. Nodes in Gaussian networks are labeled by Gaussian integers, which confer these topologies an algebraic structure based on quotient rings of the Gaussian integers. In this sense, Gaussian integers reveal themselves as the appropriate tool for analyzing and exploiting any type of toroidal network. Using this algebraic approach, we can characterize the main distance-related properties of Gaussian networks, providing closed expressions for their diameter and average distance. In addition, we solve some important applications, like unicast and broadcast packet routing or the perfect placement of resources over these networks.
1 March 2008 in Problems of Information Transmission
A set of signal points is called a hexagonal constellation if it is possible to define a metric so that each point has exactly six neighbors at distance 1 from it. As sets of signal points, quotient rings of the ring of Eisenstein-Jacobi integers are considered. For each quotient ring, the corresponding graph is defined. In turn, the distance between two points of a quotient ring is defined as the corresponding graph distance. Under certain restrictions, a quotient ring is a hexagonal constellation with respect to this metric. For the considered hexagonal constellations, some classes of perfect codes are known. Using graphs leads to a new way of constructing these codes based on solving a standard graph-theoretic problem of finding a perfect dominating set. Also, a relation between the proposed metric and the well-known Lee metric is considered.
8 September 2016 in The Journal of Supercomputing
27 January 2020 in The Journal of Supercomputing
24 January 2025 in The Journal of Supercomputing
In recent years, energy consumption has become a limiting factor in the evolution of high-performance computing (HPC) clusters in terms of environmental concern and maintenance cost. The computing power of these clusters is increasing, together with the demands of the workloads they execute. A key component in HPC systems is the workload manager, whose operation has a substantial impact on the performance and energy consumption of the clusters. Recent research has employed machine learning techniques to optimise the operation of this component. However, these attempts have focused on homogeneous clusters where all the cores are pooled together and considered equal, disregarding the fact that they are contained in nodes and that they can have different performances. This work presents an intelligent job scheduler based on deep reinforcement learning that focuses on reducing energy consumption of heterogeneous HPC clusters. To this aim it leverages information provided by the users as well as the power consumption specifications of the compute resources of the cluster. The scheduler is evaluated against a set of heuristic algorithms showing that it has potential to give similar results, even in the face of the extra complexity of the heterogeneous cluster.