| Naslov: | An optimal permutation routing algorithm for full-duplex hexagonal mesh networks |
|---|
| Avtorji: | ID Sau Walls, Ignasi (Avtor)
ID Žerovnik, Janez (Avtor) |
|---|
| Datoteke: |  http://www.imfm.si/preprinti/PDF/01017.pdf
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano |
|---|
| Organizacija: | FS - Fakulteta za strojništvo
|
|---|
| Opis: | In the permutation routing problem, each processor is the origin of at most one packet and each processor is the destination of no more than one packet. We study this problem in an hexagonal network (that is, a finite convex subgraph of a triangular grid), a widely used network in practical applications. We use the addressing scheme described by F.G. Nocetti, I. Stojmenovic and J. Zhang (2002, IEEE Trans. on Parallel and Distrib. Systems). In this paper, a distributed optimal routing algorithm for full-duplex hexagonal mesh networks is presented. Furthermore, we prove that this algorithm is oblivious and translation invariant. |
|---|
| Ključne besede: | mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm |
|---|
| Leto izida: | 2006 |
|---|
| Št. strani: | str. 1-15 |
|---|
| Številčenje: | Vol. 44, št. 1017 |
|---|
| PID: | 20.500.12556/DKUM-49378  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDK: | 519.1 |
|---|
| COBISS.SI-ID: | 14600281 |
|---|
| NUK URN: | URN:SI:UM:DK:58NYNOYO |
|---|
| Datum objave v DKUM: | 10.07.2015 |
|---|
| Število ogledov: | 1354 |
|---|
| Število prenosov: | 47 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
