Faster high-quality processor allocation.
暂无分享,去创建一个
[1] Rolf Niedermeier,et al. On Multi-dimensional Hilbert Indexings , 1998, COCOON.
[2] Jens Mache,et al. The impact of spatial layout of jobs on I/O hotspots in mesh networks , 2005, J. Parallel Distributed Comput..
[3] Shahid H. Bokhari,et al. On the Mapping Problem , 1981, IEEE Transactions on Computers.
[4] Esther M. Arkin,et al. Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies , 2002, Proceedings. IEEE International Conference on Cluster Computing.
[5] José E. Moreira,et al. Resource allocation and utilization in the Blue Gene/L supercomputer , 2005, IBM J. Res. Dev..
[6] Dror G. Feitelson,et al. Pitfalls in Parallel Job Scheduling Evaluation , 2005, JSSPP.
[7] Jens Mache,et al. Communication patterns and allocation strategies , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[8] Madhav V. Marathe,et al. Compact Location Problems , 1993, Theor. Comput. Sci..
[9] Laxmikant V. Kalé,et al. Benefits of Topology Aware Mapping for Mesh Interconnects , 2008, Parallel Process. Lett..
[10] Jens Mache,et al. Dispersal Metrics for Non-Contiguous Processor Allocation , 1996 .
[11] Saad Bani-Mohammad,et al. A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers , 2007, ISPA.
[12] Bill Nitzberg,et al. Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers , 1997, IEEE Trans. Parallel Distributed Syst..
[13] Jens Mache,et al. The Effects of Dispersal on Message-Passing Contention in Processor Allocation Strategies , 1997 .
[14] Phillip Krueger,et al. ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..
[15] D. Hilbert. Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .
[16] Cynthia A. Phillips,et al. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance , 2007, Algorithmica.
[17] José E. Moreira,et al. Unlocking the Performance of the BlueGene/L Supercomputer , 2004, Proceedings of the ACM/IEEE SC2004 Conference.
[18] Claire Mathieu,et al. On the Sum-of-Squares algorithm for bin packing , 2002, JACM.
[19] William J. Dally,et al. Design tradeoffs for tiled CMP on-chip networks , 2006, ICS '06.
[20] Subhash Saini,et al. Topology-Aware Parallel Molecular Dynamics Simulation Algorithm , 2006, PDPTA.
[21] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[22] Saad Bani-Mohammad,et al. An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Multicomputers , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.
[23] Jens Mache,et al. Minimizing Message-Passing Contention in Fragmentation-Free Processor Allocation , 1997 .
[24] David A. Lifka,et al. The ANL/IBM SP Scheduling System , 1995, JSSPP.
[25] Prasant Mohapatra,et al. Improving Performance of Mesh-connected Multicomputers by Reducing Fragmentation , 1998 .
[26] Jens Mache,et al. Job scheduling that minimizes network contention due to both communication and I/O , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.
[27] D. Hilbert. Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .
[28] NitzbergBill,et al. Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers , 1997 .