Last update: Wed Sep 26 02:10:29 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
@InProceedings{Venugopal:1992:PDS,
author = "S. Venugopal and V. K. Naik and J. Saltz",
title = "Performance of distributed sparse {Cholesky}
factorization with pre-scheduling",
crossref = "IEEE:1992:PSM",
pages = "52--61",
year = "1992",
bibdate = "Wed Apr 15 15:37:20 MDT 1998",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
NJ, USA",
keywords = "communication complexity; communication costs; data
structures; distributed sparse Cholesky factorization;
intercolumn dependencies; iPSC/860; matrix algebra;
message passing; parallel algorithms; performance;
performance evaluation; prescheduling; symbolic
preprocessing",
sponsororg = "IEEE; ACM",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algebra,
0(0)32,
0(0)42,
0(0)114,
0(0)170,
0(0)180,
0(0)414,
0(0)488,
0(0)538
- algorithm,
0(0)xxiv--848,
0(0)32,
0(0)42,
0(0)64,
0(0)94,
0(0)114,
0(0)132,
0(0)166,
0(0)170,
0(0)180,
0(0)204,
0(0)286,
0(0)358,
0(0)444,
0(0)453,
0(0)488,
0(0)512,
0(0)522,
0(0)538,
0(0)543,
0(0)578,
0(0)778
- C4140,
0(0)32,
0(0)42,
0(0)114,
0(0)170,
0(0)180,
0(0)488,
0(0)538
- C4240P,
0(0)42,
0(0)64,
0(0)132,
0(0)166,
0(0)170,
0(0)180,
0(0)488
- communication,
0(0)104,
0(0)267,
0(0)368,
0(0)394,
0(0)478,
0(0)543,
0(0)692
- complexity,
0(0)301,
0(0)652
- data,
0(0)14,
0(0)73,
0(0)94,
0(0)104,
0(0)230,
0(0)258,
0(0)267,
0(0)326,
0(0)403,
0(0)478,
0(0)512,
0(0)522,
0(0)570,
0(0)638,
0(0)674,
0(0)692,
0(0)772
- distributed,
0(0)xxiv--848,
0(0)104,
0(0)132,
0(0)154,
0(0)162,
0(0)166,
0(0)170,
0(0)214,
0(0)230,
0(0)238,
0(0)267,
0(0)275,
0(0)368,
0(0)488,
0(0)512,
0(0)522,
0(0)543,
0(0)626,
0(0)652,
0(0)692,
0(0)728,
0(0)750,
0(0)760,
0(0)818,
0(0)830
- evaluation,
0(0)xxiv--848,
0(0)4,
0(0)14,
0(0)20,
0(0)32,
0(0)104,
0(0)155,
0(0)166,
0(0)238,
0(0)316,
0(0)336,
0(0)386,
0(0)394,
0(0)403,
0(0)414,
0(0)512,
0(0)642,
0(0)674,
0(0)718,
0(0)750
- factorization,
0(0)42,
0(0)170,
0(0)538
- iPSC/860,
0(0)170,
0(0)238,
0(0)286
- linear,
0(0)32,
0(0)42,
0(0)114,
0(0)170,
0(0)180,
0(0)214,
0(0)414,
0(0)488,
0(0)538,
0(0)551
- matrix,
0(0)xxiv--848,
0(0)32,
0(0)42,
0(0)114,
0(0)170,
0(0)180,
0(0)214,
0(0)414,
0(0)488,
0(0)538,
0(0)578,
0(0)598
- message,
0(0)245,
0(0)502,
0(0)692,
0(0)760
- passing,
0(0)245,
0(0)502,
0(0)760
- performance,
0(0)xxiv--848,
0(0)4,
0(0)14,
0(0)20,
0(0)32,
0(0)94,
0(0)104,
0(0)132,
0(0)155,
0(0)166,
0(0)170,
0(0)230,
0(0)238,
0(0)286,
0(0)316,
0(0)336,
0(0)358,
0(0)386,
0(0)394,
0(0)403,
0(0)414,
0(0)512,
0(0)543,
0(0)570,
0(0)642,
0(0)661,
0(0)674,
0(0)692,
0(0)708,
0(0)718,
0(0)750
- programming,
0(0)xxiv--848,
0(0)4,
0(0)42,
0(0)64,
0(0)114,
0(0)132,
0(0)166,
0(0)170,
0(0)180,
0(0)194,
0(0)204,
0(0)214,
0(0)238,
0(0)245,
0(0)403,
0(0)488,
0(0)502,
0(0)683,
0(0)704,
0(0)808
- Saltz, J.,
0(0)132
- sparse,
0(0)xxiv--848,
0(0)32,
0(0)414,
0(0)551,
0(0)578,
0(0)598
- structure,
0(0)32,
0(0)64,
0(0)94,
0(0)230,
0(0)301,
0(0)433,
0(0)561,
0(0)570,
0(0)692,
0(0)778
- symbolic,
0(0)xxiv--848
- theory,
0(0)42,
0(0)64,
0(0)73,
0(0)83,
0(0)132,
0(0)142,
0(0)166,
0(0)170,
0(0)180,
0(0)294,
0(0)488,
0(0)636