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}
This tutorial session reviews the state of the art with reference to two major types of retrieval systems, namely, Information Retrieval and Database Management. Each discussant will (1) introduce the basic concepts and terminology of his field, and (2) building on this foundation, provide information about current problem areas and, wherever possible, the indicated solutions. Similarities and differences between the two areas will be evident as a result.
{"title":"Retrieval systems(Tutorial Session): documents and data","authors":"C. Crouch, G. Salton, E. Sibley","doi":"10.1145/800191.805567","DOIUrl":"https://doi.org/10.1145/800191.805567","url":null,"abstract":"This tutorial session reviews the state of the art with reference to two major types of retrieval systems, namely, Information Retrieval and Database Management. Each discussant will (1) introduce the basic concepts and terminology of his field, and (2) building on this foundation, provide information about current problem areas and, wherever possible, the indicated solutions. Similarities and differences between the two areas will be evident as a result.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"30 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":"115073173","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 recent decrease in the cost of graphics hardware has created an expanded potential opportunity for the use of graphic techniques. However, this potential is reduced by a lack of agreement on the software interface for this graphics environment. In almost every forum that discusses graphical techniques, new systems are introduced that are syntactically unique, but semantically very similar2,8,16. One of the major reasons for this proliferation of graphic systems is the large number of possible tradeoffs that exist between the performance parameters of these devices. Each graphics system can be optimized for a limited number of these parameters by adjusting a feature of the system design until the best results are obtained. Where more than one design feature affects a particular performance parameter, the system designer usually selects a single feature for adjustment and restricts the user's ability to modify any others. The users discover that they cannot adequately adjust that graphics system for their particular problem, leading to the creation of yet another graphics system. An evaluation of the techniques that have been used to provide this design factor optimization reveal that applying these techniques in combination provides a greater degree of user control over the graphics environment. This synergetic behavior leads to benefits that can be derived from a graphics system that allows the user a greater variety of implementation options. This flexibility will also allow the user to somewhat compensate for the present lack of a graphics standard. A system that utilizes this methodology is described and examples of its application are shown.
{"title":"The BIG system - synergetic graphics","authors":"C. Quenneville, H. Kriloff","doi":"10.1145/800191.805565","DOIUrl":"https://doi.org/10.1145/800191.805565","url":null,"abstract":"The recent decrease in the cost of graphics hardware has created an expanded potential opportunity for the use of graphic techniques. However, this potential is reduced by a lack of agreement on the software interface for this graphics environment. In almost every forum that discusses graphical techniques, new systems are introduced that are syntactically unique, but semantically very similar2,8,16. One of the major reasons for this proliferation of graphic systems is the large number of possible tradeoffs that exist between the performance parameters of these devices. Each graphics system can be optimized for a limited number of these parameters by adjusting a feature of the system design until the best results are obtained. Where more than one design feature affects a particular performance parameter, the system designer usually selects a single feature for adjustment and restricts the user's ability to modify any others. The users discover that they cannot adequately adjust that graphics system for their particular problem, leading to the creation of yet another graphics system.\u0000 An evaluation of the techniques that have been used to provide this design factor optimization reveal that applying these techniques in combination provides a greater degree of user control over the graphics environment. This synergetic behavior leads to benefits that can be derived from a graphics system that allows the user a greater variety of implementation options. This flexibility will also allow the user to somewhat compensate for the present lack of a graphics standard. A system that utilizes this methodology is described and examples of its application are shown.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"117 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":"114972375","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 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}
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}
This paper presents a design approach and design criteria for the man-machine interface in timesharing systems. A conceptual view of timesharing systems is outlined, focusing on the interface between the user and the capabilities of the system. We consider user needs and requirements for this interface and suggest design guidelines and approaches to meet these needs. Finally, we propose a model on which design and design standardization might be based and briefly sketch a design methodology.
{"title":"Man-machine interface design for timesharing systems","authors":"D. Cheriton","doi":"10.1145/800191.805617","DOIUrl":"https://doi.org/10.1145/800191.805617","url":null,"abstract":"This paper presents a design approach and design criteria for the man-machine interface in timesharing systems. A conceptual view of timesharing systems is outlined, focusing on the interface between the user and the capabilities of the system. We consider user needs and requirements for this interface and suggest design guidelines and approaches to meet these needs. Finally, we propose a model on which design and design standardization might be based and briefly sketch a design methodology.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"21 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":"133885220","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}
In order to minimize the number of page fetches required when multiplying matrices occupying many pages of virtual storage, we consider adapting Strassen-like recursive methods to a paging environment. An algorithm with a theoretically better rate of growth results. Also presented is an algorithm for efficiently converting matrices from row storage form to sub-matrix storage form, thus making more accessible the benefits of algorithms based on sub-matrix storage form which were presented in [5].
{"title":"A note on matrix multiplication in a paging environment","authors":"P. C. Fischer, R. Probert","doi":"10.1145/800191.805516","DOIUrl":"https://doi.org/10.1145/800191.805516","url":null,"abstract":"In order to minimize the number of page fetches required when multiplying matrices occupying many pages of virtual storage, we consider adapting Strassen-like recursive methods to a paging environment. An algorithm with a theoretically better rate of growth results. Also presented is an algorithm for efficiently converting matrices from row storage form to sub-matrix storage form, thus making more accessible the benefits of algorithms based on sub-matrix storage form which were presented in [5].","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"13 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":"129990450","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
扫码关注我们
求助内容：
应助结果提醒方式：