Most of us consider a well-engineered product to be one which is structurally sound; which communicates with its environment in a predictable, well-disciplined manner; which has been thoroughly tested; and which is reliable and easily maintained. In any engineering field, the structural philosophy, design disciplines, and checkout methods which yield such a product are called "good engineering practices." Software engineering is the application of good engineering practice to the design, implementation and final checkout of large programs. The result of effective software engineering should be: (1) The production of a correct program (certifiable) (2) The availability of means of efficiently determining the correctness of a program (certification) (3) The ability to modify a program so that recertification is possible.
{"title":"LOGOS and the software engineer","authors":"C. W. Rose","doi":"10.1145/1479992.1480034","DOIUrl":"https://doi.org/10.1145/1479992.1480034","url":null,"abstract":"Most of us consider a well-engineered product to be one which is structurally sound; which communicates with its environment in a predictable, well-disciplined manner; which has been thoroughly tested; and which is reliable and easily maintained. In any engineering field, the structural philosophy, design disciplines, and checkout methods which yield such a product are called \"good engineering practices.\" Software engineering is the application of good engineering practice to the design, implementation and final checkout of large programs. The result of effective software engineering should be:\u0000 (1) The production of a correct program (certifiable)\u0000 (2) The availability of means of efficiently determining the correctness of a program (certification)\u0000 (3) The ability to modify a program so that recertification is possible.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131660558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The best way to begin this paper is by explaining its title. I take "supercomputers" to mean those computers which are the biggest, fastest and most complicated available. And by "ordinary" users I mean "nonsuper" users, i.e., people who have had at most an introductory programming course. The point of this paper is to discuss how computer system design and organization could (and I believe should) proceed in the next ten or twenty years.
{"title":"Supercomputers for ordinary users","authors":"D. Kuck","doi":"10.1145/1479992.1480021","DOIUrl":"https://doi.org/10.1145/1479992.1480021","url":null,"abstract":"The best way to begin this paper is by explaining its title. I take \"supercomputers\" to mean those computers which are the biggest, fastest and most complicated available. And by \"ordinary\" users I mean \"nonsuper\" users, i.e., people who have had at most an introductory programming course. The point of this paper is to discuss how computer system design and organization could (and I believe should) proceed in the next ten or twenty years.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121682664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For years, printed output was the only means of communication between the computer and man. This limitation dictated that only the technically skilled could interpret the reams of computer printout with its lists of numbers and specialized codes.
{"title":"Computer animation of a bicycle simulation","authors":"J. Lynch, R. D. Roland","doi":"10.1145/1479992.1480013","DOIUrl":"https://doi.org/10.1145/1479992.1480013","url":null,"abstract":"For years, printed output was the only means of communication between the computer and man. This limitation dictated that only the technically skilled could interpret the reams of computer printout with its lists of numbers and specialized codes.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Some of our viewpoints on array logics follow. (a) The unit cell of the array should have as high logical abilities as possible. (b) The number of interconnecting wires are limited so they should carry as much information per wire as possible. (c) There is no reason for that the noise immunity inside the array logic must be as high as outside the array, for example, as that required for inter peripherals.
{"title":"On an extended threshold logic as a unit cell of array logics","authors":"R. Mori","doi":"10.1145/1479992.1480041","DOIUrl":"https://doi.org/10.1145/1479992.1480041","url":null,"abstract":"Some of our viewpoints on array logics follow.\u0000 (a) The unit cell of the array should have as high logical abilities as possible.\u0000 (b) The number of interconnecting wires are limited so they should carry as much information per wire as possible.\u0000 (c) There is no reason for that the noise immunity inside the array logic must be as high as outside the array, for example, as that required for inter peripherals.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132212773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Because the effort required to simulate a computer system is often very great, analysts should consider carefully the probable value of the results prior to embarking on it. Special languages have been created to aid the programmer in reducing the time required to code a simulation, and analysis techniques are available to reduce time requirements in the later phases of a study. Still, unexpected problems usually arise: An effort concludes with a study only partly completed because budgeted resources have been exhausted, or the results may be of less value than anticipated. If the analyst can foresee problems prior to commencing the detailed coding phase of a study, he can avoid many of the problems, mitigate many of the remainder, and allow for the rest in anticipating the payoffs of the effort.
{"title":"Objectives and problems in simulating computers","authors":"T. E. Bell","doi":"10.1145/1479992.1480031","DOIUrl":"https://doi.org/10.1145/1479992.1480031","url":null,"abstract":"Because the effort required to simulate a computer system is often very great, analysts should consider carefully the probable value of the results prior to embarking on it. Special languages have been created to aid the programmer in reducing the time required to code a simulation, and analysis techniques are available to reduce time requirements in the later phases of a study. Still, unexpected problems usually arise: An effort concludes with a study only partly completed because budgeted resources have been exhausted, or the results may be of less value than anticipated. If the analyst can foresee problems prior to commencing the detailed coding phase of a study, he can avoid many of the problems, mitigate many of the remainder, and allow for the rest in anticipating the payoffs of the effort.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116388636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For many years, there has been interest in "program locality" as a phenomenon to be considered in storage allocation. This notion arises from the empirical observation that it is possible to run a program efficiently with only some fraction of its total instruction and data code in main storage at any given time. That virtual memory systems can be made to run at all demonstrates that program locality can be used to advantage; and though it is certainly possible to write a program which violates the principles of locality, it seems one must go out of one's way to do so.
{"title":"Experiments with program locality","authors":"J. R. Spirn, P. Denning","doi":"10.1145/1479992.1480078","DOIUrl":"https://doi.org/10.1145/1479992.1480078","url":null,"abstract":"For many years, there has been interest in \"program locality\" as a phenomenon to be considered in storage allocation. This notion arises from the empirical observation that it is possible to run a program efficiently with only some fraction of its total instruction and data code in main storage at any given time. That virtual memory systems can be made to run at all demonstrates that program locality can be used to advantage; and though it is certainly possible to write a program which violates the principles of locality, it seems one must go out of one's way to do so.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"19 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Bell System's No. 1 Electronic Switching System (No. 1 ESS) was designed for medium-to-large telephone offices. Its performance has been improved radically since first put into service on May 30, 1965, in Succasunna, New Jersey. By June, 1972, some 250 No. 1 ESS offices were in service equipped with over 4 million customer lines.
{"title":"Field evaluation of real-time capability of a large electronic switching system","authors":"W. Jones, S. Tsiang","doi":"10.1145/1479992.1480068","DOIUrl":"https://doi.org/10.1145/1479992.1480068","url":null,"abstract":"The Bell System's No. 1 Electronic Switching System (No. 1 ESS) was designed for medium-to-large telephone offices. Its performance has been improved radically since first put into service on May 30, 1965, in Succasunna, New Jersey. By June, 1972, some 250 No. 1 ESS offices were in service equipped with over 4 million customer lines.","PeriodicalId":262093,"journal":{"name":"AFIPS '72 (Fall, part I)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125901435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：