Routing of guaranteed throughput traffic in a network-on-chip

This paper examines the possibilities of providing throughput guarantees in a network-on-chip by appropriate traffic routing. A source routing function is used to find routes with specified throughput for the data streams in a streaming multiprocessor system-on-chip. The influence of the routing algorithm, network topology and communication locality on the routing performance are studied. The results show that our method for providing throughput guarantees to streaming traffic is feasible. The communication locality has the strongest influence on the routing performance while the routing algorithm has weakest influence. Therefore, the mapping algorithm is of greater importance for the system performance than the routing algorithm and it is profitable to use a more complex mapping algorithm that preserves the communication locality together with a simple routing algorithm

OFAR-CM: Efficient Dragonfly networks with simple congestion management

Dragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provide high throughput with low diameter and moderate cost. However, they are prone to congestion under certain frequent traffic patterns that saturate specific network links. Adaptive non-minimal routing can be used to avoid such congestion. That kind of routing employs longer paths to circumvent local or global congested links. However, if a distance-based deadlock avoidance mechanism is employed, more Virtual Channels (VCs) are required, what increases design complexity and cost. OFAR (On-the-Fly Adaptive Routing) is a previously proposed routing that decouples VCs from deadlock avoidance, making local and global misrouting affordable. However, the severity of congestion with OFAR is higher, as it relies on an escape sub network with low bisection bandwidth. Additionally, OFAR allows for unlimited misroutings on the escape sub network, leading to unbounded paths in the network and long latencies. In this paper we propose and evaluate OFAR-CM, a variant of OFAR combined with a simple congestion management (CM) mechanism which only relies on local information, specifically the credit count of the output ports in the local router. With simple escape sub networks such as a Hamiltonian ring or a tree, OFAR outperforms former proposals with distance-based deadlock avoidance. Additionally, although long paths are allowed in theory, in practice packets arrive at their destination in a small number of hops. Altogether, OFAR-CM constitutes the first practicable mechanism to the date that supports both local and global misrouting in Dragonfly networks.The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. ERC-2012-Adg-321253- RoMoL, the Spanish Ministry of Science under contracts TIN2010-21291-C02-02, TIN2012-34557, and by the European HiPEAC Network of Excellence. M. García participated in this work while affiliated with the University of Cantabria.Peer ReviewedPostprint (author's final draft

Constructing virtual 5-dimensional tori out of lower-dimensional network cards

[EN] In the Top500 and Graph500 lists of the last years, some of the most powerful systems implement a torus topology to interconnect themillions of computing nodes they include. Some of these torus networks are of five or six dimensions, which implies an additional difficulty as the node degree increases. In previous works, we proposed and evaluated the nD Twin (nDT) torus topology to virtually increase the dimensions a torus is able to implement. We showed that this new topology reduces the distances between nodes, increasing, therefore, global network performance. In this work, we present how to build a 5DT torus network using a specific commercial 6-port network card (EXTOLL card) to interconnect those nodes. We show, using the same number of cards, that the performance of the 5DT torus network we are able to implement using our proposal is higher than the performance of the 3D torus network for the same number of compute nodes.Spanish MINECO; European Commission, Grant/Award Number: TIN2015-66972-C5-1-R and TIN2015-66972-C5-2-R; JCCM, Grant/Award Number: PEII-2014-028-P; Spanish MICINN, Grant/Award Number: FJCI-2015-26080Andújar-Muñoz, FJ.; Villar, JA.; Sanchez Garcia, JL.; Alfaro Cortes, FJ.; Duato Marín, JF.; Fröning, H. (2017). Constructing virtual 5-dimensional tori out of lower-dimensional network cards. Concurrency and Computation Practice and Experience. 1-17. https://doi.org/10.1002/cpe.4361S11

Extending Wireless Powered Communication Networks for Future Internet of Things

Energy limitation has always been a major concern for long-term operation of wireless networks. With today's exponential growth of wireless technologies and the rapid movement towards the so-called Internet of Things (IoT), the need for a reliable energy supply is more tangible than ever. Recently, energy harvesting has gained considerable attention in research communities as a sustainable solution for prolonging the lifetime of wireless networks. Beside conventional energy harvesting sources such as solar, wind, vibration, etc. harvesting energy from radio frequency (RF) signals has drawn significant research interest in recent years as a promising way to overcome the energy bottleneck. Lately, the integration of RF energy transfer with wireless communication networks has led to the emergence of an interesting research area, namely, wireless powered communication network (WPCN), where network users are powered by a hybrid access point (HAP) which transfers wireless energy to the users in addition to serving the functionalities of a conventional access point. The primary aim of this thesis is to extend the baseline model of WPCN to a dual-hop WPCN (DH-WPCN) in which a number of energy-limited relays are in charge of assisting the information exchange between energy-stable users and the HAP. Unlike most of the existing research in this area which has merely focused on designing methods and protocols for uplink communication, we study both uplink and downlink information transmission in the DH-WPCN. We investigate sum-throughput maximization problems in both directions and propose algorithms for optimizing the values of the related parameters. We also tackle the doubly near-far problem which occurs due to unequal distance of the relays from the HAP by proposing a fairness enhancement algorithm which guarantees throughput fairness among all users

Efficient processor management strategies for multicomputer systems

Multicomputers are cost-effective alternatives to the conventional supercomputers. Contemporary processor management schemes tend to underutilize the processors and leave many of the processors in the system idle while jobs are waiting for execution;Instead of designing faster processors or interconnection networks, a substantial performance improvement can be obtained by implementing better processor management strategies. This dissertation studies the performance issues related to the processor management schemes and proposes several ways to enhance the multicomputer systems by means of processor management. The proposed schemes incorporate the concepts of size-reduction, non-contiguous allocation, as well as job migration. Job scheduling using a bypass-queue is also studied. All the proposed schemes are proven effective in improving the system performance via extensive simulations. Each proposed scheme has different implementation cost and constraints. In order to take advantage of these schemes, judicious selection of system parameters is important and is discussed

Analytical Queue Modeling for Network-on-Chip Router

Routers are important modules in any Networks- on-Chip (NoC)-based design. In order to achieve an satisfactory performance, routers must be designed to match network inter- module traffic. One of the most important methods to accomplish this matching is to improve the throughput and minimize the packet loss and router delay. An early approximation of the router delay is essentially required to aid designers to determine the system timing constrains at the higher levels of abstraction. This paper presents an analytical queue model for NoC routers. Furthermore, it explains how this model can be employed to study the consequence of changing the output traffic and queue size on the router in term of throughput, efficiency, packet loss probability and waiting time. The proposed model implemented a simple M/M/1/B markov chain as queuing model