An experimental time-sharing system
Open accessAbstract
It is the purpose of this paper to discuss briefly the need for time-sharing, some of the implementation problems, an experimental timesharing system which has been developed for the contemporary IBM 7090, and finally a scheduling algorithm of one of us (FJC) that illustrates some of the techniques which may be employed to enhance and be analyzed for the performance limits of such a time-sharing system.
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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The MLSA gives processing attention to all processes beginning a new command as quickly as possible.
“In this manner the MLSA gives processing attention to all processes as quickly as possible that are beginning a new command.”
From Bias in computer systems (1996) · cites this paper as Corbato et al. 1962
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 9
- Strachey, C, "Time Sharing in Large Fast Computers," Proceedings of the International Conference on Information Processing, UNESCO (June, 1959), Paper B.2.19.
- Licklider, J. c. R., "Man-Computer Symbiosis," IRE Transactions on Human Factors in Electronics, HFE-1, No. 1 (March, 1960), 4-11.
- Codd, E. F., "Multiprogram Scheduling," Communications of the ACM, 3, 6 (June, 1960), 347-350.
- Brown, G., Licklider, J. C. R., McCarthy, J., and Periis, A., lectures given spring, 1961, Management and the Computer of the Future, (to be published by the M.I.T. Press, March, 1962).
- Corbato, F. J., "An Experimental Time- Sharing System," Proceedings of the IBM University Director's Conference, July, 1961 (to be pub- lished).
- Schmitt, W. F., Tonik, A. B., "Sympa- thetically Programmed Computers," Proceedings of the International Conference on information Processing, UNESCO, (June, 1959) Paper B.2.18.
- Heller, J., "Sequencing Aspects of Multiprogramming," Journal of the ACM, 8, 3 (July, 1961), 426-439.
- Leeds, H. D., Weinberg, G. M., "Multi- programming," Computer Programming Fundamentals, 356-359, McGraw-Hill (1961).
- Teager, H. M., "Real-Time Time-Shared Computer Project," Communications of the ACM, 5, 1 (January, 1962) Research Summaries, 62.
Cited by
Sorted by citations
Friedman, B., & Nissenbaum, H. (1996) · ACM Transactions on Information Systems · doi:10.1145/230538.230561 · Cited by 1,203 · see citing works
AgentRM: An OS-Inspired Resource Manager for LLM Agent Systems
She, J. (2026) · arXiv · doi:10.48550/arxiv.2603.13110
“1) Multi-Level Feedback Queue (MLFQ): We implement a three-level MLFQ inspired by Corbat´o’s CTSS [4] and Linux’s Completely Fair Scheduler (CFS) [5]: • Queue 0 (Interactive): User-facing messages with highest priority • Queue 1 (Sub-agent): Computational tasks spawned by agents • Queue 2…”
- Authors
- Corbató, F. J., Merwin-Daggett, M., & Daley, R. C.
- Affiliations
- Massachusetts Institute of Technology (US)
- Venue
- Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring)
- Publisher
- ACM Press
- Published
- 1962
- Pages
- 335
- OpenAlex
- W2141653733
- Cited by
- 234
- References
- 0
- Citations by year
- 2025: 3 · 2024: 7 · 2023: 6 · 2022: 2 · 2021: 23 · 2020: 3 · 2019: 9 · 2018: 7 · 2017: 10 · 2016: 3 · 2015: 12 · 2014: 10 · 2013: 5 · 2012: 6
- FWCI
- 3.57
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- AFIPS Spring Joint Computer Conference (SJCC) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Hardware and Architecture › Real-Time Systems Scheduling
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed and Parallel Computing Systems
- Keywords
- time-sharing, IBM 7090, operating system implementation
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
