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.
No takes yet. Share an insight, caveat, or question.
Sarkar et al. (1986) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: