Last update: Fri Jul 8 02:02:43 MDT 2005
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Duato:1993:DDA,
author = "J. Duato",
title = "On the design of deadlock-free adaptive multicast
routing algorithms",
journal = j-PARALLEL-PROCESS-LETT,
volume = "3",
number = "4",
pages = "321--333",
month = dec,
year = "1993",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Mon Apr 14 09:48:53 MDT 1997",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Fac. de Inf., Univ. Politecnica de Valencia, Spain",
countrypub = "Singapore",
keywords = "2D-mesh; concurrency control; cyclic; deadlock-free
adaptive multicast routing algorithms; dependencies;
hypercube networks; hypercube topologies; multicast
communication; sufficient conditions; system recovery;
wormhole networks",
treatment = "P Practical",
}
Related entries
- adaptive,
2(4)347,
3(4)469,
4(1)125,
5(1)49,
9(1)135,
11(4)455,
14(3)327
- C4230M,
1(1)35,
1(1)43,
1(2)113,
1(2)125,
1(2)149,
2(1)3,
2(1)13,
2(1)81,
2(1)89,
2(2)129,
2(2)149,
2(2)161,
2(4)347,
3(1)29,
3(2)109,
3(2)115,
3(2)179,
3(3)253,
3(4)363,
3(4)375,
3(4)393,
3(4)419,
3(4)431,
3(4)445,
3(4)495,
4(1)125,
4(1)139,
4(4)367,
4(4)379,
4(4)385,
5(1)97,
5(2)149,
5(2)213,
5(2)241,
5(2)281,
5(2)321,
5(3)357,
5(3)387,
5(3)401,
5(3)513,
5(4)563,
6(1)87,
6(1)101,
6(1)127,
6(1)137,
6(3)377,
6(3)389,
6(4)469,
6(4)479,
6(4)507,
6(4)551,
7(1)39,
7(1)49,
7(1)57
- C5220P,
1(1)19,
1(1)29,
1(1)43,
1(2)103,
2(1)13,
2(1)81,
2(1)89,
2(1)97,
2(2)117,
2(2)129,
2(2)139,
2(2)257,
2(4)373,
3(1)43,
3(1)59,
3(1)71,
3(2)109,
3(2)115,
3(2)129,
3(2)139,
3(2)171,
3(2)179,
3(2)189,
3(3)291,
3(3)301,
3(4)335,
3(4)357,
3(4)363,
3(4)375,
3(4)393,
3(4)419,
3(4)431,
3(4)445,
3(4)469,
3(4)485,
3(4)495,
4(1)105,
4(1)125,
4(1)139,
4(1)171,
4(3)233,
4(3)329,
4(3)339,
4(4)367,
4(4)379,
4(4)385,
4(4)391,
5(1)3,
5(1)15,
5(1)23,
5(1)37,
5(1)49,
5(1)63,
5(1)81,
5(1)97,
5(1)111,
5(2)213,
5(2)241,
5(2)251,
5(2)281,
5(2)321,
5(3)387,
5(3)401,
5(3)461,
5(3)513,
5(4)563,
5(4)575,
5(4)623,
5(4)635,
5(4)685,
6(1)87,
6(1)145,
6(1)173,
6(3)309,
6(3)355,
6(3)377,
6(3)389,
6(4)507,
7(1)39,
7(1)57
- concurrency,
2(1)21,
2(2)291,
2(4)347,
3(4)469,
4(1)125,
4(1)181,
4(4)391
- condition,
1(2)83,
4(3)339,
8(2)149,
9(1)123
- control,
1(1)51,
1(2)83,
2(1)21,
2(2)265,
2(2)291,
2(4)347,
3(4)445,
3(4)469,
4(1)125,
4(1)181,
4(3)271,
4(4)391,
5(3)499,
6(3)415,
7(2)181,
8(2)231
- cyclic,
2(4)347,
3(4)445,
4(3)301,
4(4)391
- deadlock-free,
2(2)161,
2(4)347
- dependency,
2(4)347,
2(4)373,
4(3)193,
4(3)245,
4(3)281,
4(3)313,
5(2)251,
6(3)427
- design,
2(1)97,
2(2)157,
2(4)347,
3(4)445,
4(3)339,
4(3)351,
4(4)385,
4(4)405,
5(1)97,
5(3)513,
6(3)355,
6(4)539,
6(4)563,
7(3)309,
8(2)549,
13(2)149,
13(3)389,
14(2)241
- Duato, J.,
2(4)347
- free, deadlock-,
2(4)347
- multicast,
2(2)161,
10(4)327,
12(1)31
- recovery,
2(1)21,
2(2)283,
4(1)125,
5(2)321
- routing,
1(1)67,
1(2)113,
2(2)161,
2(4)347,
3(2)109,
3(2)129,
3(4)381,
3(4)393,
3(4)469,
4(1)125,
5(1)63,
5(1)81,
5(2)213,
5(2)281,
6(1)127,
7(1)39,
7(1)57,
7(3)219,
7(3)225,
7(3)237,
7(3)249,
7(3)259,
7(3)267,
8(2)161,
8(2)221,
10(4)327,
13(1)43,
13(4)673,
13(4)705,
14(3)377
- sufficient,
1(2)83
- topology,
2(4)381,
3(3)261,
3(4)445,
3(4)469,
4(4)379,
5(2)213,
5(2)281,
6(1)45,
6(1)55,
6(1)75,
6(1)101,
6(3)355,
6(4)507,
6(4)539,
7(1)77,
8(2)177,
8(2)221
- wormhole,
2(2)161,
2(4)347,
4(1)125,
5(2)213,
5(2)281,
10(1)29,
10(4)295