A new graph approach to minimizing processor fragmentation in hypercube multiprocessors
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (10) , 1165-1171
- https://doi.org/10.1109/71.246077
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Structural properties of incomplete hypercube computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamic processor allocation in hypercube computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Subcube allocation in hypercube computersIEEE Transactions on Computers, 1991
- A top-down processor allocation scheme for hypercube computersIEEE Transactions on Parallel and Distributed Systems, 1991
- Subcube allocation and task migration in hypercube multiprocessorsIEEE Transactions on Computers, 1990
- Incomplete hypercubesIEEE Transactions on Computers, 1988
- Processor Allocation in an N-Cube Multiprocessor Using Gray CodesIEEE Transactions on Computers, 1987
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984