- 1 ANDERSON, G. S., ET AL. Design of a time-sharing system allowing interactive graphics. Proc. ACM 23rd Nat. Conf., 1968, Branden Systems Press, Princeton, N.J., pp. 1--6. Google ScholarDigital Library
- 2 BENSOUSSAN, A., C. W. CLINGEN, AND R. C. DALEY. The MULTICS virtual memory. Proc. Second ACM Symposium on Operating Systems Principles, Princeton, N.J. Oct. 1969. Google ScholarDigital Library
- 3 BRAWN, B. S., AND F. G. GUSTAVSON. Program behaviour in a paging environment. FJCC 1968, 1019-1032.Google Scholar
- 4 DENNING, P. J. Resource allocation in multiprocess computer systems. MAC-TR-50, Ph.D. Th., MIT, 1968. Google ScholarDigital Library
- 5 DENNIS, J. B., AND E. C. VAN HORN. Programming semantics for multiprogrammed computations. Comm. ACM 9, 3 (Mar. 1966), 143-155. Google ScholarDigital Library
- 6 DIJKSTRA, E. W. The structure of the "THE" multiprogramming system. Comm. ACM 11, 5 (May 1968), 341-346. Google ScholarDigital Library
- 7 DIJKSTRA, E. W. Cooperating sequential processes. EWD123, Math. Dept., Technological U., Eindhoven, The Netherlands, 1965. Google ScholarDigital Library
- 8 SALTZER, J. H. Traffic control in a multiplexed computer system. MAC-TR-30, MIT (1966). Google ScholarDigital Library
- 9 WHITFIELD, H. The organization of the University of Edinburgh time-sharing system. International Seminar on Aavanced Programming Systems, vol II, V, Jerusalem (Summer 1968).Google Scholar
- 10 WlRTH, N. On multiprogramming, machine coding, and computer organization. Comm. ACM 12, 9 (Sept. 1969), 489-498. Google ScholarDigital Library
Recommendations
Efficient multiprogramming resource allocation and accounting
Although sometimes thought of as only a component of time-sharing operation, multiprogramming can involve broader questions of resource allocation, since fairness is not required to meet a response criterion. In a multiprogrammed system, it may serve ...
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines
The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
A processor allocation method for time-sharing
A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for ...
Comments