Multi-Level Communication Structure for Heirarchical Gain Aggregation

Algorithms for the partitioning and scheduling of parallel programs have been the topic of intense research for numerous years. It is well understood that the organization und size of the parallel tasks are critical to the efficiency of a parallel program and to the effective use of parallel resources various algorithm have been proposed for partitioning and scheduling that are optimal under severely constrained assumptions. Under realistic assumptions, the general partitioning and scheduling problems are intractable.