Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10793Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Dimakopoulos, V. V. | en |
| dc.date.accessioned | 2015-11-24T17:00:37Z | - |
| dc.date.available | 2015-11-24T17:00:37Z | - |
| dc.identifier.issn | 0743-7315 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10793 | - |
| dc.rights | Default Licence | - |
| dc.subject | collective communications | en |
| dc.subject | interconnection networks | en |
| dc.subject | cartesian product networks | en |
| dc.subject | all-port model | en |
| dc.subject | total exchange | en |
| dc.subject | personalized communication | en |
| dc.subject | algorithms | en |
| dc.subject | hypercubes | en |
| dc.subject | meshes | en |
| dc.subject | tori | en |
| dc.title | All-port total exchange in cartesian product networks | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.jpdc.2004.06.001 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | We present a general solution to the total exchange (TE) communication problem for any homogeneous multidimensional network under the all-port assumption. More specifically, we consider cartesian product networks where every dimension is the same graph (e.g. hypercubes, square meshes, n-ary d-cubes) and where each node is able to communicate simultaneously with all its neighbors. We show that if we are given an algorithm for a single n-node dimension which requires T steps, we can construct an algorithm for d-dimensions and running time of n(d-1)T steps, which is provably optimal for many popular topologies. Our scheme, in effect, generalizes the TE algorithm given by Bertsekas et al. (J. Parallel Distrib. Comput. 11 (1991) 263-275) for the hypercubes and complements our theory (IEEE Trans. Parallel Distrib. Systems 9(7) (1998) 639) for the single-port model. (C) 2004 Elsevier Inc. All rights reserved. | en |
| heal.journalName | Journal of Parallel and Distributed Computing | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Dimakopoulos-2004-All-port total excha.pdf | 483.92 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
