Locality in Scheduling Models of Parallel Computation

Effective tools for the design of parallel algorithms must be based on a computational model for parallel computing that is a trade-off between realism and simplicity. Where the underlying programming model requires the mapping and scheduling of tasks, the computational model should incorporate some notion of interprocessor communication delay. If the target architecture is massively parallel then a more complex model, including some notion of locality, may be required.