Hybrid resource management algorithms for multicomputer systems

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.<<ETX>>