D. Cheriton, S. S. Muchnick, H. Sayani, R. T. Tomlinson, R. G. Ward, Darrell Ward
Operating system command languages are addressed at the design level with the man-machine interface receiving considerable attention. Special attention is directed toward command languages for timesharing computer systems, again with emphasis placed on the interactions between the individual terminal user and the timesharing computer system. The papers addressing timesharing command languages identify several features important to the ongoing standardization efforts in this key area. In addition, the session contains a paper describing a high level language approach toward job control languages.
{"title":"Sigops(Paper Session)","authors":"D. Cheriton, S. S. Muchnick, H. Sayani, R. T. Tomlinson, R. G. Ward, Darrell Ward","doi":"10.1145/800191.805616","DOIUrl":"https://doi.org/10.1145/800191.805616","url":null,"abstract":"Operating system command languages are addressed at the design level with the man-machine interface receiving considerable attention. Special attention is directed toward command languages for timesharing computer systems, again with emphasis placed on the interactions between the individual terminal user and the timesharing computer system. The papers addressing timesharing command languages identify several features important to the ongoing standardization efforts in this key area. In addition, the session contains a paper describing a high level language approach toward job control languages.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124393837","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}
R. Austing, M. Mulder, N. Gibbs, Susan Brewer, G. Engel
This panel will present the current work of the ACM curriculum committee on computer science (C3S), and the model curriculum subcommittee of the education committee of the IEEE computer society. Common ground between the reports of the two groups will be identified, and areas where the reports diverge from each other, and from earlier curriculum reports, will be discussed.
{"title":"SIGCSE (Panel Session)","authors":"R. Austing, M. Mulder, N. Gibbs, Susan Brewer, G. Engel","doi":"10.1145/800191.805548","DOIUrl":"https://doi.org/10.1145/800191.805548","url":null,"abstract":"This panel will present the current work of the ACM curriculum committee on computer science (C3S), and the model curriculum subcommittee of the education committee of the IEEE computer society. Common ground between the reports of the two groups will be identified, and areas where the reports diverge from each other, and from earlier curriculum reports, will be discussed.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958516","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}
This session focuses on the continuing effort to develop automatic techniques for transforming a specification of “what” is to be done into a specification of “how” the “what” is to be done. One presentation deals with programming tasks, where the results of the transformation are executable computer programs. The other with tasks being carried out by people or organizations, where the results of the transformation are plans and schedules.
{"title":"Automatic synthesis—programs and plans","authors":"C. Green, R. Fikes, M. Kay","doi":"10.1145/800191.805531","DOIUrl":"https://doi.org/10.1145/800191.805531","url":null,"abstract":"This session focuses on the continuing effort to develop automatic techniques for transforming a specification of “what” is to be done into a specification of “how” the “what” is to be done. One presentation deals with programming tasks, where the results of the transformation are executable computer programs. The other with tasks being carried out by people or organizations, where the results of the transformation are plans and schedules.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127126667","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}
It has been suggested that architecture which suits the requirements of high-level languages will relieve the difficulties. High-level languages have developed out of the current milieu and possess their own share of primitiveness and inflexibility. Moreover, they require computer users to have expert skill at rendering information-processing problems into algorithmic form. It has been suggested that all current architecture, languages, and systems be discarded in favor of new systems based on entirely different principles. At least this suggestion doesn't inherently propagate the mistakes of the past. On what new set of principles should computing be based? Before we can answer, there must be some agreement about what objectives are to be sought through new computing machinery.
{"title":"Software implications on future architecture designs","authors":"S. Habib","doi":"10.1145/800191.805583","DOIUrl":"https://doi.org/10.1145/800191.805583","url":null,"abstract":"It has been suggested that architecture which suits the requirements of high-level languages will relieve the difficulties. High-level languages have developed out of the current milieu and possess their own share of primitiveness and inflexibility. Moreover, they require computer users to have expert skill at rendering information-processing problems into algorithmic form.\u0000 It has been suggested that all current architecture, languages, and systems be discarded in favor of new systems based on entirely different principles. At least this suggestion doesn't inherently propagate the mistakes of the past. On what new set of principles should computing be based? Before we can answer, there must be some agreement about what objectives are to be sought through new computing machinery.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127395700","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}
An algorithm is presented which dynamically clusters pages of a problem program based on its post program behavior (i.e. reference string patterns) in a demand paged virtual memory environment. The objective of this algorithm is to minimize the number of page faults during execution, while at the same time use memory page frames efficiently. Dynamic clusters of “time and reference” related pages are built during a program's execution time. The Modified Locality Matrix Model is used to determine inherent program locality and to predict independent dynamic program behavior, separating instruction from data references. Furthermore, strength coefficients between weakly or loosely coupled clusters are used to refine the cluster population, identify cluster transitions, as well as indicate the behavior of the cluster formations.
{"title":"A Modified Locality Matrix Model (MLMM) - dynamic clustering in a demand paging environment","authors":"U. Pooch, D. M. Burris","doi":"10.1145/800191.805612","DOIUrl":"https://doi.org/10.1145/800191.805612","url":null,"abstract":"An algorithm is presented which dynamically clusters pages of a problem program based on its post program behavior (i.e. reference string patterns) in a demand paged virtual memory environment. The objective of this algorithm is to minimize the number of page faults during execution, while at the same time use memory page frames efficiently. Dynamic clusters of “time and reference” related pages are built during a program's execution time. The Modified Locality Matrix Model is used to determine inherent program locality and to predict independent dynamic program behavior, separating instruction from data references. Furthermore, strength coefficients between weakly or loosely coupled clusters are used to refine the cluster population, identify cluster transitions, as well as indicate the behavior of the cluster formations.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126375491","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 length equation for programs, initially suggested by M.H. Halstead, has been studied and experimentally verified by several independent investigators. The sets of programs tested have ranged over a variety of programming languages and program sizes. While such studies have tested the equation for programs taken as a whole, there have been no studies on the length equation when applied to individual modules within a program. This paper provides such a study for a compiler composed of fourteen modules. The length equation is shown to hold for program parts (modules) as well as for program wholes (the total program).
{"title":"Modularization in the pilot compiler and its effect on the length","authors":"Jose C. Ingojo","doi":"10.1145/800191.805665","DOIUrl":"https://doi.org/10.1145/800191.805665","url":null,"abstract":"The length equation for programs, initially suggested by M.H. Halstead, has been studied and experimentally verified by several independent investigators. The sets of programs tested have ranged over a variety of programming languages and program sizes. While such studies have tested the equation for programs taken as a whole, there have been no studies on the length equation when applied to individual modules within a program. This paper provides such a study for a compiler composed of fourteen modules. The length equation is shown to hold for program parts (modules) as well as for program wholes (the total program).","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121805907","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}
This tutorial will consist of two parts. In the first part, Professor Johnston will discuss informal semantic modelling of nested module computations in terms of the contour model. In the second part, Professor Berry will discuss and compare a variety of semantic modelling techniques.
{"title":"SIGPLAN(Tutorial Session)","authors":"D. Berry, J. B. Johnston","doi":"10.1145/800191.805621","DOIUrl":"https://doi.org/10.1145/800191.805621","url":null,"abstract":"This tutorial will consist of two parts. In the first part, Professor Johnston will discuss informal semantic modelling of nested module computations in terms of the contour model. In the second part, Professor Berry will discuss and compare a variety of semantic modelling techniques.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114645458","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 Student Paper Session was created to give students an additional opportunity to participate in the annual ACM conference. The call for papers for the Student Session asked for high quality papers of a theoretical, state-of-the-art or tutorial nature, which had not been previously presented or published. As such, each paper in the Student Session may be of interest to students or professionals. Each paper is to be presented by the author at the conference, and each presented paper will be followed by a period allowing for questions and answers.
{"title":"Student program (Paper Session)","authors":"Jose C. Ingojo, R. Rada, Joe Stiles","doi":"10.1145/800191.805664","DOIUrl":"https://doi.org/10.1145/800191.805664","url":null,"abstract":"The Student Paper Session was created to give students an additional opportunity to participate in the annual ACM conference. The call for papers for the Student Session asked for high quality papers of a theoretical, state-of-the-art or tutorial nature, which had not been previously presented or published. As such, each paper in the Student Session may be of interest to students or professionals. Each paper is to be presented by the author at the conference, and each presented paper will be followed by a period allowing for questions and answers.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114754761","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}
A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.
{"title":"Parallel processing and data driven implementation of a relational data base system","authors":"P. Chang","doi":"10.1145/800191.805606","DOIUrl":"https://doi.org/10.1145/800191.805606","url":null,"abstract":"A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114587949","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}
This is the first in a series of two tutorial sessions featuring lectures from the 1975-76 SIGSAM Lecture Program. Prof. Moses will describe Risch's decision procedure for determining the integrability in closed form of the elementary functions of the calculus together with examples. Prof. Griss will present an improved algorithm for computing the minors of a large sparse matrix of polynomials with emphasis on efficiency and optimal ordering.
{"title":"SIGSAM (Paper Session)","authors":"J. Moses, M. Griss, G. Collins","doi":"10.1145/800191.805631","DOIUrl":"https://doi.org/10.1145/800191.805631","url":null,"abstract":"This is the first in a series of two tutorial sessions featuring lectures from the 1975-76 SIGSAM Lecture Program. Prof. Moses will describe Risch's decision procedure for determining the integrability in closed form of the elementary functions of the calculus together with examples. Prof. Griss will present an improved algorithm for computing the minors of a large sparse matrix of polynomials with emphasis on efficiency and optimal ordering.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832929","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
扫码关注我们
求助内容：
应助结果提醒方式：