Studies the problem of scheduling arbitrarily nested loops on atightly-coupled multiprocessor system. First, based on the concept ofconcurrent iterations, some interesting properties of arbitrarily nestedloops are explored. Then an approach is presented for scheduling thesenested loops in a way that their completion times can be even anddiminished. In addition, two optimization techniques are utilized toschedule more loops on idle processors. Therefore, the system andprogram performance can be enhanced
展开▼