Scheduling UET-UCT Series-Parallel Graphs on Two Processors

@article{Finta1996SchedulingUS,
  title={Scheduling UET-UCT Series-Parallel Graphs on Two Processors},
  author={Lucian Finta and Zhen Liu and Ioannis Milis and Evripidis Bampis},
  journal={Theor. Comput. Sci.},
  year={1996},
  volume={162},
  pages={323-340}
}
The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the makespan. A quadratic algorithm is proposed to compute an optimal schedule for a class of series-parallel graphs, called SP1 graphs, which includes in particular in-forests and out-forests. 

From This Paper

Topics from this paper.
31 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Scheduling with Communication Delays: A Sur- vey

  • P. Chretienne, C. Picouleau
  • In Scheduling Theory and Its Applications, P…
  • 1995
1 Excerpt

Scheduling Trees on Multiprocessors with Unit Communication Delays

  • E. Lawler
  • In Proc. Workshop on Models and Algorithms for…
  • 1993
2 Excerpts

Scheduling of UECT Trees on Two Pro- cessors

  • F. Guinand, D. Trystram, Optimal
  • Technical Report APACHE RR-93-03,
  • 1993

SPADE: A Tool for Performance and Reliability Evaluation

  • R. A. Sahner, K. S. Trivedi
  • In Proc. Modelling Techniques and Tools for…
  • 1986
2 Excerpts

Similar Papers

Loading similar papers…