Sequentialising Parallel Moves
11 hours ago
- Parallel moves require simultaneous assignment; naive sequentialization can cause errors due to dependencies and cycles.
- A location transfer graph models dependencies; correct ordering is a post-order traversal of this graph.
- Cycles in the graph are resolved by using a single temporary register to break the cycle.
- Algorithms like the one by Leroy et al. use recursion and status tracking to sequentialize moves efficiently.