Characterizing the behavior of sparse algorithms on caches
暂无分享,去创建一个
[1] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[2] Alexandru Nicolau,et al. Advances in languages and compilers for parallel processing , 1991 .
[3] Andrew Wolfe,et al. The white dwarf: a high-performance application-specific processor , 1988, ISCA '88.
[4] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.
[5] Y. Jegou,et al. Synchronizing processors through memory requests in a tightly coupled multiprocessor , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.
[6] Mark Horowitz,et al. An analytical cache model , 1989, TOCS.
[7] Anoop Gupta,et al. Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations , 1990, Proceedings SUPERCOMPUTING '90.
[8] Monica S. Lam,et al. The cache performance and optimizations of blocked algorithms , 1991, ASPLOS IV.
[9] K. I. M. McKinnon,et al. Architectural mechanisms to support sparse vector processing , 1989, ISCA '89.
[10] Timothy A. Davis,et al. Blocking for Parallel Sparse Linear System Solvers , 1988, ICPP.
[11] William Jalby,et al. A strategy for array management in local memory , 1994, Math. Program..
[12] Yvon Jégou,et al. Synchronizing processors through memory requests in a tightly coupled multiprocessor , 1988, ISCA '88.
[13] Yousef Saad,et al. SPARK: a benchmark package for sparse computations , 1990, ICS '90.