Optimal permutation routing for low-dimensional hypercubes

Networks ◽  
2009 ◽  
Vol 55 (2) ◽  
pp. 149-167
Author(s):  
Ambrose K. Laing ◽  
David W. Krumme
Keyword(s):  
Optimal Permutation ◽  
Low Dimensional ◽  
Permutation Routing

TIME LOWER BOUNDS FOR PERMUTATION ROUTING ON MULTI-DIMENSIONAL BUSED MESHES

1993 ◽  
Vol 03 (02) ◽  
pp. 129-138
Author(s):  
STEVEN CHEUNG ◽  
FRANCIS C.M. LAU
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Three Dimensional ◽  
Dimensional Case ◽  
Routing Problem ◽  
Higher Dimensional ◽  
Low Dimensional ◽  
Permutation Routing

We present time lower bounds for the permutation routing problem on three- and higher-dimensional n x…x n meshes with buses. We prove an (r–1)n/r lower bound for the general case of an r-dimensional bused mesh, r≥2, which is not as strong for low-dimensional as for higher-dimensional cases. We then use a different approach to construct a 0.705n lower bound for the three-dimensional case.

scholarly journals Some permutation routing algorithms for low-dimensional hypercubes

2002 ◽  
Vol 270 (1-2) ◽  
pp. 111-124 ◽  
Author(s):  
F.K. Hwang ◽  
Y.C. Yao ◽  
B. Dasgupta
Keyword(s):  
Routing Algorithms ◽  
Low Dimensional ◽  
Permutation Routing

scholarly journals An optimal permutation routing algorithm on full-duplex hexagonal networks

2008 ◽  
Vol Vol. 10 no. 3 (Distributed Computing and...) ◽  
Author(s):  
Ignasi Sau ◽  
Janez Žerovnik
Keyword(s):  
Distributed Computing ◽  
Routing Algorithm ◽  
Full Duplex ◽  
Triangular Grid ◽  
Translation Invariant ◽  
Routing Problem ◽  
Practical Applications ◽  
Optimal Permutation ◽  
International Audience ◽  
Permutation Routing

Distributed Computing and Networking International audience 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 on full-duplex hexagonal networks, using the addressing scheme described by F.G. Nocetti, I. Stojmenovic and J. Zhang (IEEE TPDS 13(9): 962-971, 2002). Furthermore, we prove that this algorithm is oblivious and translation invariant.

Thermoelectric Properties of PbSr(Se,Te)-Based Low Dimensional Structures

2000 ◽  
Vol 626 ◽  
Author(s):  
Harald Beyer ◽  
Joachim Nurnus ◽  
Harald Böttner ◽  
Armin Lambrecht ◽  
Lothar Schmitt ◽  
...  
Keyword(s):  
Thermal Conductivity ◽  
Thermoelectric Properties ◽  
Power Factor ◽  
Evaluation Method ◽  
Interband Transition ◽  
Multiple Quantum Well ◽  
Calculated Data ◽  
Multiple Quantum ◽  
Ir Transmission ◽  
Low Dimensional

ABSTRACTThermoelectric properties of low dimensional structures based on PbTe/PbSrTe-multiple quantum-well (MQW)-structures with regard to the structural dimensions, doping profiles and levels are presented. Interband transition energies and barrier band-gap are determined from IR-transmission spectra and compared with Kronig-Penney calculations. The influence of the data evaluation method to obtain the 2D power factor will be discussed. The thermoelectrical data of our layers show a more modest enhancement in the power factor σS2 compared with former publications and are in good agreement with calculated data from Broido et al. [5]. The maximum allowed doping level for modulation doped MQW structures is determined. Thermal conductivity measurements show that a ZT enhancement can be achieved by reducing the thermal conductivity due to interface scattering. Additionally promising lead chalcogenide based superlattices for an increased 3D figure of merit are presented.

Sign in / Sign up

Export Citation Format

Share Document