ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810358
Shi-Kuo Chang
{"title":"A heuristic procedure for distributed computer system design","authors":"Shi-Kuo Chang","doi":"10.1145/800181.810358","DOIUrl":"https://doi.org/10.1145/800181.810358","url":null,"abstract":"A model of a distributed computer system for transaction processing is described. The system configuration problem is formulated as a problem of determining transaction allocation, routing, processor allocation and line allocation to satisfy certain performance requirements and design constraints. A heuristic design procedure is described. Topics for further investigation are discussed.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126799916","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810331
R. Griswold
{"title":"Extensible pattern matching in SNOBOL4","authors":"R. Griswold","doi":"10.1145/800181.810331","DOIUrl":"https://doi.org/10.1145/800181.810331","url":null,"abstract":"Although the string pattern-matching facilities of SNOBOL4 are the most powerful of those of any widely used programming language, they suffer both from complexity and lack of a mechanism for defining new scanning procedures. This paper describes a definitional mechanism that provides extensibility for the existing facilities in which programmer-defined scanning procedures are written as co-routines at the source-language level. The result provides a substantial increase in power as well as the potential for simplifying the existing language. The relationship of this new facility to the present language is discussed, as are implications for more extensive language changes.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127230788","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810298
Douglass Cassell, W. Mayhew
{"title":"The current state of the art in microprocessor software","authors":"Douglass Cassell, W. Mayhew","doi":"10.1145/800181.810298","DOIUrl":"https://doi.org/10.1145/800181.810298","url":null,"abstract":"Aspects of microprocessor programming are described and compared to the programming of conventional computers. The effects of microprocessor architectures and their current state of development are related to commonly used utility and language support software and to trends in the availability of these programs.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121870842","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810349
R. Thayer
{"title":"The Air Force software manager","authors":"R. Thayer","doi":"10.1145/800181.810349","DOIUrl":"https://doi.org/10.1145/800181.810349","url":null,"abstract":"The U.S. Air Force has come a long way in its approach to the management of large Automatic Data Processing (ADP) projects. However, there are still many unsolved problems, particularly in the software management area.\u0000 This short paper traces the evolution of software management of large computer developments in the Air Force from the SAGE Command and Control System in 1954 to the present. This paper also outlines what has been accomplished, what is on the horizon and what further requirements are necessary to provide better software management.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122719926","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810336
J. Moses
{"title":"Current capabilities of the MACSYMA system","authors":"J. Moses","doi":"10.1145/800181.810336","DOIUrl":"https://doi.org/10.1145/800181.810336","url":null,"abstract":"A short survey of various features of the MACSYMA algebraic manipulation system is given. This system has been under development at M.I.T. since 1969 and contains over 175K words of compiled code at the present time.\u0000 The MACSYMA system has been under development at Project MAC, M.I.T. since 1969. The system has a wide range of capabilities. It is comprised of over 50 modules and over 175K words of compiled LISP code. It is currently available on a PDP-10 at M.I.T. which is accessed over the ARPA network and on various MULTICS systems. Conversion to other PDP-10 systems is under way. Over 40 articles and reports have been written so far which acknowledge use of the system.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125103051","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810312
Robert L. Hedges, U. Pooch
{"title":"A measure for program locality in demand paging","authors":"Robert L. Hedges, U. Pooch","doi":"10.1145/800181.810312","DOIUrl":"https://doi.org/10.1145/800181.810312","url":null,"abstract":"The concept of information flow and information theory, adapted from the management sciences, is utilized to provide a measure of program locality that could be used to analyze, compare, and extend various replacement algorithms. A Locality Matrix Model (LMM) is derived and analyzed in the areas of page fault reductions and the determination of memory requirements to contain any inherent program locality. This approach of dynamic clustering page references is used to predict stationary behavior of the reference string.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123350603","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810265
A. F. Cardenas
{"title":"SIGBDP 3 Performance measurement and data base design (Panel Discussion)","authors":"A. F. Cardenas","doi":"10.1145/800181.810265","DOIUrl":"https://doi.org/10.1145/800181.810265","url":null,"abstract":"Good data base design is of increasing concern to systems designers and data base administrators. The rapidly increasing use of data base management systems to support an increasing number of dynamic information systems has brought data base performance measurement and evaluation into the limelight. The task is to provide as easily as possible the most cost effective data base structures (logical-physical structures, physical access paths, storage mappings, etc.) to support the given logical system requirements while meeting a number of constraints such as integrity, flexibility, etc.\u0000 In environments where data base contents and transaction traffic are changing, the determination of the best data base structures is a complex task, particularly with the multiple criteria of access time, storage utilization, etc. This session strives to present and discuss quantitative-oriented performance experiences, experimental results, insights and tools available toward good data base design in actual systems and situations (particularly IMS, System 2000, and ADABAS).","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131901333","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810272
Gary Carlson
{"title":"SIGBDP 8 (Panel Discussion): Performance measurement","authors":"Gary Carlson","doi":"10.1145/800181.810272","DOIUrl":"https://doi.org/10.1145/800181.810272","url":null,"abstract":"Three people active in the field of measurement of computer performance will share their views of what measurement is doing to us. Is it improving the quality of life or anything else? Is it causing more problems than solutions?\u0000 The panelists will explore who should be doing monitoring, what should really be measured, and for what purpose.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"99 45","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120823253","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810313
D. Grit, R. Kain
{"title":"An analysis of a use bit page replacement algorithm","authors":"D. Grit, R. Kain","doi":"10.1145/800181.810313","DOIUrl":"https://doi.org/10.1145/800181.810313","url":null,"abstract":"The use bit algorithms have been proposed as approximations to least-recently-used page replacement algorithms. In this paper we describe two approximate Markov models and demonstrate their accuracy by comparison with simulations of paging behavior derived from traces of programs for the CDC 6600 computer. The use bit algorithm is found to be a good approximation to the least-recently-used algorithm. Furthermore, the models give reasonable predictions of the missing page rates.","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123318393","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}
ACM '75Pub Date : 1900-01-01DOI: 10.1145/800181.810271
Gopal K. Kapur
{"title":"SIGBDP 7 developing user-oriented business systems(Panel Discussion)","authors":"Gopal K. Kapur","doi":"10.1145/800181.810271","DOIUrl":"https://doi.org/10.1145/800181.810271","url":null,"abstract":"Have we lost the “human touch?”\u0000 Almost as a matter of course we grasp the latest technology and hurriedly search for places in our organizations where we may apply it. As our systems have grown larger and more complex they involve more and more people - to a greater extent then ever before.\u0000 The recent SHARE SILT report says “The percentage of the U.S. labor force that depends on the availability of data processing services to accomplish its daily work will grow from 30% today to 70% by 1985. Ultimately, the mission of the data processing industry is to serve these end users; a substantial fraction of these end users will interact directly with data processing systems, specifying both the data and the functions to be performed on that data. Very major improvements are needed in the quality, reliability, availability, and adaptability of the systems they will use.”","PeriodicalId":447373,"journal":{"name":"ACM '75","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128374235","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号
