The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Allocating hard real-time tasks: An NP-Hard problem made easy
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
LIU, C. L., & LAYLAND, J. W. (2002) · Readings in Hardware/Software Co-Design · doi:10.1016/b978-155860702-6/50016-8 · Cited by 3,233
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
*13 Simulated Annealing and Boltzmann Machines
(1993) · Neural Network Learning and Expert Systems · doi:10.7551/mitpress/4931.003.0017 · Cited by 1,637
The rate monotonic scheduling algorithm: exact characterization and average case behavior
Lehoczky, J. P., Sha, L., & Ding, Y. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1989.63567 · Cited by 1,477
On the complexity of fixed-priority scheduling of periodic, real-time tasks
Leung, J. Y.-T., & Whitehead, J. (1982) · Performance Evaluation · doi:10.1016/0166-5316(82)90024-4 · Cited by 1,154
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
Audsley, N., Burns, A., Richardson, M. F., & Wellings, A. J. (1991) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)51283-5 · Cited by 497
Self-citationScheduling hard real-time systems: a review
Burns, A. (1991) · Software Engineering Journal · doi:10.1049/sej.1991.0015 · Cited by 247
Self-citation
Cited by
Applying new scheduling theory to static priority pre-emptive scheduling
Audsley, N., Burns, A., Richardson, M., Tindell, K., & Wellings, A. J. (1993) · Software Engineering Journal · doi:10.1049/sej.1993.0034 · Cited by 1,106
Self-citationHolistic schedulability analysis for distributed hard real-time systems
Tindell, K., & Clark, J. (1994) · Microprocessing and Microprogramming · doi:10.1016/0165-6074(94)90080-9 · Cited by 759
Self-citationMetaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Real Time Scheduling Theory: A Historical Perspective
Sha, L., Abdelzaher, T., årzén, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., & Mok, A. K. (2004) · Real-Time Systems · doi:10.1023/b:time.0000045315.61234.1e · Cited by 614
Self-citationAn extendible approach for analyzing fixed priority hard real-time tasks
Tindell, K. W., Burns, A., & Wellings, A. J. (1994) · Real-Time Systems · doi:10.1007/bf01088593 · Cited by 565
Self-citationAn Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem
De Giovanni, L., & Pezzella, F. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.01.008 · Cited by 345
Real-time computing: a new discipline of computer science and engineering
Shin, K. G., & Ramanathan, P. (1994) · Proceedings of the IEEE · doi:10.1109/5.259423 · Cited by 305
Software Architecture Optimization Methods: A Systematic Literature Review
Aleti, A., Buhnova, B., Grunske, L., Koziolek, A., & Meedeniya, I. (2013) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2012.64 · Cited by 293
Metadata
- Authors
- Tindell, K. W., Burns, A., & Wellings, A. J.
- Venue
- Real-Time Systems
- Published
- 1992-06
- Volume
- 4
- Issue
- 2
- Pages
- 145-165
- ISSN
- 0922-6443 (ISSN-L)
- 1573-1383
- OpenAlex
- W2077606348
- Cited by
- 369
- References
- 12
- FWCI
- 16.39
- 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
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.