메뉴 건너뛰기




Volumn 32, Issue 2, 1996, Pages 215-222

A novel deterministic sampling scheme with applications to broadcast-efficient sorting on the reconfigurable mesh

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0030077892     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0015     Document Type: Article
Times cited : (17)

References (30)
  • 1
    • 0019055071 scopus 로고
    • Design of massively parallel processor
    • 1. K. E. Batcher, Design of massively parallel processor, IEEE Trans. Comput. C-29 (1980), 836-840.
    • (1980) IEEE Trans. Comput. , vol.C-29 , pp. 836-840
    • Batcher, K.E.1
  • 4
    • 0028447664 scopus 로고
    • Constant time sorting on reconfigurable meshes
    • 4. Y.-C. Chen and W.-T. Chen, Constant time sorting on reconfigurable meshes, IEEE Trans. Comput. C-43 (1994), 749-751.
    • (1994) IEEE Trans. Comput. , vol.C-43 , pp. 749-751
    • Chen, Y.-C.1    Chen, W.-T.2
  • 5
  • 9
    • 0024739189 scopus 로고
    • Polymorphic-torus network
    • 9. H. Li and M. Maresca, Polymorphic-torus network, IEEE Trans. Comput. 38, (1989), 1345-1351.
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 1345-1351
    • Li, H.1    Maresca, M.2
  • 12
    • 0029233331 scopus 로고
    • Reconfigurable buses with shift switching -Concepts and applications
    • 12. R. Lin and S. Olariu, Reconfigurable buses with shift switching -Concepts and applications. IEEE Trans. Parallel Distrib. Systems 6 (1995), 93-102.
    • (1995) IEEE Trans. Parallel Distrib. Systems , vol.6 , pp. 93-102
    • Lin, R.1    Olariu, S.2
  • 16
    • 85027208308 scopus 로고    scopus 로고
    • A constant time sorting algorithm for a three dimensional mesh and reconfigurable network
    • in press
    • 16. M. S. Merry and J. W. Baker, A constant time sorting algorithm for a three dimensional mesh and reconfigurable network, Parallel Process. Lett, in press.
    • Parallel Process. Lett.
    • Merry, M.S.1    Baker, J.W.2
  • 17
    • 0024748711 scopus 로고
    • Connection autonomy in SIMD computers: A VLSI implementation
    • 17. M. Maresca and H. Li, Connection autonomy in SIMD computers: A VLSI implementation, J. Parallel Distrib. Comput. 7 (1989), 302-320.
    • (1989) J. Parallel Distrib. Comput. , vol.7 , pp. 302-320
    • Maresca, M.1    Li, H.2
  • 19
    • 0009789134 scopus 로고
    • A sub-logarithmic time sorting algorithm on a reconfigurable array
    • 19. K. Nakano, T. Masuzawa, and N. Tokura, A sub-logarithmic time sorting algorithm on a reconfigurable array, IEICE Trans. E-74 (1991), 894-901.
    • (1991) IEICE Trans , vol.E-74 , pp. 894-901
    • Nakano, K.1    Masuzawa, T.2    Tokura, N.3
  • 23
    • 0002698478 scopus 로고
    • Integer problems on reconfigurable meshes, with applications
    • 23. S. Olariu, J. L. Schwing, and J. Zhang, Integer problems on reconfigurable meshes, with applications, J. Comput. Software Engrg. 1 (1993), 33-45.
    • (1993) J. Comput. Software Engrg. , vol.1 , pp. 33-45
    • Olariu, S.1    Schwing, J.L.2    Zhang, J.3
  • 24
    • 0024682726 scopus 로고
    • Optimal and sublogarithmic time randomized parallel sorting algorithms
    • 24. S. Rajasekaran and J. H. Reif, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput. 18 (1989), 594-607.
    • (1989) SIAM J. Comput. , vol.18 , pp. 594-607
    • Rajasekaran, S.1    Reif, J.H.2
  • 25
    • 0023213138 scopus 로고
    • A logarithmic time sort for linear size networks
    • 25. J. H. Reif and L. G. Valiant, A logarithmic time sort for linear size networks, J. Assoc. Comput. Mach. 34 (1987), 60-76.
    • (1987) J. Assoc. Comput. Mach. , vol.34 , pp. 60-76
    • Reif, J.H.1    Valiant, L.G.2
  • 26
    • 0024047443 scopus 로고
    • Bus automata, brains, and mental models
    • 26. J. Rothstein, Bus automata, brains, and mental models, IEEE Trans. Systems Man Cybernet. 18 (1988), 522-531.
    • (1988) IEEE Trans. Systems Man Cybernet , vol.18 , pp. 522-531
    • Rothstein, J.1
  • 27
    • 0011421862 scopus 로고
    • Doctoral Dissertation
    • 27. A. Schuster, Doctoral Dissertation, 1991.
    • (1991)
    • Schuster, A.1
  • 28
    • 0003267115 scopus 로고
    • The gated interconnection network for dynamic programming
    • S. K. Tewsburg et al, Eds., Plenum, New York
    • 28. D. B. Shu and J. G. Nash, The gated interconnection network for dynamic programming, in Concurrent Computations (S. K. Tewsburg et al, Eds.), Plenum, New York, 1988.
    • (1988) Concurrent Computations
    • Shu, D.B.1    Nash, J.G.2
  • 29
    • 0025416691 scopus 로고
    • Constant time sorting on a processing array with a reconfigurable bus system
    • 29. B. F. Wang, G.-H. Chen, and F. C. Lin, Constant time sorting on a processing array with a reconfigurable bus system, Inform. Process. Lett. 34 (1990), 187-192.
    • (1990) Inform. Process. Lett. , vol.34 , pp. 187-192
    • Wang, B.F.1    Chen, G.-H.2    Lin, F.C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.