The Power of Recon guration
暂无分享,去创建一个
[1] Harry F. Jordan,et al. A multi-microprocessor system for finite element structural analysis , 1979 .
[2] C. Thomborson,et al. A Complexity Theory for VLSI , 1980 .
[3] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[4] Lawrence Snyder,et al. Introduction to the configurable, highly parallel computer , 1982, Computer.
[5] Quentin F. Stout,et al. Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.
[6] Thompson. The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.
[7] Shahid H. Bokhari,et al. Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.
[8] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[9] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.
[10] Viktor K. Prasanna,et al. Array Processor with Multiple Broadcasting , 1985, ISCA.
[11] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..
[12] Alok Aggarwal. Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses , 1986, IEEE Transactions on Computers.
[13] Cauligi S. Raghavendra,et al. HMESH: A VLSI Architecture for Parallel Processing , 1986, CONPAR.
[14] Paul Beame,et al. Limits on the power of concurrent-write parallel machines , 1986, STOC '86.
[15] David A. Mix Barrington,et al. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.
[16] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[17] Johan Håstad,et al. Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.
[18] Richard M. Karp,et al. A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .
[19] H. Scott Hinton,et al. Architectural considerations for photonic switching networks , 1988, IEEE J. Sel. Areas Commun..
[20] Rod C. Alferness. Waveguide electrooptic switch arrays , 1988, IEEE J. Sel. Areas Commun..
[21] Pierre Siron,et al. A reconfigurable optical interconnection network for highly parallel architecture , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.
[22] J. P. Gray,et al. Configurable hardware: a new paradigm for computation , 1989 .
[23] Amotz Bar-Noy,et al. Square meshes are not always optimal , 1989, SPAA '89.
[24] Richard J. Lipton,et al. Subquadratic simulations of circuits by branching programs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[25] Hungwen Li,et al. Connection Autonomy in SIMD Computers: A VLSI Implementation , 1989, J. Parallel Distributed Comput..
[26] Massimo Maresca,et al. Polymorphic-Torus Network , 1989, IEEE Trans. Computers.
[27] Massimo Maresca,et al. Polymorphic-Torus Architecture for Computer Vision , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[28] H. T. Kung,et al. Comprehensive evaluation of a two-dimensional configurable array , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.
[29] Gen-Huey Chen,et al. Constant Time Sorting on a Processor Array with a Reconfigurable Bus System , 1990, Inf. Process. Lett..
[30] 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..
[31] Gen-Huey Chen,et al. Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model , 1990, Inf. Process. Lett..
[32] R. Ramaswami,et al. Analysis of optical bus networks using doped-fiber amplifiers , 1990, LEOS Summer Topical on Optical Multiple Access Networks.