Recently much interest has been expressed in the idea that future improvements in computer speed will be due primarily to architectural innovations as opposed to improvement in the characteristics of components (i.e., logic circuits, delays, memories, cycle times, etc.). In view of this it is not surprising that the current generation of “super computers” (i.e., the ILLIAC IV, the STAR 100, and the ASC) all exemplify the use of new architectures to achieve great increases in computing speeds. In this paper yet another new architecture is proposed - the inner product computer4. Like the ILLIAC IV it is a “special purpose” processor which is intended to be used in conjunction with a general purpose (i.e., host) computer.
最近，有一种观点引起了人们的极大兴趣，即未来计算机速度的提高将主要归功于架构的创新，而不是组件特性(即逻辑电路、延迟、存储器、循环时间等)的改进。鉴于此，当前一代的“超级计算机”(即ILLIAC IV, STAR 100和ASC)都是使用新架构来实现计算速度大幅提高的例证，这并不奇怪。本文提出了另一种新的结构——内积计算机。像ILLIAC IV一样，它是一个“特殊用途”处理器，旨在与通用计算机(即主机)一起使用。
{"title":"Applications of the inner product computer","authors":"E. Swartzlander","doi":"10.1145/800192.805688","DOIUrl":"https://doi.org/10.1145/800192.805688","url":null,"abstract":"Recently much interest has been expressed in the idea that future improvements in computer speed will be due primarily to architectural innovations as opposed to improvement in the characteristics of components (i.e., logic circuits, delays, memories, cycle times, etc.). In view of this it is not surprising that the current generation of “super computers” (i.e., the ILLIAC IV, the STAR 100, and the ASC) all exemplify the use of new architectures to achieve great increases in computing speeds.\u0000 In this paper yet another new architecture is proposed - the inner product computer4. Like the ILLIAC IV it is a “special purpose” processor which is intended to be used in conjunction with a general purpose (i.e., host) computer.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"93 1","pages":"97-100"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82394430","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 this paper, the shortcomings of Backus Naur specification of the syntactic properties of programming languages are investigated and a method for the specification of context-sensitive properties is suggested. Based on the notation of the tree structures of the Vienna Definition Language [Lu 1], samples of descriptions of context-sensitive grammars are presented as sets of conditionals which operate over the derivation trees of context-free specifications in BNF grammars to eliminate the extra-lingual features. The method is also extended to provide a syntactic specification of the default attributes of a language by the description of modifications which are to be made to the parsed form (syntactic tree) of instances of the language. For the purposes of example, a mini-language (ML 5/2) is presented. This paper exemplifies the problems of parameter passing and provides examples of the context-sensitive conditions of matching procedure calls and their declarations as well as matching parameters and their corresponding arguments.
{"title":"Conditional syntactic specification","authors":"John A. N. Lee, J. Dorocak","doi":"10.1145/800192.805689","DOIUrl":"https://doi.org/10.1145/800192.805689","url":null,"abstract":"In this paper, the shortcomings of Backus Naur specification of the syntactic properties of programming languages are investigated and a method for the specification of context-sensitive properties is suggested. Based on the notation of the tree structures of the Vienna Definition Language [Lu 1], samples of descriptions of context-sensitive grammars are presented as sets of conditionals which operate over the derivation trees of context-free specifications in BNF grammars to eliminate the extra-lingual features. The method is also extended to provide a syntactic specification of the default attributes of a language by the description of modifications which are to be made to the parsed form (syntactic tree) of instances of the language. For the purposes of example, a mini-language (ML 5/2) is presented. This paper exemplifies the problems of parameter passing and provides examples of the context-sensitive conditions of matching procedure calls and their declarations as well as matching parameters and their corresponding arguments.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"43 1","pages":"101-105"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89520897","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 this paper, a syntax-oriented formal system, called a metaprocess, is proposed for defining (and perhaps implementing) processes. The metaprocess functions as a kind of generalized metacompiler, in that it occupies the same relationship to a process as a metacompiler does to a compiler. The notion of an interpreter is developed to model the operation of each process and a metalanguage provides the vehicle for designating the actions performed by an interpreter. A combined syntactic-semantic specification of a process' input stream is used to drive the associated interpreter. The syntactic portion of this specification is in BNF while its semantic counterpart is in an Algol-like language. From this viewpoint, the inputs to the process serve as a sequence of directives to its interpreter.
{"title":"A syntax-oriented formal system for defining processes","authors":"C. R. Hollander","doi":"10.1145/800192.805720","DOIUrl":"https://doi.org/10.1145/800192.805720","url":null,"abstract":"In this paper, a syntax-oriented formal system, called a metaprocess, is proposed for defining (and perhaps implementing) processes. The metaprocess functions as a kind of generalized metacompiler, in that it occupies the same relationship to a process as a metacompiler does to a compiler. The notion of an interpreter is developed to model the operation of each process and a metalanguage provides the vehicle for designating the actions performed by an interpreter. A combined syntactic-semantic specification of a process' input stream is used to drive the associated interpreter. The syntactic portion of this specification is in BNF while its semantic counterpart is in an Algol-like language. From this viewpoint, the inputs to the process serve as a sequence of directives to its interpreter.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"102 1","pages":"295-298"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84673738","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}
Variational methods of approximation have become very popular in recent years among engineers and numerical analysts. In particular, the finite element method has established itself as one of the most powerful techniques available for the approximate solution of boundary-value problems. In the present paper, we outline a number of mathematical properties of the method which are partially responsible for its success; we discuss certain error estimates and convergence results, and we describe some results obtained in applications of the method to a class of nonlinear problems in elastodynamics.
{"title":"Some distributional and convergence properties of the finite element method, with applications in nonlinear elastodynamics","authors":"J. Oden","doi":"10.1145/800192.805746","DOIUrl":"https://doi.org/10.1145/800192.805746","url":null,"abstract":"Variational methods of approximation have become very popular in recent years among engineers and numerical analysts. In particular, the finite element method has established itself as one of the most powerful techniques available for the approximate solution of boundary-value problems. In the present paper, we outline a number of mathematical properties of the method which are partially responsible for its success; we discuss certain error estimates and convergence results, and we describe some results obtained in applications of the method to a class of nonlinear problems in elastodynamics.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"26 1","pages":"405-408"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81078262","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 satisfy three types of terminal users, student programmers, production users and CAI authors, Western Washington State College has developed a MULTILINGUAL INTERPRETER. The MULTILINGUAL INTERPRETER allows PL/I, BASIC and COURSEWRITER III to be run on a single terminal system. The configuration of the language processor is such that programs can be prepared in more than one source language. The main purpose of this development is to provide advanced programming features not only to the non-CAI programmer, but to the CAI programmer as well. This paper describes the steps taken in the development of this system and the system's language mixing capabilities.
{"title":"A MULTILINGUAL INTERPRETER for interactive computing in an academic environment","authors":"Larry Kheriaty","doi":"10.1145/800192.805719","DOIUrl":"https://doi.org/10.1145/800192.805719","url":null,"abstract":"In order to satisfy three types of terminal users, student programmers, production users and CAI authors, Western Washington State College has developed a MULTILINGUAL INTERPRETER. The MULTILINGUAL INTERPRETER allows PL/I, BASIC and COURSEWRITER III to be run on a single terminal system. The configuration of the language processor is such that programs can be prepared in more than one source language. The main purpose of this development is to provide advanced programming features not only to the non-CAI programmer, but to the CAI programmer as well. This paper describes the steps taken in the development of this system and the system's language mixing capabilities.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"108 1","pages":"290-294"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79333242","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 is concerned with two different ways of expanding the definition of a tessellation automaton, and some of the resultant properties which thereby ensue. The first allows the notion of sequential processing, while the second allows the addition of spatial non-uniformity.
{"title":"Pattern generation in non-standard tessellation automata","authors":"W. Grosky, F. Tsui","doi":"10.1145/800192.805730","DOIUrl":"https://doi.org/10.1145/800192.805730","url":null,"abstract":"This paper is concerned with two different ways of expanding the definition of a tessellation automaton, and some of the resultant properties which thereby ensue. The first allows the notion of sequential processing, while the second allows the addition of spatial non-uniformity.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"518 1 1","pages":"345-348"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78404140","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 number of approaches have been developed to modularize parts of multiuser computer systems so that access to each part can be controlled. The devices of rings and capabilities are two examples. However, today's systems are notably incomplete and subject to defeat by determined and clever users. A point of view is presented here which allows proving that a logical design of an access control system is correct relative to a designer-specified set of criteria. Implementation questions are also discussed.
{"title":"Correctness in access control","authors":"G. Popek","doi":"10.1145/800192.805711","DOIUrl":"https://doi.org/10.1145/800192.805711","url":null,"abstract":"A number of approaches have been developed to modularize parts of multiuser computer systems so that access to each part can be controlled. The devices of rings and capabilities are two examples. However, today's systems are notably incomplete and subject to defeat by determined and clever users. A point of view is presented here which allows proving that a logical design of an access control system is correct relative to a designer-specified set of criteria. Implementation questions are also discussed.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"12 1","pages":"236-241"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85463846","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}
Paul F. Huebner, Daniel T. Skelton, Earl J. Schweppe
An interactive simulation of the execution of mnemonically entered instructions for the Datapoint 2200 Computer has been developed which runs on this same machine. A representation of the registers, flip-flops, program counter, subroutine stack, and referenced memory cell is show on the display of the machine. Individual mnemonic instructions may be entered from the keyboard and are shown on the display in standard assembly source language except that instructions may not be labelled. Both the instructions and their operands are syntactically checked character-by-character as they are entered and all illegal entries are refused. The simulator displays the corresponding octal form of these instructions and modifies the representation of the state of the machine accordingly. Short programs of such instructions may be entered and normal sequential execution simulated, Experience indicates that such simulators can provide an easy means of learning the computer organization, mnemonic instructions, and program execution of a computer. They can be especially helpful in demonstrating the dynamics of recursive subroutine calls and push-down stacks.
{"title":"Interactive instruction simulation on and of the Datapoint 2200 computer","authors":"Paul F. Huebner, Daniel T. Skelton, Earl J. Schweppe","doi":"10.1145/800192.805722","DOIUrl":"https://doi.org/10.1145/800192.805722","url":null,"abstract":"An interactive simulation of the execution of mnemonically entered instructions for the Datapoint 2200 Computer has been developed which runs on this same machine. A representation of the registers, flip-flops, program counter, subroutine stack, and referenced memory cell is show on the display of the machine. Individual mnemonic instructions may be entered from the keyboard and are shown on the display in standard assembly source language except that instructions may not be labelled. Both the instructions and their operands are syntactically checked character-by-character as they are entered and all illegal entries are refused. The simulator displays the corresponding octal form of these instructions and modifies the representation of the state of the machine accordingly. Short programs of such instructions may be entered and normal sequential execution simulated, Experience indicates that such simulators can provide an easy means of learning the computer organization, mnemonic instructions, and program execution of a computer. They can be especially helpful in demonstrating the dynamics of recursive subroutine calls and push-down stacks.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"1 1","pages":"304-308"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83199774","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}
Presented is a unified, systematic view of integrity/recovery as it relates to a data-processing system—whether man, machine, or both. The concept, sphere of control (SOC), as a bound around a process, is developed to permit describing and solving many of the rather aggravating problems of auditability, repeatability, reproducibility, scheduling, consistency, recovery and general integrity. Identified are the relationships among resources and SOCs, the types of resource status which must be maintained, and the effects that dependency versus commitment has on process scheduling and recovery strategy. Virtually ignored are the problems of lost storage for which redundancy is a solution, mainly because information already exists in this realm.
{"title":"Recovery semantics for a DB/DC system","authors":"Charles T. Davies","doi":"10.1145/800192.805694","DOIUrl":"https://doi.org/10.1145/800192.805694","url":null,"abstract":"Presented is a unified, systematic view of integrity/recovery as it relates to a data-processing system—whether man, machine, or both.\u0000 The concept, sphere of control (SOC), as a bound around a process, is developed to permit describing and solving many of the rather aggravating problems of auditability, repeatability, reproducibility, scheduling, consistency, recovery and general integrity.\u0000 Identified are the relationships among resources and SOCs, the types of resource status which must be maintained, and the effects that dependency versus commitment has on process scheduling and recovery strategy.\u0000 Virtually ignored are the problems of lost storage for which redundancy is a solution, mainly because information already exists in this realm.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"31 1","pages":"136-141"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87895106","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}
TRAIL is a block-structured language and programming system for the development of programming support systems and translators for problem-oriented languages on minicomputers. The programming system includes an interpreter for an intermediate language (IL) into which various source languages (including TRAIL itself) may be translated. The interpreter size is about 1400 bytes. The choice of an interpreted target language was guided by the objectives of minimum object code size and machine independence of the developed software. Both of these have been achieved, at the expense of a 20:1 slowdown of execution speed relative to directly assembled code. The interpreted object code is at least 50% smaller than assembly code. The source language was designed to match the requirements of language translator software; software design directly models syntax checking, context-free translation, and context-sensitive translation aspects, in ascending order of complexity. Anticipated benefits include greater productivity in design and debug phases, and enhanced communication between programmers via simplified documentation procedures.
{"title":"A minisystem programming language","authors":"Robert J. Lechner, W. Stallings","doi":"10.1145/800192.805700","DOIUrl":"https://doi.org/10.1145/800192.805700","url":null,"abstract":"TRAIL is a block-structured language and programming system for the development of programming support systems and translators for problem-oriented languages on minicomputers. The programming system includes an interpreter for an intermediate language (IL) into which various source languages (including TRAIL itself) may be translated. The interpreter size is about 1400 bytes.\u0000 The choice of an interpreted target language was guided by the objectives of minimum object code size and machine independence of the developed software. Both of these have been achieved, at the expense of a 20:1 slowdown of execution speed relative to directly assembled code. The interpreted object code is at least 50% smaller than assembly code.\u0000 The source language was designed to match the requirements of language translator software; software design directly models syntax checking, context-free translation, and context-sensitive translation aspects, in ascending order of complexity. Anticipated benefits include greater productivity in design and debug phases, and enhanced communication between programmers via simplified documentation procedures.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"1 1","pages":"174-182"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75500762","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
扫码关注我们
求助内容：
应助结果提醒方式：