Answers are grounded in this paper and cite their sources.
This paper deals with the problem of finding optimal schedulings for uniform dependence algorithms. Given a convex domain, let T f be the total time needed to execute all computations using the free (greedy) schedule and let T l be the total time needed to execute all computations using the optimal linear schedule. Our main result is to bound T l /T f and T l − T f for sufficiently "fat" domains.
No takes yet. Share an insight, caveat, or question.
Darte et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: