An optimal sorting algorithm on reconfigurable mesh
暂无分享,去创建一个
[1] Alok Aggarwal. Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses , 1986, IEEE Transactions on Computers.
[2] Gen-Huey Chen,et al. Constant Time Sorting on a Processor Array with a Reconfigurable Bus System , 1990, Inf. Process. Lett..
[3] Isaac D. Scherson,et al. Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.
[4] Sartaj Sahni,et al. Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components , 1991, ICPP.
[5] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.
[6] Dionysios I. Reisis,et al. Data Movement Operations and Applications on Reconfigurable VLSI Arrays , 1988, ICPP.
[7] Viktor K. Prasanna,et al. Information Transfer in Distributed Computing with Applications to VLSI , 1984, JACM.
[8] Sartaj Sahni,et al. Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.
[9] Gen-Huey Chen,et al. Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..
[10] Viktor K. Prasanna,et al. Efficient Parallel Algorithms for Some Geometric Problems on Reconfigurable Mesh , 1992, ICPP.
[11] Quentin F. Stout,et al. Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.
[12] Shahid H. Bokhari,et al. Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.
[13] Quentin F. Stout,et al. Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).