Are task mappings with the highest frequency of servers so good? A case study on Heterogeneous Earliest Finish Time (HEFT) algorithm

Jie Liang, Kenli Li 0001, Chubo Liu, Keqin Li 0001. Are task mappings with the highest frequency of servers so good? A case study on Heterogeneous Earliest Finish Time (HEFT) algorithm. Journal of Systems Architecture, 121:102311, 2021. [doi]

@article{LiangLLL21-2,
  title = {Are task mappings with the highest frequency of servers so good? A case study on Heterogeneous Earliest Finish Time (HEFT) algorithm},
  author = {Jie Liang and Kenli Li 0001 and Chubo Liu and Keqin Li 0001},
  year = {2021},
  doi = {10.1016/j.sysarc.2021.102311},
  url = {https://doi.org/10.1016/j.sysarc.2021.102311},
  researchr = {https://researchr.org/publication/LiangLLL21-2},
  cites = {0},
  citedby = {0},
  journal = {Journal of Systems Architecture},
  volume = {121},
  pages = {102311},
}