| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
An optimal permutation routing algorithm for full-duplex hexagonal mesh networks
Ignasi Sau Walls, Janez Žerovnik, 2006

Abstract: 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.
Keywords: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Published: 10.07.2015; Views: 405; Downloads: 21
URL Link to full text

2.
An optimal permutation routing algorithm on full-duplex hexagonal networks
Ignasi Sau Walls, Janez Žerovnik, 2008, original scientific article

Abstract: In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations, under the constraint that each link can be crossed simultaneously by no more than one packet. We study this problem in a hexagonal network, i.e. a finite subgraph of a triangular grid, which is a widely used network in practical applications. We present an optimal distributed permutation routing algorithm for full-duplex hexagonal networks, using the addressing scheme described by Nocetti et al. Furthermore, we prove that this algorithm is oblivious and translation invariant.
Keywords: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Published: 10.07.2015; Views: 420; Downloads: 68
.pdf Full text (535,46 KB)
This document has many files! More...

Search done in 0.03 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica