The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Open accessAbstract
Static scheduling of a program represented by a directed task graph on a multiprocessor system to minimize the program completion time is a well-known problem in parallel processing. Since finding an optimal schedule is an NP-complete problem in general, researchers have resorted to devising efficient heuristics. A plethora of heuristics have been proposed based on a wide spectrum of techniques, including branch-and-bound, integer-programming, searching, graph-theory, randomization, genetic algorithms, and evolutionary methods. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. Since these algorithms are based on diverse assumptions, they differ in their functionalities, and hence are difficult to describe in a unified context. We propose a taxonomy that classifies these algorithms into different categories. We consider 27 scheduling algorithms, with each algorithm explained through an easy-to-understand description followed by an illustrative example to demonstrate its operation. We also outline some of the novel and promising optimization approaches and current research trends in the area. Finally, we give an overview of the software tools that provide scheduling/mapping functionalities.
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
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
Srinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180
Bounds for Certain Multiprocessing Anomalies
Graham, R. L. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb01709.x · Cited by 1,647
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
Introduction to parallel computing: design and analysis of algorithms
Kumar, V., Grama, A. Y., Gupta, A., & Karypis, G. (1994) · Benjamin-Cummings Publishing Co., Inc. eBooks · Cited by 1,210
Dally, W. J. (1992) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.127260 · Cited by 1,156
Computer and job-shop scheduling theory
Coffman, E. G., & Bruno, J. L. (1976) · Medical Entomology and Zoology · Cited by 1,107
A taxonomy of scheduling in general-purpose distributed computing systems
Casavant, T. L., & Kuhl, J. G. (1988) · IEEE Transactions on Software Engineering · doi:10.1109/32.4634 · Cited by 976
Parallel Sequencing and Assembly Line Problems
Hu, T. C. (1961) · Operations Research · doi:10.1287/opre.9.6.841 · Cited by 898
Kwok, Y.-K., & Ahmad, I. (1996) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.503776 · Cited by 812
Self-citationUsing dual approximation algorithms for scheduling problems theoretical and practical results
Hochbaum, D. S., & Shmoys, D. B. (1987) · Journal of the ACM · doi:10.1145/7531.7535 · Cited by 790
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
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
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
Stone, H. S. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.233840 · Cited by 680
A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representation
Cheng, R., Gen, M., & Tsujimura, Y. (1996) · Computers & Industrial Engineering · doi:10.1016/0360-8352(96)00047-2 · Cited by 635
Optimal scheduling for two-processor systems
Coffman, E. G., & Graham, R. L. (1972) · Acta Informatica · doi:10.1007/bf00288685 · Cited by 614
Holland, J. H. (1975) · Cited by 585
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 546
Scheduling independent tasks to reduce mean finishing time
Bruno, J., Coffman, E. G., & Sethi, R. (1974) · Communications of the ACM · doi:10.1145/361011.361064 · Cited by 504
Parallel Computing: Theory and Practice
Quinn, M. J. (1994) · Medical Entomology and Zoology · Cited by 437
Wang, L., Siegel, H. J., Roychowdhury, V. P., & Maciejewski, A. A. (1997) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1392 · Cited by 407
On the granularity and clustering of directed acyclic task graphs
Gerasoulis, A., & Yang, T. (1993) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.242154 · Cited by 288
Genetic-algorithm programming environments
Ribeiro Filho, J. L., Treleaven, P. C., & Alippi, C. (1994) · Computer · doi:10.1109/2.294850 · Cited by 284
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
Forrest, S., & Mitchell, M. (1994) · Machine Learning · doi:10.1007/bf00993046 · Cited by 217
Deterministic Processor Scheduling
Gonzalez, M. J. (1977) · ACM Computing Surveys · doi:10.1145/356698.356700 · Cited by 216
A Review of the Placement and Quadratic Assignment Problems
Hanan, M., & Kurtzberg, J. M. (1972) · SIAM Review · doi:10.1137/1014035 · Cited by 169
Models of machines and computation for mapping in multicomputers
Norman, M. G., & Thanisch, P. (1993) · ACM Computing Surveys · doi:10.1145/158439.158908 · Cited by 168
Critical path analysis for the execution of parallel and distributed programs
Yang, C., & Miller, B. P. (2003) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/dcs.1988.12538 · Cited by 165
An introduction to randomized algorithms
Karp, R. M. (1991) · Discrete Applied Mathematics · doi:10.1016/0166-218x(91)90086-c · Cited by 122
Optimization and approximation
Krabs, W. (1979) · Cited by 119
Static and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel Architectures
Menascé, D. A., Saha, D., PORTO, S. C. D. S., Almeida, V. A. F., & Tripathi, S. K. (1995) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1995.1085 · Cited by 119
Scheduling Graphs on Two Processors
Sethi, R. (1976) · SIAM Journal on Computing · doi:10.1137/0205005 · Cited by 78
An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
Kaufman, M. T. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223825 · Cited by 57
A vertically layered allocation scheme for data flow systems
Lee, B., Hurson, A. R., & Feng, T.-Y. (1991) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(91)90042-8 · Cited by 51
High-performance algorithms for compile-time scheduling of parallel processors
Kwok, Y. R. (1997) · doi:10.14711/thesis-b556245 · Cited by 40
Self-citation
Cited by
Pegasus, a workflow management system for science automation
Deelman, E., Vahi, K., Juve, G., Rynge, M., Callaghan, S., Maechling, P. J., Mayani, R., Chen, W., Ferreira da Silva, R., Livny, M., et al. (2015) · Future Generation Computer Systems · doi:10.1016/j.future.2014.10.008 · Cited by 861
“This well-known, DAG based declarative approach has been used extensively to represent computations from single processor systems, to multi-CPU and multi-core systems, and databases [9] [10] [11] [12] [13] [14].”
Method(2010) · Springer eBooks · doi:10.1007/978-1-4419-6524-0 · Cited by 519
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
Gordon, M. I., Thies, W., & Amarasinghe, S. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168877 · Cited by 512
Xu, Y., Li, K., Hu, J., & Li, K. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.122 · Cited by 390
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
Metadata
- Authors
- Kwok, Y.-K., & Ahmad, I.
- Venue
- ACM Computing Surveys
- Published
- 1999-12
- Volume
- 31
- Issue
- 4
- Pages
- 406-471
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2040466547
- Cited by
- 1,314
- References
- 45
- FWCI
- 14.76
- Type
- journal article
- Language
- en
- Open access
- bronze
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.