Other Scheduling Work

This section briefly mentions a few other papers that have dealt with the subject of scheduled routing.

• E. D. Dahl showed an algorithm for scheduled routing on the CM-2 using a swap primitive [17]. His algorithm does no backtracking to figure the schedule and assumes unlimited buffering for data in the nodes.
• Bollinger and Midkiff presented a simulated annealing algorithm for link assignment [9]. Their algorithm essentially precomputes adaptive routes but assumes online routing (presumably non-adaptive) at runtime.
• Shin and Kandlur present a virtual cut-through route assignment algorithm [32]. As for Bollinger and Midkiff, they attempt to precompute adaptive routes for a known traffic distribution. The algorithm used is an incremental greedy path router.