It is the purpose of this paper to discuss briefly the need for time-sharing, some of the implementation problems, an experimental time-sharing 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.
KeywordsUser Program Secondary Memory Core Memory Storage Allocation Supervisor Program
Unable to display preview. Download preview PDF.
- 1.Strachey, C, “Time Sharing in Large Fast Computers,” Proceedings of the International Conference on Information Processing, UNESCO (June, 1959), Paper B.2.19.Google Scholar
- 3.Brown, G., Licklider, J. C. R., McCarthy, J., and Pedis, A., Lectures given spring, 1961, Management and the Computer of the Future, (to be published by the M.I.T. Press, March, 1962).Google Scholar
- 4.Corbatö, F. J., “An Experimental Time-Sharing System,” Proceedings of the IBM University Director’s Conference, July, 1961 (to be published).Google Scholar
- 5.Schmitt, W. F., Tonik, A. B., “Sympathetically Programmed Computers,” Proceedings of the International Conference on Information Procesing, UNESCO, (June, 1959) Paper B.2.18.Google Scholar
- 8.Leeds, H. D., Weinberg, G. M., “Multi-programming,” Computer Programming Fundamentals, 356–359, McGraw-Hill (1961).Google Scholar
- 10.Teager, H. M., McCarthy, J., “Time-Shared Program Testing,” paper delivered at the 14th National Meeting of the ACM (not published).Google Scholar