The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Deterministic Processor Scheduling
Open accessAbstract
This paper surveys the deterministic scheduling of jobs m uniprocessor, multiprocessor, and job-shop environments.The survey begins with a brief introduction to the representation of task or job sets, followed by a discussion of classification categories.These categories include number of processors, task interruptlbility, job periodicity, deadlines, and number of resources.Results are given for single-processor schedules in job-shop and multIprogramming environments, flow-shop schedules, and multiprocessor schedules.They are stated in terms of optimal constructive algorithms and suboptimal heuristics.In most cases the latter are stated in terms of performance bounds related to optimal results.Annotations for most of the references are provided in the form of a table classifying the referenced studies m terms of various parameters.
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
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
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
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
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Hall, N. G., & Sriskandarajah, C. (1996) · Operations Research · doi:10.1287/opre.44.3.510 · Cited by 842
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
Metadata
- Authors
- Gonzalez, M. J.
- Venue
- ACM Computing Surveys
- Published
- 1977-09
- Volume
- 9
- Issue
- 3
- Pages
- 173-204
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2032859161
- Cited by
- 216
- References
- 2
- FWCI
- 46.10
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Deterministic Processor Scheduling. https://app.cochat.ai/papers/10.1145/356698.356700
- The paper
- Gonzalez, M. J. (1977). Deterministic Processor Scheduling. ACM Computing Surveys. https://doi.org/10.1145/356698.356700
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.