COMPUTATION OF LOWER BOUNDS FOR MULTIPROCESSOR SCHEDULES

被引：6

作者：

FERNANDEZ, EB

LANG, T

机构：

[1] UNIV CALIF,COMP SCI DEPT,LOS ANGELES,CA 90024

[2] IBM CORP,SCI CTR,DATA PROC DIV,1930 CENTURY PK W,LOS ANGELES,CA 90067

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1975年 / 19卷 / 05期

关键词：

D O I：

10.1147/rd.195.0435

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：435 / 444

页数：10

共 50 条

[31] LOWER BOUNDS FOR ALGEBRAIC COMPUTATION TREES WITH INTEGER INPUTS
YAO, ACC
SIAM JOURNAL ON COMPUTING, 1991, 20 (04) : 655 - 668
[32] Complexity lower bounds for approximation algebraic computation trees
Cucker, F
Grigoriev, D
JOURNAL OF COMPLEXITY, 1999, 15 (04) : 499 - 512
[33] LOWER BOUNDS FOR THRESHOLD AND SYMMETRICAL FUNCTIONS IN PARALLEL COMPUTATION
AZAR, Y
SIAM JOURNAL ON COMPUTING, 1992, 21 (02) : 329 - 338
[34] Lower bounds on the computational power of an optical model of computation
Woods, D
Gibson, JP
UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2005, 3699 : 237 - 250
[35] Numerical computation of Lower bounds of Structured Singular Values
Anwar, M. Fazeel
Rehman, Mutti-Ur
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2018, 11 (03): : 844 - 868
[36] Upper and lower bounds on the makespan of schedules for tree dags on linear arrays
Kalpakis, K.
Yesha, Y.
Algorithmica (New York), 1999, 23 (02): : 159 - 179
[37] Upper and lower bounds on the makespan of schedules for tree dags on linear arrays
Kalpakis, K
Yesha, Y
ALGORITHMICA, 1999, 23 (02) : 159 - 179
[38] Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays
K. Kalpakis
Y. Yesha
Algorithmica, 1999, 23 : 159 - 179
[39] SEPARATION AND LOWER BOUNDS FOR ROM AND NONDETERMINISTIC MODELS OF PARALLEL COMPUTATION
LI, M
YESHA, Y
INFORMATION AND COMPUTATION, 1987, 73 (02) : 102 - 128
[40] TREATMENT OF LOWER AND UPPER VARIABLE BOUNDS IN LINEAR PROGRAMMING COMPUTATION
MULLERME.H
ELECTRONISCHE DATENVERARBEITUNG, 1969, 11 (04): : 153 - &

← 1 2 3 4 5 →