Skip to main content
SpringerLink
Log in

On incomplete hypercubes

  • Conference paper
  • First Online:
Book cover Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 634))

Abstract

New approach to the fragmentation problem of hypercube multiprocessors with dynamic allocation of subcubes is proposed. It is based on constructing Hamiltonian circuits of incomplete hypercubes. The main result is a constructive proof that an n-cube from which up to n−2 vertex-disjoint subcubes are removed so that it remains connected is a Hamiltonian graph and its Hamiltonian circuit can be constructed. If the communication subsystem can use a circuit as an efficient broadcasting and communication graph, then the operating system can use this algorithm for allocating nodes of a fragmented hypercube to a user task when there is no subcube large enough to accommodate the task and in the same time the total number of free nodes is sufficient — instead of forcing the user to wait for releasing allocated subcubes or forcing the system to move the running tasks to other parts of the hypercube.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.-S. Chen and K. G. Shin. Processor allocation in an n-cube multiprocessor using Gray codes. IEEE Trans. on Computers, C-36(12):1396–1407, Dec. 1987.

    Google Scholar 

  2. M.-S. Chen and K. G. Shin. Subcube allocation and task migration in hypercube multiprocessors. IEEE Trans. on Computers, C-39(9):1146–1155, Sept. 1990.

    Google Scholar 

  3. S. Dutt and J. P. Hayes. Subcube allocation in hypercube computers. IEEE Trans, on Computers, C-40(3):341–352, Mar. 1991.

    Google Scholar 

  4. J. Kim, C. R. Das, and W. Lin. A top-down processor allocation scheme for hypercube computers. IEEE Trans. on Parallel and Distr. Systems, 2(1):20–30, Jan. 1991.

    Google Scholar 

  5. P. Tvrdik. Spanning subgraphs of hypercubes. PhD dissertation, Czech Technical University, Prague, 1991.

    Google Scholar 

  6. P. Tvrdik. On Incomplete Hypercubes. Research Report DC-92-06, Department of Computers, Czech Technical University, Prague, June 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computers, Czech Technical University, Karlovo nám. 13, 121 35, Praha, Czechoslovakia

    Pavel Tvrdík

Authors
  1. Pavel Tvrdík
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tvrdík, P. (1992). On incomplete hypercubes. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_392

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_392

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55895-8

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation