K-Dimensional Optimal Parallel Algorithm for the solution of a general class of recurrence equations
暂无分享,去创建一个
[1] Q. S. Gao. The Chinese Remainder Theorem And The Prime Memory System , 1993, Proceedings of the 20th Annual International Symposium on Computer Architecture.
[2] Daniel Gajski,et al. An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines , 1981, IEEE Transactions on Computers.
[3] Kai Hwang,et al. Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.
[4] Marc Snir,et al. Depth-Size Trade-Offs for Parallel Prefix Computation , 1986, J. Algorithms.
[5] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[6] Harold S. Stone,et al. A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.
[7] Peter M. Kogge,et al. Parallel Solution of Recurrence Problems , 1974, IBM J. Res. Dev..
[8] David J. Kuck,et al. Parallel Processing of Ordinary Programs , 1976, Adv. Comput..
[9] Gerard G. L. Meyer,et al. A Parallel First-Order Linear Recurrence Solver , 1987, J. Parallel Distributed Comput..
[10] R. Brent,et al. Solving Triangular Systems on a Parallel Computer , 1977 .
[11] David J. Kuck,et al. Practical Parallel Band Triangular System Solvers , 1978, TOMS.
[12] David J. Kuck,et al. Time and Parallel Processor Bounds for Linear Recurrence Systems , 1975, IEEE Transactions on Computers.
[13] Larry Rudolph,et al. The power of parallel prefix , 1985, IEEE Transactions on Computers.