By Topic

Hybrid resource management algorithms for multicomputer 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

4 Author(s)
J. J. Baxter ; Intel Corp., Santa Clara, CA, USA ; J. W. C. Fu ; B. Ramkumar ; J. H. Patel

Addresses the issue of resource management in parallel systems. Two new hybrid algorithms for general resource management in distributed memory computers are presented. T-hybrid is a decoupled algorithm that combines a static template allocation scheme with a low-cost local demand-driven dynamic algorithm while C-hybrid is a coupled algorithm that combines a simple static allocation scheme with the same dynamic algorithm as T-hybrid. A set of test programs is scheduled using these hybrid algorithms and compared with scheduling using pure static and dynamic schemes when executed on an Ncube2 system under the Chare Kernel. The results show that the two new hybrid strategies provide faster execution times than all the pure dynamic and static algorithms investigated, and that the simpler C-hybrid algorithm resulted in an execution time about 6% faster than T-hybrid and 22% faster than the fastest non-hybrid scheme

Published in:

Parallel Processing Symposium, 1994. Proceedings., Eighth International

Date of Conference:

26-29 Apr 1994