# Effective policies for workflow scheduling in stochastic environments

@inproceedings{Wosko2015EffectivePF, title={Effective policies for workflow scheduling in stochastic environments}, author={Michal Wosko}, year={2015} }

- Published 2015

There exist many realistic workflow scheduling optimization problems that have been insufficiently tackled by research or have been solved under restrictive and simplified assumptions. Most scheduling policies support only directed acyclic graphs, or even more restricted application models, with deterministic activity times. Some only allow stochastic task execution times but not inter-task communication delays, which are associated with data transfers between tasks executing on different… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 274 REFERENCES

## A stochastic scheduling algorithm for precedence constrained tasks on Grid

VIEW 12 EXCERPTS

HIGHLY INFLUENTIAL

## When greediness fails: examples from stochastic scheduling

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Algorithms for deterministic and stochastic scheduling

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Approximate dynamic programming based approach to process control and scheduling

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Stochastic Machine Scheduling with Precedence Constraints

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Approximation in stochastic scheduling: the power of LP-based priority policies

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Static scheduling algorithms for allocating directed task graphs to multiprocessors

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Task scheduling algorithms for heterogeneous processors

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL