The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements
Abstract
Grid computing is increasingly considered as a promising next-generation computational platform that supports wide-area parallel and distributed computing. In grid environments, applications are always regarded as workflows. The problem of scheduling workflows in terms of certain quality of service (QoS) requirements is challenging and it significantly influences the performance of grids. By now, there have been some algorithms for grid workflow scheduling, but most of them can only tackle the problems with a single QoS parameter or with small-scale workflows. In this frame, this paper aims at proposing an ant colony optimization (ACO) algorithm to schedule large-scale workflows with various QoS parameters. This algorithm enables users to specify their QoS preferences as well as define the minimum QoS thresholds for a certain application. The objective of this algorithm is to find a solution that meets all QoS constraints and optimizes the user-preferred QoS parameter. Based on the characteristics of workflow scheduling, we design seven new heuristics for the ACO approach and propose an adaptive scheme that allows artificial ants to select heuristics based on pheromone values. Experiments are done in ten workflow applications with at most 120 tasks, and the results demonstrate the effectiveness of the proposed algorithm.
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
(1979) · Cited by 43,841
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
The Grid 2: Blueprint for a New Computing Infrastructure
Foster, I. T., & Kesselman, C. (1998) · Cited by 7,637
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Performance-effective and low-complexity task scheduling for heterogeneous computing
Topcuoglu, H., Hariri, S., & Wu, M.-Y. (2002) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.993206 · Cited by 3,475
The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration
Foster, I. T., Kesselman, C., Nick, J. M., & Tuecke, S. J. (2002) · Cited by 3,055
Distributed Optimization by Ant Colonies
Colorni, A., Dorigo, M., Maniezzo, V., Varela, F. J., & Bourgine, P. (1992) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 2,748
Braun, T. D., Siegel, H. J., Beck, N., Bölöni, L. L., Maheswaran, M., Reuther, A. I., Robertson, J. P., Theys, M. D., Yao, B., Hensgen, D., et al. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1714 · Cited by 1,722
(2004) · Lecture Notes in Computer Science · doi:10.1007/b99492 · Cited by 1,511
Cited by
Deadline Based Resource Provisioningand Scheduling Algorithm for Scientific Workflows on Clouds
Rodriguez, M. A., & Buyya, R. (2014) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2014.2314655 · Cited by 686
Evolutionary Multi-Objective Workflow Scheduling in Cloud
Zhu, Z., Zhang, G., Li, M., & Liu, X. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2446459 · Cited by 401
Zhan, Z.-H., Li, J., Cao, J., Zhang, J., Chung, H. S.-H., & Shi, Y.-H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2209115 · Cited by 346
Self-citationA market-oriented hierarchical scheduling strategy in cloud workflow systems
Wu, Z., Liu, X., Ni, Z., Yuan, D., & Yang, Y. (2013) · The Journal of Supercomputing · doi:10.1007/s11227-011-0578-4 · Cited by 259
Wang, Z.-J., Zhan, Z.-H., Yu, W.-J., Lin, Y., Zhang, J., Gu, T.-L., & Zhang, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2933499 · Cited by 257
Self-citation
Metadata
- Authors
- Chen, W.-N., & Zhang, J.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
- Published
- 2009-01
- Volume
- 39
- Issue
- 1
- Pages
- 29-43
- ISSN
- 1094-6977 (ISSN-L)
- 1558-2442
- OpenAlex
- W2099389501
- Cited by
- 362
- References
- 20
- FWCI
- 27.98
- 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: An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements. https://app.cochat.ai/papers/10.1109/tsmcc.2008.2001722
- The paper
- Chen, W.-N., & Zhang, J. (2009). An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews). https://doi.org/10.1109/tsmcc.2008.2001722
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.