TASK-SCHEDULING FOR PARALLEL SPARSE CHOLESKY FACTORIZATION

被引：43

作者：

GEIST, GA ^{[1
]}

NG, E ^{[1
]}

机构：

[1] OAK RIDGE NATL LAB,MATH SCI SECT,OAK RIDGE,TN 37831

来源：

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING | 1989年 / 18卷 / 04期

关键词：

D O I：

10.1007/BF01407861

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：291 / 314

页数：24

共 21 条

[1] PARALLEL IMPLEMENTATION OF MULTIFRONTAL SCHEMES [J].

DUFF, IS .

PARALLEL COMPUTING, 1986, 3 (03) :193-204

[2]

DUFF IS, 1987, CSS211 COMP SCI SYST

[3]

GEIST GA, 1985, ORNL6211 TECHN REP

[4] SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS ON A HYPERCUBE [J].

GEORGE, A ;

HEATH, M ;

LIU, J ;

NG, E .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1989, 27 (1-2) :129-156

[5] COMMUNICATION RESULTS FOR PARALLEL SPARSE CHOLESKY FACTORIZATION ON A HYPERCUBE [J].

GEORGE, A ;

LIU, JWH ;

NG, E .

PARALLEL COMPUTING, 1989, 10 (03) :287-298

[6]

GEORGE A, 1981, COMPUTER SOLUTION LA

[7]

George J., 1973, SIAM J NUMER ANAL, V10, P345, DOI [10.1137/0710032, DOI 10.1137/0710032]

[8]

GEORGE JA, 1989, SIAM REV, V31, P1

[9]

GEORGE JA, 1988, SIAM J SCI STAT COMP, V9, P327

[10]

GEORGE JA, 1986, INT J PARALLEL PROG, V15, P309

← 1 2 3 →