Dynamic power saving in fat-tree interconnection networks using on/off links

Alonso, Marina; Coll, S; Martínez, J.M.; Santonja, V.; López, Pedro; Duato, J.

doi:10.1109/ipdps.2006.1639599

Cited by 20 publications

(14 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Among hardware based approaches, power management of interconnection networks using on/off links has been studied [3,18,19]. On/off links, which refers to shutting down communication links that are not being used, has shown to be a useful method to save power.…”

Section: A Related Workmentioning

confidence: 99%

Toward Runtime Power Management of Exascale Networks by on/off Control of Links

Totoni

Jain

Kalé

2013

2013 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum

View full text Add to dashboard Cite

Abstract-Higher radix networks, such as high-dimensional tori and multi-level directly connected networks, are being used for supercomputers as they become larger but need lower diameter. These networks have more resources (e.g. links) in order to provide good performance for a range of applications. We observe that a sizeable fraction of the links in the interconnect are never used or underutilized during execution of common parallel applications. Thus, in order to save power, we propose addition of hardware support for on/off control of links in software and their management using adaptive runtime systems.We study the effectiveness of our approach using real applications (NAMD, MILC), and application benchmarks (NAS Parallel Benchmarks, Jacobi). They are simulated on representative networks such as 6-D Torus and IBM PERCS (similar to Dragonfly). For common applications, our approach can save up to 16% of total machine's power and energy, without any performance penalty.

show abstract

Section: A Related Workmentioning

confidence: 99%

Toward Runtime Power Management of Exascale Networks by on/off Control of Links

Totoni

Jain

Kalé

2013

2013 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum

View full text Add to dashboard Cite

show abstract

“…Dynamic Voltage and Frequency Scaling (DVFS) and turning off unused links are among the most efficient techniques that can take advantage of the variation in traffic to reduce power [17,1,10]. Static knowledge of the traffic patterns obtained by compiler analysis was also used to optimize the frequency/voltage scaling of the individual interconnection links in the network [11].…”

Section: Related Workmentioning

confidence: 99%

“…k , the ideal way to map those communications is to distribute them among all the communication links from D (1) k to D (1) k+1 (see Figure 3). Such a splitting cannot be achieved but provides a bound on how to load-balance the communication across the links.…”

Section: Rr N°7752mentioning

confidence: 99%

Power-aware Manhattan Routing on Chip Multiprocessors

Benoît

Melhem

Renaud-Goud

et al. 2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

Abstract:We investigate the routing of communications in chip multiprocessors (CMPs). The goal is to find a valid routing in the sense that the amount of data routed between two neighboring cores does not exceed the maximum link bandwidth while the power dissipated by communications is minimized. Our position is at the system level: we assume that several applications, described as task graphs, are executed on a CMP, and each task is already mapped to a core. Therefore, we consider a set of communications that have to be routed between the cores of the CMP. We consider a classical model, where the power consumed by a communication link is the sum of a static part and a dynamic part, with the dynamic part depending on the frequency of the link. This frequency is scalable and it is proportional to the throughput of the link. The most natural and widely used algorithm to handle all these communications is XY routing: for each communication, data is first forwarded horizontally, and then vertically, from source to destination. However, if it is allowed to use all Manhattan paths between the source and the destination, the consumed power can be reduced dramatically. Moreover, some solutions may be found while none existed with the XY routing. In this paper, we compare XY routing and Manhattan routing, both from a theoretical and from a practical point of view. We consider two variants of Manhattan routing: in single-path routing, only one path can be used for each communication, while multi-paths routing allows to split a communication between different routes. We establish the NP-completeness of the problem of finding a Manhattan routing that minimizes the dissipated power, we exhibit the minimum upper bound of the ratio power consumed by an XY routing over power consumed by a Manhattan routing, and finally we perform simulations to assess the performance of Manhattan routing heuristics that we designed.Key-words: routing; chip multiprocessor; energy; power; Manhattan; singlepath; multi-paths; complexity. inria-00629804, version 2 -6 Oct 2011Routage de Manhattan minimisant la puissance dissipée sur des processeurs multi-coeurs

show abstract

“…On the other hand, to reduce power consumption some frequency/voltage scaling techniques [2], [17] are usually applied. Both factors, cost reduction and power saving, lead to a higher network utilization.…”

Section: Introductionmentioning

confidence: 99%

Progressive Congestion Management Based on Packet Marking and Validation Techniques

Ferrer

Baydal

Robles

et al. 2012

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-Congestion management in multistage interconnection networks is a serious problem, which is not solved completely. In order to avoid the degradation of network performance when congestion appears, several congestion management mechanisms have been proposed. Most of these mechanisms are based on explicit congestion notification. For this purpose, switches detect congestion and depending on the applied strategy, packets are marked to warn the source hosts. In response, source hosts apply some corrective actions to adjust their packet injection rate. Although these proposals seem quite effective, they either exhibit some drawbacks or are partial solutions. Some of them introduce some penalties over the flows not responsible for congestion, whereas others can cope only with congestion situations that last for a short time. In this paper, we present an overview of the different strategies to detect and correct congestion in multistage interconnection networks, and propose a new mechanism referred to as Marking and Validation Congestion Management (MVCM), targeted to this kind of lossless networks, and based on a more refined packet marking strategy combined with a fair set of corrective actions, that makes the mechanism able to effectively manage congestion regardless of the congestion degree. Evaluation results show the effectiveness and robustness of the proposed mechanism.

show abstract

Dynamic power saving in fat-tree interconnection networks using on/off links

Cited by 20 publications

References 17 publications

Toward Runtime Power Management of Exascale Networks by on/off Control of Links

Toward Runtime Power Management of Exascale Networks by on/off Control of Links

Power-aware Manhattan Routing on Chip Multiprocessors

Progressive Congestion Management Based on Packet Marking and Validation Techniques

Contact Info

Product

Resources

About