Static scheduling of conditional branches in parallel programs

@inproceedings{George1996StaticSO,
  title={Static scheduling of conditional branches in parallel programs},
  author={Robert Tyler George},
  year={1996}
}
Abstract : The problem of scheduling parallel program tasks on multiprocessor systems is known to be NP-complete in its general form. When non-determinism is added to the scheduling problem through loops and conditional branching, an optimal solution is even harder to obtain. The intractability of obtaining an optimal solution for the general scheduling problem has led to the introduction of a large number of scheduling heuristics, These heuristics consider many real world factors, such as… CONTINUE READING

Topics from this paper.

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Static scheduling algorithms for allocating directed task graphs to multiprocessors

  • ACM Comput. Surv.
  • 1999
VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Effective policies for workflow scheduling in stochastic environments

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Static Scheduling of Conditional Parallel

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Evolving toward an Optimal Scheduling Solution through Adaptivity

  • J. Parallel Distrib. Comput.
  • 2002
VIEW 2 EXCERPTS
CITES BACKGROUND

Dynamic Process Graphs and the Complexity of Scheduling

  • Electronic Colloquium on Computational Complexity
  • 2001
VIEW 1 EXCERPT
CITES BACKGROUND