Neighbourhood Preserving Load Balancing: A Self-Organizing Approach
暂无分享,去创建一个
[1] Jürgen W. Quittek,et al. Optimizing Parallel Program Execution by Self-Organizing Maps , 1996 .
[2] Murat Atun. A new load balancing heuristic using self-organizing maps , 1999 .
[3] Scott B. Baden,et al. Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves , 1996, IEEE Trans. Parallel Distributed Syst..
[4] Laxmikant V. Kalé,et al. NAMD: a Parallel, Object-Oriented Molecular Dynamics Program , 1996, Int. J. High Perform. Comput. Appl..
[5] Teuvo Kohonen,et al. The self-organizing map , 1990 .
[6] P. Sadayappan,et al. Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes , 1987, IEEE Transactions on Computers.
[7] Brian Kernighan,et al. An efficient heuristic for partitioning graphs , 1970 .
[8] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[9] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[10] Tevfik Bultan,et al. A New Mapping Heuristic Based on Mean Field Annealing , 1992, J. Parallel Distributed Comput..