The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
An incremental genetic algorithm approach to multiprocessor scheduling
Open accessAbstract
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. Our approach requires minimal problem specific information and no problem specific operators or repair mechanisms. Key features of our system include a flexible, adaptive problem representation and an incremental fitness function. Comparison with traditional scheduling methods indicates that the GA is competitive in terms of solution quality if it has sufficient resources to perform its search. Studies in a nonstationary environment show the GA is able to automatically adapt to changing targets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Kwok, Y.-K., & Ahmad, I. (1999) · ACM Computing Surveys · doi:10.1145/344588.344618 · Cited by 1,314
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
Messy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
Parallel Sequencing and Assembly Line Problems
Hu, T. C. (1961) · Operations Research · doi:10.1287/opre.9.6.841 · Cited by 898
An Investigation of Niche and Species Formation in Genetic Function Optimization
Deb, K., & Goldberg, D. E. (1989) · international conference on Genetic algorithms · Cited by 828
Memory enhanced evolutionary algorithms for changing optimization problems
Branke, J. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785502 · Cited by 743
A genetic algorithm for multiprocessor scheduling
Hou, E. S. H., Ansari, N., & Ren, H. (1994) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.265940 · Cited by 683
Relative Building-Block Fitness and the Building-Block Hypothesis
Forrest, S., & Mitchell, M. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50013-1 · Cited by 363
Biases in the crossover landscape
Eshelman, L. J., Caruana, R. A., & Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 358
Nonstationary function optimization using genetic algorithm with dominance and diploidy
Goldberg, D. E., & Smith, R. E. (1987) · international conference on Genetic algorithms · Cited by 298
Langdon, W. B., & Poli, R. (1998) · Soft Computing in Engineering Design and Manufacturing · doi:10.1007/978-1-4471-0427-8_2 · Cited by 203
Scheduling multiprocessor tasks with genetic algorithms
Correa, R. C., Ferreira, A., & Rebreyend, P. (1999) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.790600 · Cited by 192
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms.
Harik, G. R. (1997) · Deep Blue (University of Michigan) · Cited by 186
Multi-objective optimization by means of the thermodynamical genetic algorithm
Kita, H., Yabumoto, Y., Mori, N., & Nishikawa, Y. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61723-x_1014 · Cited by 146
Evolvability in dynamic fitness landscapes: a genetic algorithm approach
Grefenstette, J. J. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.785524 · Cited by 132
Compressed Introns in a Linkage Learning Genetic Algorithm
Lobo, F. G., Deb, K., Goldberg, D. E., Harik, G. R., & Wang, L. (1998) · Cited by 36
Cited by
Workflow Scheduling Algorithms for Grid Computing
Yu, J., Buyya, R., & Ramamohanarao, K. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-69277-5_7 · Cited by 388
Workflow scheduling in cloud: a survey
Wu, F., Wu, Q., & Tan, Y. (2015) · The Journal of Supercomputing · doi:10.1007/s11227-015-1438-4 · Cited by 260
SwapAdvisor: Pushing Deep Learning Beyond the GPU Memory Limit via Smart Swapping
Huang, C.-C., Jin, G., & Li, J. (2020) · Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3373376.3378530 · Cited by 158
Metadata
- Authors
- Wu, A. S., Yu, H., Jin, S., Lin, K.-C., & Schiavone, G.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2004-09
- Volume
- 15
- Issue
- 9
- Pages
- 824-834
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2112998751
- Cited by
- 252
- References
- 20
- FWCI
- 47.17
- Type
- journal article
- Language
- en
- Open access
- green
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
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.