Entry Robert:1989:OSA from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
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{Robert:1989:OSA,
author = "Yves Robert and Denis Trystram",
title = "Optimal scheduling algorithms for parallel {Gaussian}
elimination",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "2",
pages = "159--173",
day = "7",
month = may,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "CNRS",
affiliationaddress = "Grenoble, Fr",
classification = "723; 921; C1160 (Combinatorial mathematics); C4140
(Linear algebra); C4240 (Programming and algorithm
theory)",
corpsource = "Lab. TIM3, INPG, CNRS, Grenoble, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Asymptotically Optimal Algorithms;
asymptotically optimal algorithms; computational
complexity; Computer Programming; Computer Systems,
Digital--Parallel Processing; Gaussian Elimination;
graph theory; linear algebra; Mathematical
Techniques--Graph Theory; Optimal Scheduling
Algorithms; optimisation; Parallel Algorithms; parallel
algorithms; parallel Gaussian elimination; parallelism;
Scheduling; scheduling; scheduling algorithms; shared
memory system; simd/mimd Computers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algebra,
35(1)89,
35(2)329,
36(2)203,
37(1)77,
37(3)269,
39(1)69,
39(2)135,
40(2)329,
41(1)109,
43(1)117,
43(2)123,
43(2)149,
43(2)189,
44(3)333,
46(1)67,
46(2)285,
50(2)137,
50(3)323,
51(1)229,
51(3)331,
52(1)59,
52(3)307,
53(1)125,
53(1)z,
54(1)65,
54(1)103,
56(1)37,
57(1)3,
57(1)147,
58(1)17,
59(3)277,
63(3)253,
63(3)275,
64(2)135,
65(2)243,
67(1)87,
67(1)115,
68(3)347
- C4140,
54(1)65,
64(2)135,
65(2)243
- Digital--Parallel,
58(1)249,
58(1)347,
59(3)277,
59(3)297,
61(2)121,
61(2)199,
64(2)191,
64(3)271,
66(0)117,
66(2)117
- elimination,
63(3)253,
64(2)135
- Gaussian,
53(1)99,
53(1)z,
64(2)135
- Graph, Techniques-,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
67(1)5
- linear,
35(1)109,
35(2)261,
37(2)123,
38(1)69,
39(1)69,
39(1)z,
40(1)31,
40(1)67,
40(2)195,
40(2)257,
41(2)231,
41(2)325,
43(1)11,
43(2)345,
47(3)237,
47(3)277,
47(3)329,
48(1)35,
49(1)81,
50(1)1,
54(1)65,
54(2)199,
57(2)161,
57(2)317,
58(1)209,
59(0)3,
59(1)157,
59(3)309,
60(3)255,
60(3)341,
63(3)275,
64(1)97,
64(2)135,
65(2)221,
65(2)243,
65(2)z,
67(1)55,
68(3)333
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- memory,
36(2)231,
47(1)15,
48(1)53,
48(2)201,
51(1)239,
58(1)183
- optimal,
39(1)15,
39(1)z,
45(1)63,
53(2)281,
53(2)295,
59(3)259,
59(3)297,
61(1)33,
63(2)203,
64(1)83,
64(1)125,
66(1)105,
66(2)137,
66(2)157,
67(1)5
- optimisation,
37(2)151,
40(1)67,
45(1)87,
49(1)81,
51(1)53,
54(1)87,
54(1)129,
59(3)297,
63(3)295,
64(1)107
- Parallel, Digital-,
58(1)249,
58(1)347,
59(3)277,
59(3)297,
61(2)121,
61(2)199,
64(2)191,
64(3)271,
66(0)117,
66(2)117
- parallelism,
37(3)245,
37(3)305,
45(1)1,
57(2)161,
58(1)3
- processing,
35(2)191,
36(2)173,
37(2)183,
37(3)245,
37(3)305,
39(1)47,
39(2)107,
43(1)31,
43(1)43,
43(2)213,
43(2)277,
48(2)145,
49(2)145,
49(2)171,
49(2)267,
50(3)241,
51(1)239,
52(1)155,
52(3)193,
53(2)281,
54(1)53,
55(2)291,
57(0)3,
57(1)131,
58(1)143,
58(1)183,
58(1)249,
58(1)347,
59(3)259,
59(3)277,
59(3)297,
61(2)121,
61(2)199,
62(1)67,
62(1)123,
62(3)251,
63(1)91,
64(1)83,
64(1)125,
64(2)135,
64(2)175,
64(2)191,
64(3)271,
65(2)249,
66(0)117,
66(2)117,
66(2)181,
68(3)343,
69(1)1
- scheduling,
37(2)217,
45(1)87,
64(2)203
- shared,
48(1)53,
51(1)239,
52(3)193
- Techniques--Graph,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
67(1)5