Evolving OpenMP in an Age of Extreme Parallelism: Preface

被引：0
|
作者：
University of Dresden, Germany [1 ]
不详 [2 ]
不详 [3 ]
机构：
来源：
Lect. Notes Comput. Sci. | 2009年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Preface: Keep Evolving!
    Durham, William H.
    ANNUAL REVIEW OF ANTHROPOLOGY, 2008, 37 : V - VI
  • [42] Evolving Asia Preface
    Santosh, M.
    Jahn, Bor-ming
    JOURNAL OF ASIAN EARTH SCIENCES, 2013, 78 : 1 - 3
  • [43] Extreme levels of parallelism escalate DSP horsepower
    Bursky, D
    ELECTRONIC DESIGN, 1999, 47 (24) : 71 - +
  • [44] Epidemic failure detection and consensus for extreme parallelism
    Katti, Amogh
    Di Fatta, Giuseppe
    Naughton, Thomas
    Engelmann, Christian
    INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2018, 32 (05) : 729 - 743
  • [45] Parallelism Enhancing Cellular Communication - on Knowledge City Evolving
    Hsu, Li-Yen
    2018 13TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2018, : 572 - 577
  • [46] OpenMP as runtime for providing high-level stream parallelism on multi-cores
    Hoffmann, Renato B.
    Loff, Junior
    Griebler, Dalvan
    Fernandes, Luiz G.
    JOURNAL OF SUPERCOMPUTING, 2022, 78 (06) : 7655 - 7676
  • [47] OpenMP as runtime for providing high-level stream parallelism on multi-cores
    Renato B. Hoffmann
    Júnior Löff
    Dalvan Griebler
    Luiz G. Fernandes
    The Journal of Supercomputing, 2022, 78 : 7655 - 7676
  • [48] Hybrid OpenMP-MPI parallelism: porting experiments from small to large clusters
    Ferretti, Marco
    Santangelo, Luigi
    2018 26TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2018), 2018, : 297 - 301
  • [49] Task-Based Parallelism with OpenMP: a case study with DL_POLY_4
    Chalk, Aidan B. G.
    Elena, Alin M.
    MOLECULAR SIMULATION, 2021, 47 (2-3) : 188 - 193
  • [50] The Extreme Value Evolving Predictor
    Ayres, Amanda O. C.
    Von Zuben, Fernando J.
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2022, 30 (03) : 663 - 675
12345