Heterogeneity-driven end-to-end synchronized scheduling for precedence constrained tasks and messages on networked embedded systems

@article{Xie2015HeterogeneitydrivenES,
  title={Heterogeneity-driven end-to-end synchronized scheduling for precedence constrained tasks and messages on networked embedded systems},
  author={Guoqi Xie and Renfa Li and Keqin Li},
  journal={J. Parallel Distrib. Comput.},
  year={2015},
  volume={83},
  pages={1-12}
}
Scheduling for a directed acyclic graph (DAG) on networked embedded systems is to maximize concurrency and minimize inter-processor communication for minimum end-to-end worst-case response time (WCRT). Time accuracy and synchronization are critical for scheduling on heterogeneous networked embedded systems, where computing and networking are both heterogeneous and deeply jointed. Most algorithms use the upward rank value for task prioritization, and the earliest finish time for processor… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

Citations

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

References

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

A high performance

  • T. Hagras, J. Janeček
  • low complexity algorithm for compile-time task…
  • 2005
Highly Influential
7 Excerpts

S

  • H. Topcuoglu
  • Hariri, M.-y. Wu, Performance-effective and low…
  • 2002
Highly Influential
6 Excerpts

T

  • J.-P. Katoen
  • Noll, H.Wu, T. Santen, D. Seifert, Model-based…
  • 2013

Similar Papers

Loading similar papers…