N-way assignments
- Greedy algorithm: linear time heuristic that moves nodes that reduce the value of cost function
- Simulated annealing: randomized hill climbing to avoid local minima with long runtime
- Extended hill climbing: with some restrictions and tightly coupled data structure, O(n log(n)) runtime
cloning transformation can be applied selectively here
port-calling, another transform: for I/O balance and ease access to shared ports. (I/O procedures are used in place of external port access that take care of send/receive etc.)