a spatial path scheduling algorithm for edge architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed microarchitectures in which the compiler forms dataflow graphs that specify how the microarchitecture maps instructions onto a distributed execution substrate. This paper describes a compiler scheduling algorithm called spatial path scheduling that factors in previously fixed locations - called anchor points - for each placement. This algorithm extends easily to different spatial topologies. We augment this basic algorithm with three heuristics: (1) local and global ALU and network link contention modeling, (2) global critical path estimates, and (3) dependence chain path reservation. We use simulated annealing to explore possible performance improvements and to motivate the augmented heuristics and their weighting functions. We show that the spatial path scheduling algorithm augmented with these three heuristics achieves a 21\% average performance improvement over the best prior algorithm and comes within an average of 5\% of the annealed performance for our benchmarks.
spatial path scheduling scheduling algorithm algorithm edge architecture architecture delay motivation feature communication compilation examples microarchitecture dataflow graph maps instruction distributed paper factor locatability point placement topologies heuristics locality global network linking contention model critic dependencies use simulated annealing exploration performance benchmark instruction scheduling