Adjusting the Lengths of Time Slices when Scheduling PVM Jobs with High Memory Requirements
暂无分享,去创建一个
[1] Andy B. Yoo,et al. An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters , 2001, JSSPP.
[2] Mark S. Squillante,et al. The impact of job memory requirements on gang-scheduling performance , 1999, PERV.
[3] Emilio Luque,et al. Predictive Coscheduling Implementation in a Non-dedicated Linux Cluster , 2001, Euro-Par.
[4] Emilio Luque,et al. Implementing Explicit and Implicit Coscheduling in a PVM Environment (Research Note) , 2000, Euro-Par.
[5] Emilio Luque,et al. MemTo: A Memory Monitoring Tool for a Linux Cluster , 2001, PVM/MPI.
[6] David A. Wood,et al. Paging tradeoffs in distributed-shared-memory multiprocessors , 1994, Supercomputing '94.
[7] Daniel Pierre Bovet,et al. Understanding the Linux Kernel , 2000 .
[8] Emilio Luque,et al. Coscheduling under Memory Constraints in a NOW Environment , 2001, JSSPP.