MEMORY-ORIENTED DESIGNS MAXIMIZE THROUGHPUT

被引：0
|
作者：
CAPECE, RP
机构：
来源：
ELECTRONICS | 1977年 / 50卷 / 22期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：104 / &
相关论文
共 50 条
  • [21] Scheduling Parallelizable Jobs Online to Maximize Throughput
    Agrawal, Kunal
    Li, Jing
    Lu, Kefu
    Moseley, Benjamin
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 755 - 776
  • [22] ON THE CHOICE OF BATCH MODE IN ORDER TO MAXIMIZE THROUGHPUT
    WEEDA, PJ
    ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1990, 19 (1-3): : 241 - 247
  • [23] HOW TO MAXIMIZE ION-EXCHANGER THROUGHPUT
    KUONG, JF
    CHEMICAL ENGINEERING, 1969, 76 (27) : 160 - &
  • [24] Stochastic Customer Order Scheduling to Maximize Throughput
    Xu, Xiaoyun
    Zhao, Yaping
    Li, Haidong
    Wu, Manxi
    2015 INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2015, : 665 - 670
  • [25] Prioritized customer order scheduling to maximize throughput
    Zhao, Yaping
    Xu, Xiaoyun
    Li, Haidong
    Liu, Yanni
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (02) : 345 - 356
  • [26] Grooming Traffic to Maximize Throughput in SONET Rings
    Colbourn, Charles J.
    Quattrocchi, Gaetano
    Syrotiuk, Violet R.
    JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2011, 3 (01) : 10 - 16
  • [27] Adaptive allocation of independent tasks to maximize throughput
    Hong, Bo
    Prasanna, Viktor K.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (10) : 1420 - 1435
  • [28] MAXIMIZE THE THROUGHPUT OF AUTOMATIC INSERTION EQUIPMENT.
    Cooper, S.A.
    Electronic Packaging and Production, 1986, 26 (08): : 69 - 71
  • [29] HIGH-THROUGHPUT DATA COMPRESSOR DESIGNS USING CONTENT-ADDRESSABLE MEMORY
    LEE, CY
    YANG, RY
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1995, 142 (01): : 69 - 73
  • [30] Disaggregating Non-Volatile Memory for Throughput-Oriented Genomics Workloads
    Call, Aaron
    Polo, Jorda
    Carrera, David
    Guim, Francesc
    Sen, Sujoy
    EURO-PAR 2018: PARALLEL PROCESSING WORKSHOPS, 2019, 11339 : 613 - 625
12345