§NP-hard problem: graph to graph mapping
§Algorithm goals:
qMinimize likelihood
of experimental artifacts (bottlenecks)
q“Optimal” packing of many simultaneous experiments
q Extensible for heterogeneous hardware,
software, new features
§Randomized heuristic algorithm: simulated annealing
§Typically completes in < 1 second