Power-aware Manhattan Routing on Chip Multiprocessors

Abstract

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

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice

“…Remarkably, as shown in [4], this lower bound is tight regardless of the size of the grid, since it can be achieved using a specific routing scheme. We will provide a definition of a scheme called C which has equivalent properties, but is described from a different perspective, based on load balancing on so-called vertex diagonals.…”

“…To simplify the analysis of the model, we discard constant factors, and (following [4]) set the cost of transmission at rate x as C (x) = x α , where α > 2 is an absolute constant of the model (it is reasonable to assume α ≈ 3).…”

“…e.g. [17]), which results in the relation between power cost and transmission speed given as P ∼ f 3 ( [4,5]). Such a model of power consumption was recently studied in the context of splittable Manhattan-path routing by Benoit et al [4].…”

“…[17]), which results in the relation between power cost and transmission speed given as P ∼ f 3 ( [4,5]). Such a model of power consumption was recently studied in the context of splittable Manhattan-path routing by Benoit et al [4]. They introduced several routing schemes in an effort to minimize the total power cost, but observed that this may require the splitting of each communication request, and routing its fragments along a potentially very large number of communication paths.…”

“…We briefly outline the theory of Manhattan-path routing with arbitrarily splittable requests (Max-MP). We provide an optimal convex programming formulation of the problem, leading to a routing scheme denoted as OPT, and recall the properties of the C routing scheme introduced in [4]. We also provide a convenient formulation of Manhattan routings in terms of transmission through nodes.…”