By Topic

Optimizing the time cost of the parallel structures with a limited number of processors

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

3 Author(s)
Fergany, T.A. ; Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA ; Ammar, R.A. ; Neilforoshan-Dardashti, M.R.

We develop an allocation algorithm that, in conjunction with optimal scheduling algorithms, yields the minimum time cost for a parallel structure. We assume a shared memory environment and a limited number of processors that is less than the degree of parallelism of the parallel structure

Published in:

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

Date of Conference:

27-29 May 1993