{"title":"分时系统仿真的一种方法","authors":"N. Nielsen","doi":"10.1145/1465611.1465667","DOIUrl":null,"url":null,"abstract":"The past several years have seen the development of time-sharing capability on a variety of second generation computers. For the most part, though, these projects should really be termed experimental efforts. Because the systems were providing a broad or general purpose service, it was not possible to take advantage of the many shortcuts employed by the more specific purpose systems such as those for airline reservations. No assumptions could be made about the size, running time or bug-free condition of the programs to be executed.","PeriodicalId":265740,"journal":{"name":"AFIPS '67 (Fall)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1967-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An approach to the simulation of a time-sharing system\",\"authors\":\"N. Nielsen\",\"doi\":\"10.1145/1465611.1465667\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The past several years have seen the development of time-sharing capability on a variety of second generation computers. For the most part, though, these projects should really be termed experimental efforts. Because the systems were providing a broad or general purpose service, it was not possible to take advantage of the many shortcuts employed by the more specific purpose systems such as those for airline reservations. No assumptions could be made about the size, running time or bug-free condition of the programs to be executed.\",\"PeriodicalId\":265740,\"journal\":{\"name\":\"AFIPS '67 (Fall)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1967-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '67 (Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1465611.1465667\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '67 (Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1465611.1465667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An approach to the simulation of a time-sharing system
The past several years have seen the development of time-sharing capability on a variety of second generation computers. For the most part, though, these projects should really be termed experimental efforts. Because the systems were providing a broad or general purpose service, it was not possible to take advantage of the many shortcuts employed by the more specific purpose systems such as those for airline reservations. No assumptions could be made about the size, running time or bug-free condition of the programs to be executed.