COMPUTATIONAL MODELS AND TASK-SCHEDULING FOR PARALLEL SPARSE CHOLESKY FACTORIZATION

被引：46

作者：

LIU, JWH

机构：

来源：

关键词：

D O I：

10.1016/0167-8191(86)90014-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：327 / 342

页数：16

共 20 条

[1] COMPARISON OF LIST SCHEDULES FOR PARALLEL PROCESSING SYSTEMS [J].

ADAM, TL ;

CHANDY, KM ;

DICKSON, JR .

[2]

Aho A.V., 1983, DATA STRUCTURES ALGO

[3]

ARNOLD CP, 1983, IEEE T COMPUT, V32, P265, DOI 10.1109/TC.1983.1676218

[4]

Coffman E.G., 1976, COMPUTER JOB SHOP SC

DONGARRA, JJ ;

GUSTAVSON, FG ;

KARP, A .

[6]

Duff I. S., 1982, NUMERICAL ANAL DUNDE, V912, P71

[7]

GEORGE A, UNPUB LINEAR ALG APP

[8]

George Alan, 1981, COMPUTER SOLUTION LA

[9]

GONZALEZ MJ, 1977, COMPUT SURV, V9, P173, DOI 10.1145/356698.356700

[10] PARALLEL SEQUENCING AND ASSEMBLY LINE PROBLEMS [J].

HU, TC .