Author:
Senar M. A.,Ripoll A.,Cortés A.,Luque E.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. G. Norman & P. Thanish, “Models of machines and computation for mapping in multicomputer”. ACM Computer Surveys, 25 (3) (1993), pp. 263–302.
2. O. Krämer and H. Mühlenbein, “Mapping strategies in message-based multiprocessor systems”, Parallel Computing, Vol. 9 (1988/89), pp. 213–225.
3. H.A-Choi and B. Narahari, “Efficient algorithms for mapping and partitioning a class of parallel computations”, J. Parallel Distributed Computing. 19(4) (1993), pp. 349–363.
4. C. Lee and L. Bic, “Comparing quenching and slow simulated annealing on the mapping problem”, Proc. 3rd. Annual Parallel Proc. Symp. (1989), pp. 671–685.
5. M.R. Garey and D.S. Johnson, “Computer and Intractability — A Guide to the Theory of NP-Completeness”, (Freeman, New York, 1979).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献