The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table
Abstract
Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, O(v2.p) for v tasks and p processors, but offers significant makespan improvements by introducing a look-ahead feature without increasing the time complexity associated with computation of an optimistic cost table (OCT). The calculated value is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on an OCT that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generated graphs with various characteristics and graphs of real-world applications show that the PEFT algorithm outperforms the state-of-the-art list-based algorithms for heterogeneous systems in terms of schedule length ratio, efficiency, and frequency of best results.
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
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
NP-complete scheduling problems
Ullman, J. D. (1975) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(75)80008-0 · Cited by 1,452
Pegasus: A Framework for Mapping Complex Scientific Workflows onto Distributed Systems
Deelman, E., Singh, G., Su, M.-H., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Berriman, G. B., Good, J., et al. (2005) · Scientific Programming · doi:10.1155/2005/128026 · Cited by 1,222
Computer and job-shop scheduling theory
Coffman, E. G., & Bruno, J. L. (1976) · Medical Entomology and Zoology · Cited by 1,107
Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
Maheswaran, M., Ali, S., Siegel, H. J., Hensgen, D., & Freund, R. F. (1999) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1999.1581 · Cited by 819
Brown, D. A., Brady, P. R., Dietz, A., Cao, J., Johnson, B., & McNabb, J. (2007) · Springer eBooks · doi:10.1007/978-1-84628-757-2_4 · Cited by 132
Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory
Berriman, G. B., Good, J., Laity, A. C., Bergou, A. J., Jacob, J. C., Katz, D. S., Deelman, E., Kesselman, C., Singh, G., Su, M., et al. (2004) · Astronomical Data Analysis Software and Systems (ADASS) XIII · Cited by 78
Performance Evaluation of List Based Scheduling on Heterogeneous Systems
Arabnejad, H., & Barbosa, J. G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29737-3_49 · Cited by 14
Self-citation
Cited by
Fast Adaptive Task Offloading in Edge Computing Based on Meta Reinforcement Learning
Wang, J., Hu, J., Min, G., Zomaya, A. Y., & Georgalas, N. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3014896 · Cited by 414
Houssein, E. H., Gad, A. G., Wazery, Y. M., & Suganthan, P. N. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100841 · Cited by 355
Chai, F., Zhang, Q., Yao, H., Xin, X., Gao, R., & Guizani, M. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2023.3238771 · Cited by 331
Walia, G. K., Kumar, M., & Gill, S. S. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3338015 · Cited by 279
Goudarzi, M., Palaniswami, M., & Buyya, R. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2021.3123165 · Cited by 155
Metadata
- Authors
- Arabnejad, H., & Barbosa, J. G.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2014-03
- Volume
- 25
- Issue
- 3
- Pages
- 682-694
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2106076593
- Cited by
- 653
- References
- 9
- FWCI
- 46.62
- 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: List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table. https://app.cochat.ai/papers/10.1109/tpds.2013.57
- The paper
- Arabnejad, H., & Barbosa, J. G. (2014). List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2013.57
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.