Fixed Time, Tiered Memory, and Superlinear Speedup
暂无分享,去创建一个
[1] Vance Faber,et al. Superlinear speedup of an efficient sequential algorithm is not possible , 1986, Parallel Comput..
[2] Robert E. Benner,et al. Development of Parallel Methods for a $1024$-Processor Hypercube , 1988 .
[3] DAVID P. HELMBOLD,et al. Modeling Speedup (n) Greater than n , 1990, IEEE Trans. Parallel Distributed Syst..
[4] Donald P. Greenberg,et al. Modeling the interaction of light between diffuse surfaces , 1984, SIGGRAPH.
[5] John L. Gustafson,et al. Reevaluating Amdahl's law , 1988, CACM.
[6] Patrick H. Worley,et al. The Effect of Time Constraints on Scaled Speedup , 1990, SIAM J. Sci. Comput..
[7] D. Parkinson. Parallel efficiency can be greater than unity , 1986, Parallel Comput..
[8] Charles E. McDowell,et al. Modeling Speedup greater than n , 1989, International Conference on Parallel Processing.
[9] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.