TIME AND PARALLEL PROCESSOR BOUNDS FOR LINEAR RECURRENCE SYSTEMS

被引：47

作者：

CHEN, SC ^{[1
]}

KUCK, DJ ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1975年 / C 24卷 / 07期

关键词：

D O I：

10.1109/T-C.1975.224291

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：701 / 717

页数：17

共 50 条

[1] Parallel solution of linear recurrence systems
Paprzycki, M
Stpiczynski, P
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1996, 76 : 5 - 8
[2] TIME AND PARALLEL PROCESSOR BOUNDS FOR FORTRAN-LIKE LOOPS
BANERJEE, U
CHEN, SC
KUCK, DJ
TOWLE, RA
IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (09) : 660 - 670
[3] Linear time approximation schemes for parallel processor scheduling
Kopidakis, Y
Fayard, D
Zissimopoulos, V
EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 482 - 485
[4] Processor efficient parallel solution of linear systems of equations
Villard, G
JOURNAL OF ALGORITHMS, 2000, 35 (01) : 122 - 126
[5] NEW BOUNDS FOR THE IDENTICAL PARALLEL PROCESSOR WEIGHTED FLOW TIME PROBLEM
WEBSTER, S
MANAGEMENT SCIENCE, 1992, 38 (01) : 124 - 136
[6] IMPROVED TIME AND PARALLEL PROCESSOR BOUNDS FOR FORTRAN-LIKE LOOPS
HEUFT, RW
LITTLE, WD
IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (01) : 78 - 81
[7] PARALLEL ALGORITHMS FOR SOLVING LINEAR RECURRENCE SYSTEMS
STPICZYNSKI, P
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 634 : 343 - 348
[8] TIME LOWER BOUNDS FOR PARALLEL SORTING ON A MESH-CONNECTED PROCESSOR ARRAY
HAN, Y
IGARASHI, Y
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 434 - 443
[9] TIME LOWER BOUNDS FOR PARALLEL SORTING ON A MESH-CONNECTED PROCESSOR ARRAY
HAN, Y
IGARASHI, Y
ACTA INFORMATICA, 1989, 26 (07) : 643 - 655
[10] Denominator Bounds for Higher Order Systems of Linear Recurrence Equations
Middeke, Johannes
Schneider, Carsten
ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 2016, 50 (04): : 185 - 187

← 1 2 3 4 5 →