Parallel algorithms for computing linked list prefix

被引：0
|
作者：
机构：
[1] Han, Yijie
来源：
Han, Yijie | 1600年 / 06期
关键词：
Linked Lists - Parallel Algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Efficient parallel prefix algorithms on fully connected message-passing computers
    Lin, YC
    Lin, CM
    [J]. 3RD INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1996, : 316 - 321
  • [42] Revisiting parallel cyclic reduction and parallel prefix-based. algorithms for block tridiagonal systems of equations
    Seal, Sudip K.
    Perumalla, Kalyan S.
    Hirshman, Steven P.
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2013, 73 (02) : 273 - 280
  • [43] Parallel prefix computation
    Saxena, Sanjeev
    Bhatt, P.C.P.
    Prasad, V.C.
    [J]. Parallel processing letters, 1994, 4 (04) : 429 - 436
  • [44] THE POWER OF PARALLEL PREFIX
    KRUSKAL, CP
    RUDOLPH, L
    SNIR, M
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (10) : 965 - 968
  • [45] PARALLEL PREFIX COMPUTATION
    LADNER, RE
    FISCHER, MJ
    [J]. JOURNAL OF THE ACM, 1980, 27 (04) : 831 - 838
  • [46] List scheduling algorithms to minimize the makespan on identical parallel machines
    Ethel Mokotoff
    José Luis Jimeno
    Ana Isabel Gutiérrez
    [J]. Top, 2001, 9 (2) : 243 - 269
  • [47] OPTIMAL PARALLEL ALGORITHMS FOR EXPRESSION TREE EVALUATION AND LIST RANKING
    COLE, R
    VISHKIN, U
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 91 - 100
  • [48] Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums
    Fraser, Sean
    Xu, Helen
    Leiserson, Charles E.
    [J]. 2020 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2020,
  • [49] Computing Moments by Prefix Sums
    Feng Zhou
    Peter Kornerup
    [J]. Journal of VLSI signal processing systems for signal, image and video technology, 2000, 25 : 5 - 17
  • [50] Computing moments by prefix sums
    Zhou, F
    Kornerup, P
    [J]. INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, PROCEEDINGS - VOL III, 1996, : 619 - 622
12345