Afficher la notice abrégée

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

hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorKOSOWSKI, Adrian
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorUZNANSKI, Przemyslaw
dc.date.accessioned2024-04-15T09:43:22Z
dc.date.available2024-04-15T09:43:22Z
dc.date.issued2013-08
dc.date.conference2013-08
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197761
dc.description.abstractEnIn single chip multiprocessors (CMP) with grid topologies, a significant part of power consumption is attributed to communications between the cores of the grid. We investigate the problem of routing communications between CMP cores using shortest paths, in a model in which the power cost associated with activating a communication link at a transmission speed of $f$ bytes/second is proportional to $f^\alpha$, for some constant exponent $\alpha > 2$. Our main result is a trade-off showing how the power required for communication in CMP grids depends on the ability to split communication requests between a given pair of node, routing each such request along multiple paths. For a pair of cores in a $m \times n$ grid, the number of available communication paths between them grows exponentially with $n,m$. By contrast, we show that optimal power consumption (up to constant factors) can be achieved by splitting each communication request into $k$ paths, starting from a threshold value of $k = \Theta (n^{1/\left(\alpha-1\right)})$. This threshold is much smaller than $n$ for typical values of $\alpha \approx 3$, and may be considered practically feasible for use in routing schemes on the grid. More generally, we provide efficient algorithms for routing multiple $k$-splittable communication requests between two cores in the grid, providing solutions within a constant approximation of the optimum cost. We support our results with algorithm simulations, showing that for practical instances, our approach using $k$-splittable requests leads to a power cost close to that of the optimal solution with arbitrarily splittable requests, starting from the stated threshold value of $k$.
dc.language.isoen
dc.publisherSpringer
dc.title.enSplittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-642-40047-6_67
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
bordeaux.page671-683
bordeaux.volume8097
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleEuro-Par - 19th International Conference on Parallel Processing
bordeaux.countryDE
bordeaux.conference.cityAachen
bordeaux.peerReviewedoui
hal.identifierhal-00737611
hal.version1
hal.invitednon
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00737611v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2013-08&rft.volume=8097&rft.spage=671-683&rft.epage=671-683&rft.au=KOSOWSKI,%20Adrian&UZNANSKI,%20Przemyslaw&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée