Static mapping by dual recursive bipartitioning of process architecture graphs
暂无分享,去创建一个
[1] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[2] Masahiro Tsuchiya,et al. A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.
[3] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .
[4] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[7] Jean Roman,et al. Partitioning and Mapping for Parallel Nested Dissection on Distributed Memory Architectures , 1992, CONPAR.
[8] Shahid H. Bokhari,et al. On the Mapping Problem , 1981, IEEE Transactions on Computers.
[9] J. Ramanujam,et al. Task allocation onto a hypercube by recursive mincut bipartitioning , 1990, C3P.
[10] S. Arunkumar,et al. A randomized heuristics for the mapping problem: The genetic approach , 1992, Parallel Comput..
[11] Steven Warren Hammond,et al. Mapping unstructured grid computations to massively parallel computers , 1992 .
[12] Virginia Mary Lo,et al. Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.
[13] Scott F. Midkiff,et al. Processor and Link Assignment in Multicomputers Using Simulated Annealing , 1988, ICPP.