LOWER BOUNDS FOR SORTING ON MESH-CONNECTED ARCHITECTURES

被引:0
作者
KUNDE, M [1 ]
机构
[1] UNIV KIEL,INST INFORMAT & PRAKT MATH,D-2300 KIEL 1,FED REP GER
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:84 / 95
页数:12
相关论文
共 10 条
  • [1] FOSTER MJ, 1980, IEEE COMPUT, P26
  • [2] KUMAR M, 1983, IEEE T COMPUT, V32, P254, DOI 10.1109/TC.1983.1676217
  • [3] KUNDE M, UNPUB CONPAR 86
  • [4] KUNG HT, 1978, 1978 S SPARS MATR CO
  • [5] LANG HW, 1983, LECT NOTES COMPUT SC, V154, P408
  • [6] NASSIMI D, 1979, IEEE T COMPUT, V28, P2, DOI 10.1109/TC.1979.1675216
  • [7] SADO K, 1985, FAST PARALLEL PSEUDO
  • [8] SCHIMMLER M, 1986, FAST SORTING 3 DIMEN
  • [9] SCHMECK H, 1986, SYSTOLIC S2 WAY MERG
  • [10] SORTING ON A MESH-CONNECTED PARALLEL COMPUTER
    THOMPSON, CD
    KUNG, HT
    [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (04) : 263 - 271