Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Software
Reference29 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), 1st edn. Freeman, San Francisco, CA (1979)
2. Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4), 406–471 (1999)
3. Young, B.D., Pasricha, S. et al.: Heterogeneous energy and makespan constrained DAG scheduling. Workshop on Energy Efficient High Performance Parallel and Distributed Computing, EEHPDC, pp. 3–12 (2013)
4. Singh, J., Mangipudi, B., Betha, S., Auluck, N.: Contention aware energy efficient scheduling on heterogeneous multiprocessors. IEEE Trans. Parallel Distrib. Syst. 26(5), 1251–1264 (2015)
5. Yi, J., Zhuge, Q., Hu, J., Gu, S., Qin, M., Sha, E.H.M.: Reliability—guaranteed task assignment and scheduling for heterogeneous multiprocessors considering timing constraint. Springer J. Signal Process. Syst. 81(3), 359–375 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献