[Myrinet] Gang scheduling algorithms?

Hello,

Suppose we have a large group of communications between nodes that need to 
be sent, and we want to schedule and order these communciations (taking 
into account the existing route tables to avoid contention) so that all 
these communications together complete as quickly as possible.

I'm looking for an algorithm that computes an optimal or near-optimal 
schedule given the routing and the information on which node wants to sent 
to which other node, and how much.

I'm have an approach that uses a greedy algorithm (pretty much what you'd 
expect) that completes rather quickly, but I envision situations where it 
delivers suboptimal performance.  Does anyone have experience with this?

Thanks!

-- 
Thomas Finley, [email protected]