APL360 is an experimental, conversational System/360 implementation of APL, the Iverson language. It provides fast response and efficient execution to a large number of typewriter terminals. With 40 to 50 terminals connected and in normal use, each with a block of storage (called a workspace) allocated, reaction time (defined as the time from completion of an input message until the user's program begins execution) is typically 0.2 to 0.5 second. At the terminal this is manifested by nearly instantaneous response to a trivial request. Under these conditions, the CPU is executing user programs about 75% of the time, while supervisor overhead and I/O waiting time amount to less than 5%. The APL processor is interpretive; however, because of the efficiencies afforded by array operations, program execution is often one-tenth to one-fifth as fast as compiled code. APL360 is currently running on a System/360 Model 50 with 262,144 bytes of core storage, a 2314 Direct Access Storage Facility, and two 2702 Transmission Control Units to which IBM 1050 and 2741 Communication Terminals are connected via telephone lines.
APL360是一个实验性的，会话系统/360实现APL，艾弗森语言。它为大量的打字机终端提供快速响应和高效的执行。在连接40到50个终端并正常使用的情况下，每个终端分配一个存储块(称为工作空间)，反应时间(定义为从完成输入消息到用户程序开始执行的时间)通常为0.2到0.5秒。在终端，这表现为对一个微不足道的请求几乎是即时的响应。在这些条件下，CPU执行用户程序的时间约占75%，而管理器开销和I/O等待时间总计不到5%。APL处理器是解释性的;然而，由于数组操作提供的效率，程序执行的速度通常是编译代码的十分之一到五分之一。APL360目前在System/360 Model 50上运行，具有262,144字节的核心存储，2314直接访问存储设施和两个2702传输控制单元，IBM 1050和2741通信终端通过电话线连接。
{"title":"The implementation of APL360","authors":"L. Breed, R. H. Lathwell","doi":"10.1145/2402536.2402581","DOIUrl":"https://doi.org/10.1145/2402536.2402581","url":null,"abstract":"APL360 is an experimental, conversational System/360 implementation of APL, the Iverson language. It provides fast response and efficient execution to a large number of typewriter terminals. With 40 to 50 terminals connected and in normal use, each with a block of storage (called a workspace) allocated, reaction time (defined as the time from completion of an input message until the user's program begins execution) is typically 0.2 to 0.5 second. At the terminal this is manifested by nearly instantaneous response to a trivial request. Under these conditions, the CPU is executing user programs about 75% of the time, while supervisor overhead and I/O waiting time amount to less than 5%. The APL processor is interpretive; however, because of the efficiencies afforded by array operations, program execution is often one-tenth to one-fifth as fast as compiled code. APL360 is currently running on a System/360 Model 50 with 262,144 bytes of core storage, a 2314 Direct Access Storage Facility, and two 2702 Transmission Control Units to which IBM 1050 and 2741 Communication Terminals are connected via telephone lines.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121137500","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 summary of the experiences and viewpoints in the development of polyalgorithms for NAPSS. The polyalgorithms depend essentially on their objectives which are presented and discussed in the next section. The objectives of the NAPSS polyalgorithms are quite high and the four primary difficulties (met so far) in achieving them are discussed in the third section. These four difficulties are common sense, error control, flexibility versus simplicity, and reliability versus efficiency. Some of the approaches used in NAPSS to overcome these difficulties are given.
{"title":"On the construction of polyalgorithms for automatic numerical analysis","authors":"J. Rice","doi":"10.1145/2402536.2402571","DOIUrl":"https://doi.org/10.1145/2402536.2402571","url":null,"abstract":"This paper presents a summary of the experiences and viewpoints in the development of polyalgorithms for NAPSS. The polyalgorithms depend essentially on their objectives which are presented and discussed in the next section. The objectives of the NAPSS polyalgorithms are quite high and the four primary difficulties (met so far) in achieving them are discussed in the third section. These four difficulties are common sense, error control, flexibility versus simplicity, and reliability versus efficiency. Some of the approaches used in NAPSS to overcome these difficulties are given.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"397 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856214","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 University of Pittsburgh's numerical calculus course acquaints students with various algorithms for interpolation, functional approximation, numerical differentiation and integration, and solving nonlinear equations. Computational and coding efficiency, regions and rates of convergence, and effects of errors are stressed.
{"title":"On experiences with PIL, an interpretive language, in an undergraduate numerical methods course","authors":"J. Muskat, Francis E. Sullivan, Paul R. Borman","doi":"10.1145/2402536.2402574","DOIUrl":"https://doi.org/10.1145/2402536.2402574","url":null,"abstract":"The University of Pittsburgh's numerical calculus course acquaints students with various algorithms for interpolation, functional approximation, numerical differentiation and integration, and solving nonlinear equations. Computational and coding efficiency, regions and rates of convergence, and effects of errors are stressed.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124347641","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}
Pub Date : 1967-08-01DOI: 10.1016/B978-0-12-395608-8.50043-8
Peter B. Hill, Arthur N. Stowe
{"title":"Implementation of a Reckoner facility on the Lincoln Laboratory IBM 360/67","authors":"Peter B. Hill, Arthur N. Stowe","doi":"10.1016/B978-0-12-395608-8.50043-8","DOIUrl":"https://doi.org/10.1016/B978-0-12-395608-8.50043-8","url":null,"abstract":"","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125640181","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 concept of a mathematical laboratory has been developing throughout the lifetime of computers. The capabilities made available in systems supporting these laboratories range from symbolic integration, differentiation, and polynomial and power series manipulation, through mathematical simulation, to direct control experimental systems. About 1961 two trends, one toward what has become known as "on-line" computation, the other toward "time-sharing" had gained enough recognition to develop national support, and subsequently they have come to represent what is now known as modern computation. An on-line system provides interactive facilities by which a user can exert deterministic influence over the computation sequence; a time-sharing system provides a means by which partial computations on several different problems may be interleaved in time and may share facilities according to predetermined sharing algorithms. For reasons of economy it is hard to put a single user in direct personal control (on-line, that is) of a large-scale computer. It is equally (or even more) difficult to get adequate computation power for significant scientific applications out of any small-scale economical computer. Consequently, on-line computing has come to depend upon time-sharing as its justifiable mode of implementation. On the other hand, valuable on-line applications have formed one of the major reasons for pushing forward the development of time-sharing systems. At present, both efforts have reached such a stage of fruition that we find many systems incorporating selective aspects of the early experimental systems of both types.
{"title":"Mathematical laboratories: a new power for the physical sciences","authors":"G. Culler","doi":"10.1145/2402536.2402579","DOIUrl":"https://doi.org/10.1145/2402536.2402579","url":null,"abstract":"The concept of a mathematical laboratory has been developing throughout the lifetime of computers. The capabilities made available in systems supporting these laboratories range from symbolic integration, differentiation, and polynomial and power series manipulation, through mathematical simulation, to direct control experimental systems. About 1961 two trends, one toward what has become known as \"on-line\" computation, the other toward \"time-sharing\" had gained enough recognition to develop national support, and subsequently they have come to represent what is now known as modern computation. An on-line system provides interactive facilities by which a user can exert deterministic influence over the computation sequence; a time-sharing system provides a means by which partial computations on several different problems may be interleaved in time and may share facilities according to predetermined sharing algorithms. For reasons of economy it is hard to put a single user in direct personal control (on-line, that is) of a large-scale computer. It is equally (or even more) difficult to get adequate computation power for significant scientific applications out of any small-scale economical computer. Consequently, on-line computing has come to depend upon time-sharing as its justifiable mode of implementation. On the other hand, valuable on-line applications have formed one of the major reasons for pushing forward the development of time-sharing systems. At present, both efforts have reached such a stage of fruition that we find many systems incorporating selective aspects of the early experimental systems of both types.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133988660","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}
Running-time priority disciplines for sequencing computer operations are those which discriminate among programs on the basis of the amount of service (running-time) they require. Discrimination is explicit in the models analyzed by Kesten and Runnenburg [1] and Miller and Schrage [2] in which the priority rule is shortest-job-first. However, in the models of particular interest in this paper, the discrimination is necessarily implicit since it is assumed that the running-times of arriving programs are not known in advance. We shall now describe in detail the queuing models to be analyzed in the following sections. Our initial description will use conventional queuing terminology; subsequently, the correspondences between this terminology and the terminology of our particular application will be established.
{"title":"An analysis of computer operations under running time priority disciplines","authors":"E. Coffman","doi":"10.1145/2402536.2402565","DOIUrl":"https://doi.org/10.1145/2402536.2402565","url":null,"abstract":"Running-time priority disciplines for sequencing computer operations are those which discriminate among programs on the basis of the amount of service (running-time) they require. Discrimination is explicit in the models analyzed by Kesten and Runnenburg [1] and Miller and Schrage [2] in which the priority rule is shortest-job-first. However, in the models of particular interest in this paper, the discrimination is necessarily implicit since it is assumed that the running-times of arriving programs are not known in advance. We shall now describe in detail the queuing models to be analyzed in the following sections. Our initial description will use conventional queuing terminology; subsequently, the correspondences between this terminology and the terminology of our particular application will be established.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124860064","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 discussion, I shall try to identify those general criteria for interactive on-line systems which seem most important for the experimental solution of mathematical problems. To illustrate some of these, I shall refer to Professor Glen Culler's on-line system [1, 3], which has been in operation at the University of California at Santa Barbara since 1966. While it is far from an ideal system, I believe that it still ranks first in terms of the number of real problems (of at least moderate difficulty) which have actually been solved, by a variety of users, with the aid of this system or one of its earlier versions. Its strengths and weaknesses have, therefore, some general relevance to a discussion of on-line systems for experimental applied mathematics.
{"title":"On the user's point of view","authors":"B. Fried","doi":"10.1145/2402536.2402539","DOIUrl":"https://doi.org/10.1145/2402536.2402539","url":null,"abstract":"In this discussion, I shall try to identify those general criteria for interactive on-line systems which seem most important for the experimental solution of mathematical problems. To illustrate some of these, I shall refer to Professor Glen Culler's on-line system [1, 3], which has been in operation at the University of California at Santa Barbara since 1966. While it is far from an ideal system, I believe that it still ranks first in terms of the number of real problems (of at least moderate difficulty) which have actually been solved, by a variety of users, with the aid of this system or one of its earlier versions. Its strengths and weaknesses have, therefore, some general relevance to a discussion of on-line systems for experimental applied mathematics.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121809922","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}
When writing programs for interactive computer systems, programmers often find that it is difficult to develop the interactive dialog these programs require. The difficulty arises for two reasons. First, because interactive terminals are relatively new, programmers are not accustomed to planning and developing computer dialogs. Second, there is often no easy way to program the dialog once it has been developed. The solution to the first problem is heavily dependent on the programmer, his training and his background, and does not lend itself to a computerized solution. The solution to the second problem, however, can be eased by providing a higher-level, dialog construction language. The basic features for such a language appear in several systems used for computer-aided instruction [1--4]. The Message System builds on these features to provide a dialog construction language for general use.
{"title":"A message system for interactive dialog","authors":"G. Patton","doi":"10.1145/2402536.2402566","DOIUrl":"https://doi.org/10.1145/2402536.2402566","url":null,"abstract":"When writing programs for interactive computer systems, programmers often find that it is difficult to develop the interactive dialog these programs require. The difficulty arises for two reasons. First, because interactive terminals are relatively new, programmers are not accustomed to planning and developing computer dialogs. Second, there is often no easy way to program the dialog once it has been developed. The solution to the first problem is heavily dependent on the programmer, his training and his background, and does not lend itself to a computerized solution. The solution to the second problem, however, can be eased by providing a higher-level, dialog construction language. The basic features for such a language appear in several systems used for computer-aided instruction [1--4]. The Message System builds on these features to provide a dialog construction language for general use.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"48 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588962","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 of the day-to-day problems which confront applied mathematicians involve extensive algebraic or nonnumerical calculation. Such problems may range from the evaluation of analytical solutions to complicated differential or integral equations on the one hand, to the calculation of coefficients in a power series expansion or the computation of the derivative of a complicated function on the other. The difference between these two classes of problems is obvious; in the former case, no straightforward algorithm exists which will guarantee a solution, and indeed, an analytic form for the solution may not even exist. On the other hand, algorithms do exist for the solution of problems such as series expansion and differentiation, and therefore a correct answer may always be found provided that the researcher possesses sufficient time, perseverance, and accuracy to carry the more complicated problems through free of error. Many examples of this type of problem may be found in physics and engineering. Calculations of general relativistic effects in planetary motion, structural design calculations, and many of the calculations associated with elementary particle physics experiments at high energy accelerators, to name a few, may demand many man-months or even years of work before a useful and error free answer can be found, even though the operations involved are quite straightforward.
{"title":"REDUCE: a user-oriented interactive system for algebraic simplification","authors":"A. C. Hearn","doi":"10.1145/2402536.2402544","DOIUrl":"https://doi.org/10.1145/2402536.2402544","url":null,"abstract":"Many of the day-to-day problems which confront applied mathematicians involve extensive algebraic or nonnumerical calculation. Such problems may range from the evaluation of analytical solutions to complicated differential or integral equations on the one hand, to the calculation of coefficients in a power series expansion or the computation of the derivative of a complicated function on the other. The difference between these two classes of problems is obvious; in the former case, no straightforward algorithm exists which will guarantee a solution, and indeed, an analytic form for the solution may not even exist. On the other hand, algorithms do exist for the solution of problems such as series expansion and differentiation, and therefore a correct answer may always be found provided that the researcher possesses sufficient time, perseverance, and accuracy to carry the more complicated problems through free of error. Many examples of this type of problem may be found in physics and engineering. Calculations of general relativistic effects in planetary motion, structural design calculations, and many of the calculations associated with elementary particle physics experiments at high energy accelerators, to name a few, may demand many man-months or even years of work before a useful and error free answer can be found, even though the operations involved are quite straightforward.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121187535","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 literature describing the languages and systems available for writing teaching programs, two main lines of development have been apparent [1]. At one pole is the system using the linguistic mode. Here, the student interacts "verbally" with the computer, in the sense that messages are sent to the computer by him and are then interpreted "verbally" by the machine. By this we mean that the steps the computer takes assume that the words received need not be decoded further; that is, the words themselves make up the target language.
{"title":"A content-evaluating mode of computer-aided instruction","authors":"G. Manacher","doi":"10.1145/2402536.2402568","DOIUrl":"https://doi.org/10.1145/2402536.2402568","url":null,"abstract":"In the literature describing the languages and systems available for writing teaching programs, two main lines of development have been apparent [1]. At one pole is the system using the linguistic mode. Here, the student interacts \"verbally\" with the computer, in the sense that messages are sent to the computer by him and are then interpreted \"verbally\" by the machine. By this we mean that the steps the computer takes assume that the words received need not be decoded further; that is, the words themselves make up the target language.","PeriodicalId":148361,"journal":{"name":"Symposium on Interactive Systems for Experimental Applied Mathematics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130489001","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
扫码关注我们
求助内容：
应助结果提醒方式：