Compile-time partitioning and scheduling of parallel programs
Vivek Sarkar, John LeRoy Hennessy · 1986
Partitioning and scheduling techniques are necessary to implement parallel languages on multiprocessors. Multiprocessor performance is maximized when parallelism between tasks is optimally traded off with communication and synchronization overhead. We present compile-time partitioning and scheduling techniques to achieve this trade-off.