Applying Cilk in Provably Efficient Task Scheduling

@article{Vee1999ApplyingCI,
  title={Applying Cilk in Provably Efficient Task Scheduling},
  author={Voon-Yee Vee and Wen-Jing Hsu},
  journal={Comput. J.},
  year={1999},
  volume={42},
  pages={699-712}
}
We consider the application of Cilk, a C-based runtime system for multithreaded parallel programming, in scheduling static task graphs. We assume no pre-emption of task execution and no prior knowledge of the task execution times. Given a task graph G, the output of the scheduling algorithm is a Cilk program which, when executed, will initiate the tasks in a manner consistent with the precedence requirement of G. We rst report a restriction arising from the computational model of Cilk in task… CONTINUE READING
5 Citations
18 References
Similar Papers

References

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

Introductions to Algorithms

  • T. H. Cormen, C. E. Leiserson, R. L. Rivest
  • 1990
Highly Influential
5 Excerpts

Vairavan, \A statistical study of the performance of a task scheduling algorithm,

  • A. F. Bashir, V. Susarla
  • IEEE Transactions on Computers,
  • 1983
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…