Conference Proceedings

Task migration in hypercube multiprocessors.

Conference Proceedings - Annual Symposium on Computer Architecture (1989) (16) 105-111
DOI: 10.1145/74925.74938
8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The authors develop a task migration strategy for the subcube allocation policy based on the binary reflected Gray code. A goal configuraton (of destination subcubes) without fragmentation is determined first. Then the node-mapping between the source and destination subcubes is derived. Finally, a routing procedure to achieve shortest deadlock-free paths for relocating tasks is developed.

Cite

CITATION STYLE

APA

Chen, M. S., & Shin, K. G. (1989). Task migration in hypercube multiprocessors. In Conference Proceedings - Annual Symposium on Computer Architecture (pp. 105–111). Publ by IEEE. https://doi.org/10.1145/74925.74938

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free