DETERMINISTIC PARALLEL LIST RANKING

被引：0
|
作者：
ANDERSON, RJ [1 ]
MILLER, GL [1 ]
机构：
[1] UNIV SO CALIF,DEPT COMP SCI,LOS ANGELES,CA 90089
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 319卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：81 / 90
页数：10
相关论文
共 50 条
  • [31] List-ranking on interconnection networks
    Sibeyn, JF
    INFORMATION AND COMPUTATION, 2003, 181 (02) : 75 - 87
  • [32] Parallel Field Ranking
    Ji, Ming
    Lin, Binbin
    He, Xiaofei
    Cai, Deng
    Han, Jiawei
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2013, 7 (03)
  • [33] Deterministic parallel processing
    Panesar, Gajinder
    Towner, Daniel
    Duller, Andrew
    Gray, Alan
    Robbins, Will
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2006, 34 (04) : 323 - 341
  • [34] Deterministic Parallel Processing
    Gajinder Panesar
    Daniel Towner
    Andrew Duller
    Alan Gray
    Will Robbins
    International Journal of Parallel Programming, 2006, 34 : 323 - 341
  • [35] Parallel Roles for Practical Deterministic Parallel Programming
    Faes, Michael
    Gross, Thomas R.
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, LCPC 2017, 2019, 11403 : 163 - 181
  • [36] Germany's position on the ranking list of repositories
    Kuhn, K
    ATW-INTERNATIONALE ZEITSCHRIFT FUR KERNENERGIE, 1996, 41 (10): : 627 - 631
  • [37] Efficient list ranking algorithms on reconfigurable mesh
    Kim, SR
    Park, K
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 262 - 271
  • [38] Ranking List Dispersion as a Query Performance Predictor
    Perez-Iglesias, Joaquin
    Araujo, Lourdes
    ADVANCES IN INFORMATION RETRIEVAL THEORY, 2009, 5766 : 371 - 374
  • [39] Efficient list ranking on the reconfigurable mesh, with applications
    Hayashi, T
    Nakano, K
    Olariu, S
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 326 - 335
  • [40] Efficient list ranking on the reconfigurable mesh, with applications
    Hayashi, T
    Nakano, K
    Olariu, S
    THEORY OF COMPUTING SYSTEMS, 1998, 31 (05) : 593 - 611
12345