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{Darte:1994:AP,
author = "Alain Darte and Yves Robert",
title = "On the alignment problem",
journal = j-PARALLEL-PROCESS-LETT,
volume = "4",
number = "3",
pages = "259--270",
month = sep,
year = "1994",
CODEN = "PPLTEE",
ISSN = "0129-6264",
bibdate = "Mon Apr 14 10:50:40 MDT 1997",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Ecole Normale Superieure de Lyon",
affiliationaddress = "LYON, Fr",
classification = "721.1; 722.4; 723.1; 921.4; C1160 (Combinatorial
mathematics); C4240P (Parallel programming and
algorithm theory)",
conflocation = "Wadern, Germany; June 1993",
conftitle = "Parallelization Techniques for Uniform Algorithms
{Workshop}",
corpsource = "Lab. LIP-IMAG, Ecole Normale Superieure de Lyon,
France",
countrypub = "Singapore",
journalabr = "Parallel Process Lett",
keywords = "Affine loop nests; affine loop nests; Alignment;
alignment; Alignment problem; communication;
Communication graph; communication graph; computation
alignment; Computational complexity; computational
complexity; Computational methods; data alignment; Data
transfer; Distributed computer systems; distributed
memory systems; graph; Graphic methods; heuristic;
mapping; Multiprogramming; NP-complete problem; number
minimisation; parallel computers; parallel programming;
Programming theory; programming theory; SPMD
distributed memory; Subroutines; theory; uniform loop
nests",
treatment = "T Theoretical or Mathematical",
}
Related entries
- affine,
2(4)373,
4(3)205,
4(3)271,
5(3)421,
5(4)527,
6(3)401,
7(2)203
- alignment,
3(3)243,
6(1)159,
7(2)195,
8(4)515,
13(4)689
- C1160,
1(1)19,
1(2)125,
1(2)135,
2(1)31,
2(2)195,
2(2)205,
2(2)213,
2(2)231,
2(2)241,
2(2)249,
2(4)301,
3(1)13,
3(1)79,
3(1)99,
3(2)115,
3(2)165,
3(3)209,
3(3)223,
3(3)233,
3(3)253,
3(4)431,
3(4)457,
4(1)29,
4(1)37,
4(1)65,
4(1)105,
4(3)281,
4(4)379,
4(4)385,
4(4)429,
5(1)63,
5(1)81,
5(2)149,
5(2)231,
5(2)293,
5(3)413,
5(4)527,
5(4)599,
5(4)611,
5(4)671,
6(1)35,
6(1)137,
6(1)159,
6(2)213,
6(3)321,
6(3)389,
6(4)439,
6(4)469,
6(4)479,
6(4)539,
6(4)551,
6(4)583,
7(1)25
- combinatorial,
1(1)19,
1(2)125,
1(2)135,
2(1)31,
2(2)195,
2(2)205,
2(2)213,
2(2)231,
2(2)241,
2(2)249,
2(4)301,
3(1)3,
3(1)13,
3(1)25,
3(1)79,
3(1)99,
3(2)115,
3(2)165,
3(3)209,
3(3)223,
3(3)233,
3(3)253,
3(4)431,
3(4)457,
4(1)29,
4(1)37,
4(1)65,
4(1)105,
4(3)281,
4(4)379,
4(4)385,
4(4)429,
5(1)63,
5(1)81,
5(2)149,
5(2)231,
5(2)251,
5(2)293,
5(3)375,
5(3)413,
5(4)527,
5(4)599,
5(4)611,
5(4)671,
6(1)35,
6(1)137,
6(1)159,
6(2)213,
6(3)321,
6(3)389,
6(4)439,
6(4)469,
6(4)479,
6(4)539,
6(4)551,
6(4)583,
7(1)25
- complete, NP-,
1(1)51,
4(3)281,
5(4)599
- computation,
2(2)149,
2(4)321,
2(4)331,
2(4)341,
3(1)19,
3(1)99,
3(2)189,
3(3)301,
3(4)457,
4(1)37,
4(1)73,
4(1)83,
4(1)95,
4(1)171,
4(3)301,
4(3)313,
4(4)429,
4(4)437,
5(1)97,
5(2)311,
5(3)375,
5(3)437,
5(4)527,
5(4)539,
6(1)55,
6(2)203,
6(3)427,
6(4)507,
6(4)575,
7(2)145,
7(2)157,
7(2)169,
7(2)181,
9(4)453,
10(2)189,
11(2)353,
12(3)311,
13(1)65,
13(3)329,
13(3)353
- Darte, Alain,
6(1)145,
7(2)133,
7(4)379
- Graphic,
4(1)149
- heuristic,
4(1)149,
4(3)281,
5(4)599,
5(4)685,
6(1)173,
6(4)551,
9(1)9
- loop,
2(2)273,
3(2)179,
4(3)193,
4(3)205,
4(3)271,
4(3)281,
4(3)301,
4(3)351,
4(3)z,
4(4)391,
5(3)421,
5(4)539,
6(1)173,
6(3)401,
6(4)525,
7(2)133,
7(2)157,
7(2)181,
7(3)259,
7(4)379,
7(4)409,
10(2)153,
10(2)165
- mapping,
1(2)83,
2(1)81,
4(3)205,
4(3)221,
5(4)563,
6(1)145,
6(4)525,
7(2)169,
8(3)407
- mathematics,
1(1)19,
1(2)125,
1(2)135,
2(1)31,
2(1)61,
2(1)81,
2(2)195,
2(2)205,
2(2)213,
2(2)231,
2(2)241,
2(2)249,
2(4)301,
3(1)13,
3(1)79,
3(1)99,
3(2)115,
3(2)165,
3(3)209,
3(3)223,
3(3)233,
3(3)243,
3(3)253,
3(4)431,
3(4)457,
4(1)29,
4(1)37,
4(1)65,
4(1)105,
4(1)171,
4(3)281,
4(4)379,
4(4)385,
4(4)429,
4(4)477,
5(1)3,
5(1)63,
5(1)81,
5(2)149,
5(2)157,
5(2)231,
5(2)251,
5(2)293,
5(3)413,
5(4)527,
5(4)599,
5(4)611,
5(4)671,
6(1)35,
6(1)137,
6(1)159,
6(2)213,
6(3)321,
6(3)365,
6(3)389,
6(4)439,
6(4)469,
6(4)479,
6(4)539,
6(4)551,
6(4)583,
7(1)25,
8(2)149
- memory,
1(1)29,
1(1)59,
1(2)103,
1(2)143,
2(1)51,
2(1)97,
2(2)231,
2(2)241,
2(4)391,
3(1)19,
3(1)29,
3(2)179,
3(3)291,
3(3)301,
3(4)313,
3(4)445,
3(4)495,
4(1)139,
4(1)171,
4(3)233,
4(3)245,
4(3)301,
4(4)405,
4(4)429,
4(4)477,
5(1)3,
5(1)97,
5(2)139,
5(3)375,
5(3)475,
5(4)539,
5(4)635,
5(4)685,
6(1)45,
6(1)67,
6(1)159,
6(2)265,
6(3)365,
6(4)583,
7(1)101,
7(2)145,
7(2)169,
7(2)195,
7(2)203,
8(2)589,
9(1)159,
9(3)347,
10(1)99,
10(2)177,
11(2)341,
11(4)487,
12(3)311,
13(4)721
- method,
3(3)261,
3(3)279,
4(1)45,
4(1)53,
4(1)65,
4(1)73,
4(1)83,
4(1)95,
4(1)105,
4(1)117,
4(1)125,
4(1)139,
4(1)149,
4(1)159,
4(1)171,
4(3)205,
4(3)221,
4(3)245,
4(3)271,
4(3)281,
4(3)301,
4(3)339,
4(4)465,
4(4)477,
5(1)3,
5(2)139,
5(2)149,
5(2)223,
5(2)263,
5(2)293,
5(2)299,
6(1)3,
6(1)13,
6(1)55,
6(1)173,
6(2)251,
6(2)279,
6(3)365,
6(4)491,
7(1)13,
7(1)77,
9(4)467,
10(1)73,
10(1)87,
10(4)359
- minimisation,
6(1)35,
6(1)159,
7(2)157
- Multiprogramming,
4(1)149,
4(3)193,
4(3)233,
4(3)281,
4(3)301,
4(3)313
- nests,
5(3)421,
5(4)539,
6(1)173,
6(3)401
- NP-complete,
1(1)51,
3(1)53,
3(4)457,
4(3)281,
5(3)513,
5(4)599,
7(1)39
- number,
2(4)355,
3(1)71,
3(3)209,
3(4)375,
5(2)321,
7(1)13
- Robert, Yves,
6(1)145,
9(2)197
- SPMD,
4(3)301,
7(2)145
- subroutine,
4(3)221,
4(3)245,
4(3)271,
4(3)281,
4(3)301,
6(1)173,
7(2)133
- transfer,
3(4)381,
4(3)193,
4(3)233,
4(3)281,
4(3)301,
4(4)367,
4(4)465,
4(4)477,
6(3)415,
7(2)145,
8(2)207
- uniform,
1(2)73,
1(2)83,
4(1)95,
4(3)245,
4(3)z,
5(4)551,
8(1)7,
10(4)267