Time-sharing - Wikipedia, the free encyclopedia
Time-sharing is sharing a computing resource among many users by means of multiprogramming and multi-tasking. Its introduction in the 1960s, and emergence as the prominent model of computing in the 1...
en.wikipedia.org/wiki/Time-sharing
Incompatible Timesharing System - Wikipedia, the free encyclopedia
ITS , the Incompatible Timesharing System (named in comparison with the Compatible Time-Sharing System also in use at MIT), was an early, revolutionary, and influential time-sharing operating syste...
en.wikipedia.org/wiki/Incompatible_Timesharing_System
The development of new large scale time-sharing systems has raised a number of problems for computation center management. Not only is it necessary to develop an appropriate hardware configuration for these systems, but appropriate software adjustments must be made.
portal.acm.org/citation.cfm?id=363436
This paper presents one illustration to show how the concepts of fairness could be incorporated in processor scheduling in time sharing systems. First, it looks at some shortcomings associated with the round robin scheduler used in the time sharing systems, and then presents a fair version of the round robin scheduler.
portal.acm.org/citation.cfm?id=122141
Ritchie and Thompson's famous Communications of the ACM paper from 1974. An authoritative and technical overview of the operating system.
cm.bell-labs.com/cm/cs/who/dmr/cacm.html
Tom Kurtz then wrote an emulator for the GE-235 hardware, again using True BASIC. This he used to test both the BASIC and Algol systems. He faked the functionality of the DN-30. His simulation accepts only one user at a time.
www.dtss.org/
The time sharing systems are general purpose Unix servers that can be used by anyone with an ISS Unix account. ... Secure shell access is supported by all of the time sharing servers.
www.ncl.ac.uk/iss/unix/timesharing.html www.ncl.ac.uk/iss/unix/timesharing.html
No abstract available. ... Bhat, U. Narayan and Nance, Richard E. (1973) Dynamic Quantum Allocation and Swap-Time Variability in Time-Sharing Operating Systems. Technical Report CS73001-R, Computer Science, Virginia Tech.
eprints.cs.vt.edu/archive/00000740/
Control of conflicting flows in a class of time-sharing algorithms with regard for orientation and readjustment is studied. Probabilistic properties of flows are determined by the Markov environment. Conditions for the existence of a stationary operation mode of the system are determined and interpreted graphically.
www.ingentaconnect.com/content/maik/aurc/2005/00000066/... www.ingentaconnect.com/content/maik/aurc/2005/00000066/00000007/00000152;jsessionid=d1tnsr6cn5f7n.alice?format=print
The paper develops a class of analytical models for large computer time-sharing systems. The models developed allow the various resources of the time-sharing system, such as central processors, paging devices, and mass storage equipment to be represented as independent queueing centers. ... Accession Number : AD0727206...
stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=h... stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0727206