A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention

@article{Alkaya2006ATS,
  title={A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention},
  author={Ali Fuat Alkaya and Haluk Topcuoglu},
  journal={Cluster Computing},
  year={2006},
  volume={9},
  pages={417-431}
}
In this paper, we present a new task scheduling algorithm, called Contention-Aware Scheduling (CAS) algorithm, with the objective of delivering good quality of schedules in low running-time by considering contention on links of arbitrarily-connected, heterogeneous processors. The CAS algorithm schedules tasks on processors and messages on links by considering the earliest finish time attribute with the virtual cut-through (VCT) or the store-and-forward (SAF) switching. There are three types of… CONTINUE READING
6 Citations
34 References
Similar Papers

References

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

Static task scheduling and grain packing in parallel processing

  • B. Kruatrachue
  • 1987
Highly Influential
4 Excerpts

Computer and Job-Shop Scheduling

  • E. G. Coffman
  • Theory (John Wiley and Sons,
  • 1976
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…