The DOI matches its Crossref record.
Dynamic Cloud Task Scheduling Based on a Two-Stage Strategy
Abstract
To maximize task scheduling performance and minimize nonreasonable task allocation in clouds, this paper proposes a method based on a two-stage strategy. At the first stage, a job classifier motivated by a Bayes classifier's design principle is utilized to classify tasks based on historical scheduling data. A certain number of virtual machines (VMs) of different types are accordingly created. This can save time of creating VMs during task scheduling. At the second stage, tasks are matched with concrete VMs dynamically. Dynamic task scheduling algorithms are accordingly proposed. Experimental results show that they can effectively improve the cloud's scheduling performance and achieve the load balancing of cloud resources in comparison with existing methods. Note to Practitioners- Task scheduling is one of the challenging problems in cloud computing, especially when deadline and cost are considered. As an important actuator, virtual machines (VMs) play a vital role for cloud task scheduling. To meet task deadlines, one needs to save the time of creating VMs, task waiting time, and executing time. To minimize the task execution cost, one needs to schedule tasks onto their most suitable VMs for execution. We propose a cloud task scheduling framework based on a two-stage strategy to do so. It precreates VMs according to historical scheduling data, therefore saving time for tasks to wait for creating VMs. It matches tasks with their most suitable VMs dynamically, therefore saving their execution cost. Under the premise of meeting task deadlines, it minimizes the waiting time of VMs to schedule tasks, thus minimizing the cost to be paid by users who utilize VMs. The readily deployable algorithms are designed and illustrated to improve cloud task scheduling and execution results in comparison with those using traditional methods.
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
Cited by
Security 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-citationMarahatta, A., Pirbhulal, S., Zhang, F., Parizi, R. M., Choo, K.-K. R., & Liu, Z. (2021) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2019.2918226 · Cited by 88
Metadata
- Authors
- Zhang, P., & Zhou, M.
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2018-04
- Volume
- 15
- Issue
- 2
- Pages
- 772-783
- ISSN
- 1545-5955 (ISSN-L)
- 1558-3783
- OpenAlex
- W2616575853
- Cited by
- 290
- References
- 0
- FWCI
- 54.51
- 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: Dynamic Cloud Task Scheduling Based on a Two-Stage Strategy. https://app.cochat.ai/papers/10.1109/tase.2017.2693688
- The paper
- Zhang, P., & Zhou, M. (2018). Dynamic Cloud Task Scheduling Based on a Two-Stage Strategy. IEEE Transactions on Automation Science and Engineering. https://doi.org/10.1109/tase.2017.2693688
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.