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 条
  • [41] Efficient Computation of MSE Lower Bounds via Matching Pursuit
    Shalom, Shahar Sar
    Tabrikian, Joseph
    2018 IEEE 10TH SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP (SAM), 2018, : 144 - 148
  • [42] Mesh adaptive computation of upper and lower bounds in limit analysis
    Ciria, H.
    Peraire, J.
    Bonet, J.
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2008, 75 (08) : 899 - 944
  • [43] Upper and lower bounds on the cost of a map-reduce computation
    Afrati, F.N. (afrati@softlab.ece.ntua.gr), 1600, Association for Computing Machinery (06):
  • [44] Upper and Lower Bounds on the Cost of a Map-Reduce Computation
    Afrati, Foto N.
    Das Sarma, Anish
    Salihoglu, Semih
    Ullman, Jeffrey D.
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (04): : 277 - 288
  • [45] Local Computation Algorithms for Maximum Matching: New Lower Bounds
    Behnezhad, Soheil
    Roghani, Mohammad
    Rubinstein, Aviad
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 2322 - 2335
  • [46] Spectral Lower Bounds on the I/O Complexity of Computation Graphs
    Jain, Saachi
    Zaharia, Matei
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 329 - 338
  • [47] Information-Theoretic Lower Bounds for Distributed Function Computation
    Xu, Aolin
    Raginsky, Maxim
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (04) : 2314 - 2337
  • [48] Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
    Pietro S. Oliveto
    Carsten Witt
    Algorithmica, 2011, 59 : 369 - 386
  • [49] Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
    Oliveto, Pietro S.
    Witt, Carsten
    ALGORITHMICA, 2011, 59 (03) : 369 - 386
  • [50] Computation of lower and upper bounds for switching activity: A unified approach
    Krishna, V
    Chandramouli, R
    Ranganathan, N
    ELEVENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 1997, : 230 - 233
12345