Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
1988, Mathematical and Computer Modelling an International Journal
International Journal of Parallel Programming, 1989
The hypercube embedding problem, a restricted version of the general mapping problem, is the problem of mapping a set of communicating processes to a hypercube multiprocessor. The goal is to find a mapping that minimizes the length of the paths between communicating processes. Unfortunately the hypercube embedding problem has been shown to be NP-hard. Thus many heuristics have been proposed
[1991] Proceedings. The Fifth International Parallel Processing Symposium
IEEE Transactions on Computers, 1995
SIAM Journal on Computing, 1992
Journal of Interconnection Networks, 2012
Lecture Notes in Computer Science, 1996
Journal of Algorithms, 2002
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Archaeological Research in Asia, 2024
Feminist Tahayyül, 2024
RECHTSKUNDIG WEEKBLAD, 1981
2012
International Journal of Qualitative Studies in Education, 2024
Revista de Ciencias Ambientales
Effects of Ecosystems on Disease and of Disease on Ecosystems, 2010
Communications in Computer and Information Science, 2011
Journal of Pure and Applied Algebra, 2009
Chemistry of Materials, 1993
Archives of Oral Biology, 1993
Revista Terceiro Incluído, 2013
Journal of Experimental Child Psychology, 2010