The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds
Abstract
The economy of scale provided by cloud attracts a growing number of organizations and industrial companies to deploy their applications in cloud data centers (CDCs) and to provide services to users around the world. The uncertainty of arriving tasks makes it a big challenge for private CDC to cost-effectively schedule delay bounded tasks without exceeding their delay bounds. Unlike previous studies, this paper takes into account the cost minimization problem for private CDC in hybrid clouds, where the energy price of private CDC and execution price of public clouds both show the temporal diversity. Then, this paper proposes a temporal task scheduling algorithm (TTSA) to effectively dispatch all arriving tasks to private CDC and public clouds. In each iteration of TTSA, the cost minimization problem is modeled as a mixed integer linear program and solved by a hybrid simulated-annealing particle-swarm-optimization. The experimental results demonstrate that compared with the existing methods, the optimal or suboptimal scheduling strategy produced by TTSA can efficiently increase the throughput and reduce the cost of private CDC while meeting the delay bounds of all the tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Tatinati, S., Veluvolu, K. C., & Ang, W. T. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2381495 · Cited by 77
Cited by
Gao, S., Zhou, M., Wang, Y., Cheng, J., Yachi, H., & Wang, J. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2846646 · Cited by 698
Self-citationBi, J., Yuan, H., Duanmu, S., Zhou, M., & Abusorrah, A. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3024223 · Cited by 365
Self-citationSecurity and trust issues in Fog computing: A survey
Zhang, P., Zhou, M., & Fortino, G. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.05.008 · Cited by 364
Self-citationMultiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach
Chen, Z.-G., Zhan, Z.-H., Lin, Y., Gong, Y.-J., Gu, T.-L., Zhao, F., Yuan, H.-Q., Chen, X., Li, Q., & Zhang, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2832640 · Cited by 278
Self-citation
Metadata
- Authors
- Yuan, H., Bi, J., Tan, W., Zhou, M., Li, B. H., & Li, J.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2017-11
- Volume
- 47
- Issue
- 11
- Pages
- 3658-3668
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2464889299
- Cited by
- 207
- References
- 1
- FWCI
- 40.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds. https://app.cochat.ai/papers/10.1109/tcyb.2016.2574766
- The paper
- Yuan, H., Bi, J., Tan, W., Zhou, M., Li, B. H., & Li, J. (2017). TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2016.2574766
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.