Optimal Tree Structures for Large-Scale Grids
Jennie Palmer, Isi Mitrani · 2004
We consider the problem of how best to structure and control a Computing Grid containing many processors. The performance trade-o#s associated with di#erent tree structures are evaluated by analysing appropriate queueing models. It is shown that, for a given set of parameters and job distribution policy, there is an optimal tree structure that minimizes the overall average response time. This is obtained numerically through comparison of theoretical average response times. A simple heuristic policy is shown to perform well under certain conditions.