By Topic

Job simulation techniques on incomplete and Gray code incomplete hypercubes

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
$31 $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

1 Author(s)
Stojmenovic, I. ; Dept. of Comput. Sci., Ottawa Univ., Ont., Canada

We show that any job (in particular, data communication techniques such as sorting, merging, parallel prefix, distribution etc.) can be executed on the synchronous model of incomplete hypercube within asymptotically the same time complexity as on a (complete) hypercube of appropriate size. We then obtain similar results for the GCIH (Gray code incomplete hypercube) model. GCIHs have some applications based on partitioning a (complete) hypercube into several GCIHs, each being temporarily isolated from the rest of hypercube. GCIHs provide a very simple method to allocate some processors to perform a job on a complete hypercube, since it enables the memory allocation techniques for sequential computers to be directly used. The other application is in image processing and other fields where multiple component problems occur

Published in:

Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on

Date of Conference:

27-29 May 1993