Dynamic Speedup Calculation through Self-Analysis
暂无分享,去创建一个
[1] DAVID P. HELMBOLD,et al. Modeling Speedup (n) Greater than n , 1990, IEEE Trans. Parallel Distributed Syst..
[2] D. Lenoski,et al. The SGI Origin: A ccnuma Highly Scalable Server , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.
[3] Eduard Ayguadé,et al. A Library Implementation of the Nano-Threads Programming Model , 1996, Euro-Par, Vol. II.
[4] Tim Brecht,et al. Using Parallel Program Characteristics in Dynamic Processor Allocation Policies , 1996, Perform. Evaluation.
[5] Edward D. Lazowska,et al. Speedup Versus Efficiency in Parallel Systems , 1989, IEEE Trans. Computers.
[6] Kenneth C. Sevcik,et al. Benefits of Speedup Knowledge in Memory-Constrained Multiprocessor Scheduling , 1996, Perform. Evaluation.
[7] Thu D. Nguyen,et al. Maximizing speedup through self-tuning of processor allocation , 1996, Proceedings of International Conference on Parallel Processing.
[8] Thu D. Nguyen,et al. Parallel Application Characteristics for Multiprocessor Scheduling Policy Design , 1996, JSSPP.
[9] Thu D. Nguyen,et al. Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling , 1996, JSSPP.
[10] Anoop Gupta,et al. SPLASH: Stanford parallel applications for shared-memory , 1992, CARN.
[11] Geoffrey C. Fox,et al. The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers , 1989, Int. J. High Perform. Comput. Appl..