Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10700Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Dimakopoulos, V. V. | en |
| dc.contributor.author | Dimopoulos, N. J. | en |
| dc.date.accessioned | 2015-11-24T17:00:03Z | - |
| dc.date.available | 2015-11-24T17:00:03Z | - |
| dc.identifier.issn | 1045-9219 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10700 | - |
| dc.rights | Default Licence | - |
| dc.subject | cayley graphs | en |
| dc.subject | collective communications | en |
| dc.subject | interconnection networks | en |
| dc.subject | node-invariant algorithms | en |
| dc.subject | total exchange (all-to-allpersonalized communication) | en |
| dc.subject | cube-connected cycles | en |
| dc.subject | interconnection networks | en |
| dc.subject | communication algorithms | en |
| dc.subject | hypercubes | en |
| dc.subject | star | en |
| dc.title | Optimal total exchange in Cayley graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2001 | - |
| heal.abstract | Consider an interconnection network and the following situation: Every node needs to send a different message to every other node. This is the total exchange or all-to-all personalized communication problem, one of a number of information dissemination problems known as collective communications. Under the assumption that a node can send and receive only one message at each step (single-port model), it is seen that the minimum time required to solve the problem is governed by the status (or total distance) of the nodes in the network. We present here a time-optimal solution for any Cayley network. Rings, hypercubes, cube-connected cycles, and butterflies are some well-known Cayley networks which can take advantage of our method. The solution is based on a class of algorithms which we call node-invariant algorithms and which behave uniformly across the network. | en |
| heal.journalName | IEEE Transactions on Parallel and Distributed Systems | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Dimakopoulos-2001-Optimal Total Exchange in cayley graphs.pdf | 296.13 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
