Task allocation onto a hypercube by recursive mincut bipartitioning
暂无分享,去创建一个
[1] Shahid H. Bokhari,et al. A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.
[2] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[3] Harold S. Stone,et al. Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.
[4] Chien-Chung Shen,et al. A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Transactions on Computers.
[5] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.
[6] Chien-Chung Shen,et al. A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Trans. Computers.
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[9] J. Ramanujam,et al. Cluster partitioning approaches to mapping parallel programs onto a hypercube , 1987, Parallel Comput..
[10] Shahid H. Bokhari,et al. On the Mapping Problem , 1981, IEEE Transactions on Computers.
[11] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[12] Virginia Mary Lo,et al. Task Assignment to Minimize Completion Time , 1985, IEEE International Conference on Distributed Computing Systems.
[13] Scott F. Midkiff,et al. Processor and Link Assignment in Multicomputers Using Simulated Annealing , 1988, ICPP.
[14] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[15] P. Sadayappan,et al. Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes , 1987, IEEE Transactions on Computers.
[16] James B. Sinclair,et al. Efficient Computation of Optimal Assignments for Distributed Tasks , 1987, J. Parallel Distributed Comput..
[17] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[18] Fox,et al. Load balancing and sparse matrix vector multiplication on the hypercube , 1986 .
[19] Kemal Efe,et al. Heuristic Models of Task Assignment Scheduling in Distributed Systems , 1982, Computer.
[20] Hironori Kasahara,et al. Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.
[21] J. Sheild,et al. Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing , 1987 .
[22] Virginia Mary Lo,et al. Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.
[23] Heinz Mühlenbein,et al. Mapping strategies in message-based multiprocessor systems , 1989, Parallel Comput..
[24] Geoffrey C. Fox,et al. Concurrent computation and the theory of complex systems , 1986 .
[25] Heinz Mühlenbein,et al. New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..
[26] Heinz Mühlenbein,et al. Mapping Strategies in Message Based Multiprocessor Systems , 1987, PARLE.
[27] Karsten Schwan,et al. Automating Resource Allocation for the Cm* Multiprocessor , 1985, ICDCS.
[28] E. Barnes. An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.