Cart (Loading....) | Create Account
Close category search window
 

A systematic approach for mapping application tasks in 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

2 Author(s)
Kavianpour, A. ; Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA ; Bagherzadeh, N.

A systematic approach for mapping application tasks to hypercubes is proposed. This method is based on a partitioning algorithm in which the final mapping is rendered as a task-node tuple assignment for an n-cube system. For this method, a single-tasking environment in which each task is assigned to a unique processor is assumed. Dilation-bound and expansion-ratio parameters are used to evaluate the efficacy of this mapping algorithm. An algorithm that minimizes the expansion-ratio parameter is introduced. In addition, an algorithm that reduces the dilaton bound is proposed. Because of the structured formation of the algorithms, they can be applied to any given task structure. As an illustration of the effectiveness of this method, the proposed algorithms are applied to mapping complete binary and d-ary tree task structures to hypercubes

Published in:

Computers, IEEE Transactions on  (Volume:42 ,  Issue: 6 )

Date of Publication:

Jun 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.