Document is current

Any future updates will be listed below

Lower-bound time-complexity greening mechanism for duplication-based scheduling on large-scale computing platforms

Crossref DOI link: https://doi.org/10.1007/s11227-019-02982-8

Published Online: 2019-09-06

Published Print: 2019-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark