By Topic

A graph-based subcube allocation and task migration in hypercube systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
O. Kang ; Qnix Computer Co., Seoul, South Korea ; B. M. Kim ; H. Yoon ; S. R. Maeng
more authors

The authors propose a task migration scheme based on the HSA (heuristic subcube allocation) strategy to solve the fragmentation problem in a hypercube. This scheme, called CSC (complementary subcube coalescence), uses a heuristic and an undirected graph, called the SC (subcube) graph. If an incoming request is not satisfied due to the system fragmentation, the task migration scheme is performed to generate higher dimension subcubes. Simulation results show that the HSA strategy gives better efficiency than the Buddy and GC strategies in the adaptive mode. Moreover, the HSA strategy has a significantly lower migration cost than that of the Buddy and GC strategies

Published in:

Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the

Date of Conference:

19-21 Oct 1992