Performance analysis of job scheduling policies in parallel supercomputing environments
暂无分享,去创建一个
[1] J D Littler,et al. A PROOF OF THE QUEUING FORMULA , 1961 .
[2] D. Kwak,et al. LU-SGS implicit algorithm for three-dimensional incompressible Navier-Stokes equations with source term , 1989 .
[3] David H. Bailey,et al. The Nas Parallel Benchmarks , 1991, Int. J. High Perform. Comput. Appl..
[4] Vijay K. Naik. Performance Effects of Load Imbalance in Parallel CFD Applications , 1991, PPSC.
[5] Robert Schreiber,et al. Towards the Teraflops capability for CFD , 1992 .
[6] V. K. Naik. Scalability issues for a class of CFD applications , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..
[7] Vijay K. Naik,et al. Parallelization of a Class of Implicit Finite Difference Schemes in Computational Fluid Dynamics , 1993, Int. J. High Speed Comput..
[8] Mark S. Squillante,et al. Performance analysis of job scheduling policies in parallel supercomputing environments , 1993, Supercomputing '93. Proceedings.
[9] Sanjeev Setia. Scheduling on multiprogrammed, distributed memory parallel computers , 1993 .
[10] Mark S. Squillante,et al. Scheduling of Large Scientific Applications on Distributed Memory Multiprocessor Systems , 1993, PPSC.
[11] D. B. Davis,et al. Intel Corp. , 1993 .
[12] Satish K. Tripathi,et al. A Comparative Analysis of Static Processor Partitioning Policies for Parallel Computers , 1993, MASCOTS.
[13] Giuseppe Serazzi,et al. Robust Partitioning Policies of Multiprocessor Systems , 1994, Perform. Evaluation.