Caxton C. Foster
Abstract
This paper describes the internal structure of a time-sharing system in some detail. This system is dedicated to providing remote access, and has a simple file structure. It is intended for use in a university type environment where there are many short jobs that will profit from one- or two-second turnaround. Despite its simplicity, this system can serve as a useful introduction to the problems encountered by the designers of any time-sharing system. Included are a discussion of the command language, the hardware organization toward which the design is oriented, the general internal organization, the command sequences, the CPU scheduler, handling of interrupts, the assignment of core space, execution and control of the user's program, backup storage management, and the handling of errors.
- 1 FOSTER, C. C. "Multiplexing without tears." Paper presented at a DECUS meeting, May 1969. Also available as Technical Note TN/ CS/00010 from Research Computing Center, Engineering Lab Building, Univ. Massachusetts, Amherst, Mass.Google Scholar
- 2 "GAMMA-60, a new concept." Data Processing (Jan.-March 1960).Google Scholar
- 3 ASSELIN, C.; AND FOSTER, C.C. A study of disk usage, in preparation.Google Scholar
Recommendations
Real-time scheduling with resource sharing on heterogeneous multiprocessors
Consider the problem of scheduling a task set of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k ...
Predictable time-sharing for DryadLINQ cluster
ICAC '10: Proceedings of the 7th international conference on Autonomic computingThis paper addresses the scheduling problem that popular data parallel programming systems such as DryadLINQ and MapReduce are facing today. Designing a cluster system in a multi-user environment is challenging because cluster schedulers must satisfy ...
Throughput Enhancement through Selective Time Sharing and Dynamic Grouping
IPDPS '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed ProcessingSpace sharing approaches are widely used in job scheduling for HPC systems. The main drawback of these approaches is the blocking of short jobs, which results in low throughput. The research on gang scheduling has shown the potential of time sharing in ...
Comments