Low-time complexity budget-deadline constrained workflow scheduling on heterogeneous resources
- Submitting institution
-
Brunel University London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 066-195504-7001447
- Type
- D - Journal article
- DOI
-
10.1016/j.future.2015.07.021
- Title of journal
- Future Generation Computer Systems
- Article number
- -
- First page
- 29
- Volume
- 55
- Issue
- -
- ISSN
- 0167-739X
- Open access status
- Out of scope for open access requirements
- Month of publication
- February
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
1 - Artificial Intelligence (AI)
- Citation count
- 63
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Published in FGCS (10/104 Theory and Methods 2016), this work has been used by many papers as a base comparison method. This work was funded by the EU under the COST Program Action IC1305: Network for Sustainable Ultrascale Computing (NESUS), and by Austrian Science Fund (FWF) project TRP 237-N23: “Workflows on Manycore Processors''. It appeared in the highly cited cloud scheduling survey by Rodriguez and Buyya (2017, Concurrency and Computation Practice and Theory, https://doi.org/10.1002/cpe.4041) and has been cited by several highly cited papers (e.g. Chen, et al. (2017), FGCS (https://doi.org/10.1016/j.future.2017.03.008) and Singh, et al. (2018), FGCS (https://doi.org/10.1016/j.future.2017.09.054)).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -