Once the general principles of compilation by semantic attributes have been exposed, it is then demonstrated, with the help of a simple example, how such an approach leads naturally to an amelioration of the generated code without resorting to any special optimization treatment. Also included is the determination of basic blocks of a program, the fundamental elements in code optimization, by the method of attributes. This offers the possibility of formalizing semantically the principal optimization algorithms. To our knowledge this is the very first attempt undertaken to describe optimizing compilers methodically.
{"title":"Semantic attributes and improvement of generated code","authors":"D. Neel, M. Amirchahy","doi":"10.1145/800182.810373","DOIUrl":"https://doi.org/10.1145/800182.810373","url":null,"abstract":"Once the general principles of compilation by semantic attributes have been exposed, it is then demonstrated, with the help of a simple example, how such an approach leads naturally to an amelioration of the generated code without resorting to any special optimization treatment.\u0000 Also included is the determination of basic blocks of a program, the fundamental elements in code optimization, by the method of attributes. This offers the possibility of formalizing semantically the principal optimization algorithms.\u0000 To our knowledge this is the very first attempt undertaken to describe optimizing compilers methodically.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"57 4 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":"116425084","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}
Many routines for solving differential equations require the user to specify an estimate of the initial step size. We introduce a means of estimating an appropriate value automatically. Strong emphasis is placed on the need for scale invariance in making such estimates, and we therefore review the importance of scale and matters equivalent to scale in estimating the order of magnitude of the appropriate starting step size. In this context, we also discuss the response to scale of integrators employing the error per unit step concept of error control and are forced to conclude that our procedure should not be used in such integrators, if the latter should be used at all. We note a special case where the procedure could be badly deceived and suggest an option by which the user can protect himself against this kind of mishap. Test results are cited.
{"title":"The efficient, scale-invariant determination of starting step sizes for high-order integrators","authors":"David C. Williams","doi":"10.1145/1408800.1408837","DOIUrl":"https://doi.org/10.1145/1408800.1408837","url":null,"abstract":"Many routines for solving differential equations require the user to specify an estimate of the initial step size. We introduce a means of estimating an appropriate value automatically. Strong emphasis is placed on the need for scale invariance in making such estimates, and we therefore review the importance of scale and matters equivalent to scale in estimating the order of magnitude of the appropriate starting step size. In this context, we also discuss the response to scale of integrators employing the error per unit step concept of error control and are forced to conclude that our procedure should not be used in such integrators, if the latter should be used at all. We note a special case where the procedure could be badly deceived and suggest an option by which the user can protect himself against this kind of mishap. Test results are cited.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"23 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":"123548926","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}
During the 1969--70 academic year we introduced a course here at USC dealing with the use of computers in the design of digital system. This was probably the first such course of its kind instituted on a regular basis in the United States. The idea for such a course came from my colleagues in the special interests group on Design Automation of the IEEE Computer Group. Their primary goal for such a course was to instill the basic concepts of computer aided design into our new graduates. This paper reviews the major aspects related to this course on computer design. Hopefully, other schools will be motivated to develop similar courses. It is interesting to note that in a recent issue of Spectrum [5], W. R. Beam states that"... every digital designer needs to know something about design automation, even if he's only going to build a single system." For this reason, a book on design automation [1] is one of his eleven essential books for the digital designer's reference and study library.
在1969- 70学年，我们在南加州大学开设了一门课程，是关于计算机在数字系统设计中的应用。这可能是美国第一次定期开设这类课程。开设这样一门课程的想法来自我在IEEE计算机组设计自动化特别兴趣小组的同事。他们开设这门课程的主要目的是向我们的新毕业生灌输计算机辅助设计的基本概念。本文回顾了与计算机设计课程相关的主要方面。希望其他学校也能有动力开发类似的课程。有趣的是，在最近一期的Spectrum b[5]中，W. R. Beam指出“……每个数字设计师都需要了解一些设计自动化的知识，即使他只打算构建一个单一的系统。”出于这个原因，一本关于设计自动化的书b[1]是他的11本数字设计师参考和学习图书馆的基本书籍之一。
{"title":"Curriculum on design automation at the University of Southern California","authors":"M. Breuer","doi":"10.1145/1408800.1408814","DOIUrl":"https://doi.org/10.1145/1408800.1408814","url":null,"abstract":"During the 1969--70 academic year we introduced a course here at USC dealing with the use of computers in the design of digital system. This was probably the first such course of its kind instituted on a regular basis in the United States. The idea for such a course came from my colleagues in the special interests group on Design Automation of the IEEE Computer Group. Their primary goal for such a course was to instill the basic concepts of computer aided design into our new graduates. This paper reviews the major aspects related to this course on computer design. Hopefully, other schools will be motivated to develop similar courses. It is interesting to note that in a recent issue of Spectrum [5], W. R. Beam states that\"... every digital designer needs to know something about design automation, even if he's only going to build a single system.\" For this reason, a book on design automation [1] is one of his eleven essential books for the digital designer's reference and study library.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"14 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":"124063072","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 support of efficient debugging environments for systems software and complete operating systems was one of the initial motivations for virtual machine (VM) systems, such as IBM's VM/370 [2.12]. These systems typically provide a user with a VM which is a functional duplicate of a real computer system and which includes simulated switches, buttons, and lights (console functions) for rudimentary system debugging. In the same way that real console functions proved to be inadequate debugging aids for real machines [15, 18], virtual console functions have proved inadequate for VMs [9]. As a result, a number of more powerful debugging tools have been combined with VMs to yield more flexible debugging systems.
{"title":"Software debugging: the virtual machine approach","authors":"S. Galley, R. Goldberg","doi":"10.1145/1408800.1408806","DOIUrl":"https://doi.org/10.1145/1408800.1408806","url":null,"abstract":"The support of efficient debugging environments for systems software and complete operating systems was one of the initial motivations for virtual machine (VM) systems, such as IBM's VM/370 [2.12]. These systems typically provide a user with a VM which is a functional duplicate of a real computer system and which includes simulated switches, buttons, and lights (console functions) for rudimentary system debugging. In the same way that real console functions proved to be inadequate debugging aids for real machines [15, 18], virtual console functions have proved inadequate for VMs [9]. As a result, a number of more powerful debugging tools have been combined with VMs to yield more flexible debugging systems.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"49 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":"129470315","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 major theoretical presupposition of our model of foreign-policy decision-making is that the beliefs of the decision-makers are central to the study of decision outputs and probably account for much of the variance in international politics. Beliefs represent both the congealed experiences of the decision-maker and his expectations about the decision environment. In the former sense, they are his decisions about the significance of past "events". In the decision-making process the belief system as a whole acts like a template for receiving and channeling information, and for relating possible policy options to perceptions about the intentions and behavior of other nations, as well as to the policy objectives of the decision-maker.
{"title":"The foreign policy decision-maker simulation","authors":"G. Nozicka, G. Bonham, Michael J. Shapiro","doi":"10.1145/1408800.1408831","DOIUrl":"https://doi.org/10.1145/1408800.1408831","url":null,"abstract":"The major theoretical presupposition of our model of foreign-policy decision-making is that the beliefs of the decision-makers are central to the study of decision outputs and probably account for much of the variance in international politics. Beliefs represent both the congealed experiences of the decision-maker and his expectations about the decision environment. In the former sense, they are his decisions about the significance of past \"events\". In the decision-making process the belief system as a whole acts like a template for receiving and channeling information, and for relating possible policy options to perceptions about the intentions and behavior of other nations, as well as to the policy objectives of the decision-maker.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"8 9 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":"128165132","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 the data base, or have a random number generator select one randomly. Hut, if more than one item is in stock, it is most proDable that the user would like to see some of the other items as well. In fact, he probably wants to see all the items if the list is not "to0 long." It is not clear at all how the user is expected to ask for more items after the response to (1). Is he expected to make a new request, perhaps phrased as in (2)? Or is he expected tc retype the same request as in (1) again, and to obtain a different item? Under the first item selection, the same (I) request will produce the same results. Hence, there is no way for him to get a different item printed. Under the random item selection, he would probably get a different item each time the same (1) request is executed; however, he has no control over which item is printed. Hithout user ccntrol it is doubtful that any selection strategy is useful.
{"title":"Language considerations for information management systems","authors":"D. Chai","doi":"10.1145/1408800.1408822","DOIUrl":"https://doi.org/10.1145/1408800.1408822","url":null,"abstract":"in the data base, or have a random number generator select one randomly. Hut, if more than one item is in stock, it is most proDable that the user would like to see some of the other items as well. In fact, he probably wants to see all the items if the list is not \"to0 long.\" It is not clear at all how the user is expected to ask for more items after the response to (1). Is he expected to make a new request, perhaps phrased as in (2)? Or is he expected tc retype the same request as in (1) again, and to obtain a different item? Under the first item selection, the same (I) request will produce the same results. Hence, there is no way for him to get a different item printed. Under the random item selection, he would probably get a different item each time the same (1) request is executed; however, he has no control over which item is printed. Hithout user ccntrol it is doubtful that any selection strategy is useful.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"18 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":"132325179","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 describes some “hidden” advantages that magnetic bubble memories have over disk systems because bubbles can be shifted bidirectionally and can be stopped. The resulting impact on the average access time, I/O priority, I/O software, interrupt handling, and the controller complexity of magnetic bubble memories are discussed. Additionally, a short description of the future memory hierarchy when magnetic bubbles are included is given. Finally, the most probable applications for magnetic bubbles have been outlined.
{"title":"Some computer system implications of magnetic bubble memories","authors":"J. E. Juliussen","doi":"10.1145/800182.810411","DOIUrl":"https://doi.org/10.1145/800182.810411","url":null,"abstract":"This paper describes some “hidden” advantages that magnetic bubble memories have over disk systems because bubbles can be shifted bidirectionally and can be stopped. The resulting impact on the average access time, I/O priority, I/O software, interrupt handling, and the controller complexity of magnetic bubble memories are discussed.\u0000 Additionally, a short description of the future memory hierarchy when magnetic bubbles are included is given. Finally, the most probable applications for magnetic bubbles have been outlined.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"17 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":"126770838","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}
Accessing networks of heterogeneous computer systems can often be cumbersome due to differences in command languages and conventions. Approaches toward improving these conditions are identified and a specific solution - a “Network Access Machine” - is described in detail. The “Network Access Machine” is a mini- computer-based system that acts as a network access point for a user at his terminal and assists the user through the automatic execution of access procedures. This minicomputer facility allows the user to specify (or to have specified) his own network commands. The minicomputer expands these commands into command sequences executable on a specified network and host connected to that network. Further, system and network responses are analyzed to assure agreement with those anticipated for specific commands. Conditional and parameterized expansions allow the use of the same commands on different host computers and different networks.
{"title":"Assisting network users with a network access machine","authors":"R. Blanc","doi":"10.1145/800182.810382","DOIUrl":"https://doi.org/10.1145/800182.810382","url":null,"abstract":"Accessing networks of heterogeneous computer systems can often be cumbersome due to differences in command languages and conventions. Approaches toward improving these conditions are identified and a specific solution - a “Network Access Machine” - is described in detail. The “Network Access Machine” is a mini- computer-based system that acts as a network access point for a user at his terminal and assists the user through the automatic execution of access procedures. This minicomputer facility allows the user to specify (or to have specified) his own network commands. The minicomputer expands these commands into command sequences executable on a specified network and host connected to that network. Further, system and network responses are analyzed to assure agreement with those anticipated for specific commands. Conditional and parameterized expansions allow the use of the same commands on different host computers and different networks.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"63 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":"116259823","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 attempt is made to simulate human mental processes of understanding in the problem of driving a car. The processes work on a network memory defined by four types of elements: Entity, Event, Attributé and Modality; and three types of relations: syntagmatic, paradigmatic, and metalingual. Subnetworks associated with the concept of modality are used effectively to make possible the representation of driving knowledge and processes, including pattern matching.
{"title":"Pass the car in front of you: a simulation of cognitive processes for understanding","authors":"T. Furugori","doi":"10.1145/1408800.1408802","DOIUrl":"https://doi.org/10.1145/1408800.1408802","url":null,"abstract":"An attempt is made to simulate human mental processes of understanding in the problem of driving a car. The processes work on a network memory defined by four types of elements: Entity, Event, Attributé and Modality; and three types of relations: syntagmatic, paradigmatic, and metalingual. Subnetworks associated with the concept of modality are used effectively to make possible the representation of driving knowledge and processes, including pattern matching.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"368 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":"116263326","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}
Today the field of data entry involves a wide variety of systems and methods for subsequent computer processing. The systems and methods available to the user currently involve regimented procedures and skills to insure proper data entry. Howeyer, the philosophy of "Field Data Entry" is relatively new and beginning to show an uptrend in its use.
{"title":"Remote data entry","authors":"Howard G. Merowit","doi":"10.1145/1408800.1408896","DOIUrl":"https://doi.org/10.1145/1408800.1408896","url":null,"abstract":"Today the field of data entry involves a wide variety of systems and methods for subsequent computer processing. The systems and methods available to the user currently involve regimented procedures and skills to insure proper data entry. Howeyer, the philosophy of \"Field Data Entry\" is relatively new and beginning to show an uptrend in its use.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"10 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":"122403581","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
扫码关注我们
求助内容：
应助结果提醒方式：