The system was designed to alleviate the problem of "one time" or special request reports. A method was needed to quickly produce reports on request without having to write, compile and debug programs in order to produce the reports. The original design objectives were to permit any individual who understood how to prepare the input parameters the capability of producing any report within thirty minutes preparation time. MORE eliminates the necessity of having to write and maintain great numbers of special purpose report programs. It eliminates the necessity for special passes of master, sort parameter and activity files in order to produce the desired report. This is possible since the MORE system is a series of external subroutines which may be called by any existing program which is already accessing or passing a specific file. This system affords the user the advantage of using the built-in general print program or providing his own format program to the system. It has been determined that this system satisfied 85 to 90 percent of Martin Orlando business report requirements.
{"title":"Martin Orlando reporting environment","authors":"Michael J. McLaurin, Walter A. Traister","doi":"10.1145/1468075.1468105","DOIUrl":"https://doi.org/10.1145/1468075.1468105","url":null,"abstract":"The system was designed to alleviate the problem of \"one time\" or special request reports. A method was needed to quickly produce reports on request without having to write, compile and debug programs in order to produce the reports. The original design objectives were to permit any individual who understood how to prepare the input parameters the capability of producing any report within thirty minutes preparation time. MORE eliminates the necessity of having to write and maintain great numbers of special purpose report programs. It eliminates the necessity for special passes of master, sort parameter and activity files in order to produce the desired report. This is possible since the MORE system is a series of external subroutines which may be called by any existing program which is already accessing or passing a specific file. This system affords the user the advantage of using the built-in general print program or providing his own format program to the system. It has been determined that this system satisfied 85 to 90 percent of Martin Orlando business report requirements.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114261886","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}
Since July 1965 we have been using time-shared computing services as a computing aid for technical programs at the Boulder laboratories of the National Bureau of Standards and the Environmental Science Services Administration (ESSA). We proceeded slowly through the steps of first studying time-shared computing, visiting various installations, installing a terminal and using an outside service, experimenting with a variety of services, acquiring several more terminals and providing regular service, and finally acquiring our own time-shared computer. At first service was obtained from the General Electric Company in Phoenix, then in addition from System Development Corporation in Santa Monica, from IBM in Los Angeles, from Tymshare in Palo Alto, and from Com-Share in Ann Arbor. Service is now being provided by an SDS-940 time-sharing system operated by ESSA in Boulder.
{"title":"Some ways of providing communication facilities for time-shared computing","authors":"H. L. Steadman, G. R. Sugar","doi":"10.1145/1468075.1468079","DOIUrl":"https://doi.org/10.1145/1468075.1468079","url":null,"abstract":"Since July 1965 we have been using time-shared computing services as a computing aid for technical programs at the Boulder laboratories of the National Bureau of Standards and the Environmental Science Services Administration (ESSA). We proceeded slowly through the steps of first studying time-shared computing, visiting various installations, installing a terminal and using an outside service, experimenting with a variety of services, acquiring several more terminals and providing regular service, and finally acquiring our own time-shared computer. At first service was obtained from the General Electric Company in Phoenix, then in addition from System Development Corporation in Santa Monica, from IBM in Los Angeles, from Tymshare in Palo Alto, and from Com-Share in Ann Arbor. Service is now being provided by an SDS-940 time-sharing system operated by ESSA in Boulder.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114512044","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 real-time industrial data processing system collects information, processes it, and responds to the user in sufficient time to influence or control the production processes, material distribution and accounting records.
{"title":"The ISCOR real-time industrial data processing system","authors":"W. Lambert, W. Ruffels","doi":"10.1145/1468075.1468104","DOIUrl":"https://doi.org/10.1145/1468075.1468104","url":null,"abstract":"A real-time industrial data processing system collects information, processes it, and responds to the user in sufficient time to influence or control the production processes, material distribution and accounting records.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124451032","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}
There is a need for faster and more efficient production of high quality graphic images. Since the information in graphic images can be coded into data bits, we should be able to adapt the techniques of high speed electronic data processing to graphic image processing. Accordingly, we have constructed an experimental graphic data processor. Its design is based on the same logical design principles as an electronic data processor, but we have modified the system to accommodate the special features needed for processing graphical data. We will describe here our approach to the design, present some details of the system, and show some of the processed images. We will begin with a short discussion of how graphic data is reproduced today, outline some of the advantages of automating the process, and then talk about our own experience.
{"title":"Graphical data processing","authors":"E. Smura","doi":"10.1145/1468075.1468094","DOIUrl":"https://doi.org/10.1145/1468075.1468094","url":null,"abstract":"There is a need for faster and more efficient production of high quality graphic images. Since the information in graphic images can be coded into data bits, we should be able to adapt the techniques of high speed electronic data processing to graphic image processing. Accordingly, we have constructed an experimental graphic data processor. Its design is based on the same logical design principles as an electronic data processor, but we have modified the system to accommodate the special features needed for processing graphical data. We will describe here our approach to the design, present some details of the system, and show some of the processed images. We will begin with a short discussion of how graphic data is reproduced today, outline some of the advantages of automating the process, and then talk about our own experience.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131443874","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 computer memory business has been plagued at various times during the past 8 years with a cliche that the art of core memories would be exhausted within 5 years. This paper describes the attainment of new standards of size and cost and new design features intended to further postpone this elusive demise.
{"title":"A compact, economical core memory with all-monolithic electronics","authors":"R. Reichard, W. Jordan","doi":"10.1145/1468075.1468113","DOIUrl":"https://doi.org/10.1145/1468075.1468113","url":null,"abstract":"The computer memory business has been plagued at various times during the past 8 years with a cliche that the art of core memories would be exhausted within 5 years. This paper describes the attainment of new standards of size and cost and new design features intended to further postpone this elusive demise.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129647588","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}
Burroughs' B6500/B7500 system structure and philosophy are an extension of the concepts employed in the development of the B5500 system. The unique features, common to both hardware systems, are that they have been designed to operate under the control of an executive program (MCP) and are to be programmed in only higher level languages (e.g., ALGOL, COBOL, and FORTRAN). Through a close integration of the software and hardware disciplines, a machine organization has been developed which permits the compilation of efficient machine code and which is addressed to the solution of problems associated with multiprogramming, multiprocessing and time sharing.
{"title":"Burroughs' B6500/B7500 stack mechanism","authors":"Erwin A. Hauck, Benjamin A. Dent","doi":"10.1145/1468075.1468111","DOIUrl":"https://doi.org/10.1145/1468075.1468111","url":null,"abstract":"Burroughs' B6500/B7500 system structure and philosophy are an extension of the concepts employed in the development of the B5500 system. The unique features, common to both hardware systems, are that they have been designed to operate under the control of an executive program (MCP) and are to be programmed in only higher level languages (e.g., ALGOL, COBOL, and FORTRAN). Through a close integration of the software and hardware disciplines, a machine organization has been developed which permits the compilation of efficient machine code and which is addressed to the solution of problems associated with multiprogramming, multiprocessing and time sharing.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127091464","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}
Operating System/360 was designed to meet a severe core-memory constraint: a 14K-bytes resident supervisor plus a repertoire of compilers, utility programs, sort programs, and application packages fitting into 18K bytes (approximately 4500 data words and executable instructions). Many supervisory functions included in the nucleus of pre-360 systems were repackaged into 1000-byte overlays for OS/360 (e.g. logic to OPEN and CLOSE files---hereafter called data sets, following OS/360 nomenclature). Specification of device type, buffering technique, and data set identification---which was assembled, compiled, or link-edited into many pre-360 application programs --- is deferrable in OS/360 until the data set is actually opened for processing, essentially "latest-possible binding of data-set attributes and processing mode" (cf. Part 3 of Reference 5 for a complete discussion).
{"title":"A storage-hierarchy system for batch processing","authors":"D. N. Freeman","doi":"10.1145/1468075.1468110","DOIUrl":"https://doi.org/10.1145/1468075.1468110","url":null,"abstract":"Operating System/360 was designed to meet a severe core-memory constraint: a 14K-bytes resident supervisor plus a repertoire of compilers, utility programs, sort programs, and application packages fitting into 18K bytes (approximately 4500 data words and executable instructions). Many supervisory functions included in the nucleus of pre-360 systems were repackaged into 1000-byte overlays for OS/360 (e.g. logic to OPEN and CLOSE files---hereafter called data sets, following OS/360 nomenclature). Specification of device type, buffering technique, and data set identification---which was assembled, compiled, or link-edited into many pre-360 application programs --- is deferrable in OS/360 until the data set is actually opened for processing, essentially \"latest-possible binding of data-set attributes and processing mode\" (cf. Part 3 of Reference 5 for a complete discussion).","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134440203","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}
Robert J. Smith, J. H. Tracey, W. L. Schoeffel, G. Maki
Sequential switching circuits are commonly classified as being either synchronous or asynchronous. Clock pulses synchronize the operations of the synchronous circuit. The operation of an asynchronous circuit is usually assumed to be independent of such clocks. The operating speed of an asynchronous circuit is thus limited only by basic device speed. One disadvantage of asynchronous circuit design has been the complexity of the synthesis procedures for large circuits.
{"title":"Automation in the design of asynchronous sequential circuits","authors":"Robert J. Smith, J. H. Tracey, W. L. Schoeffel, G. Maki","doi":"10.1145/1468075.1468084","DOIUrl":"https://doi.org/10.1145/1468075.1468084","url":null,"abstract":"Sequential switching circuits are commonly classified as being either synchronous or asynchronous. Clock pulses synchronize the operations of the synchronous circuit. The operation of an asynchronous circuit is usually assumed to be independent of such clocks. The operating speed of an asynchronous circuit is thus limited only by basic device speed. One disadvantage of asynchronous circuit design has been the complexity of the synthesis procedures for large circuits.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114527056","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 Maitra cascade, as shown in Fig. 8, is a one dimensional cellular array whose cells have only one output and two inputs. At the output of the last cell the function is performed whose independent variables are introduced at the free inputs of the cascade cells. There are two different kinds of Maitra cascades according to whether a different binary variable is introduced or not at each independent input. In the first case the cascade is an irredundant one, in the second it is said to be redundant. The most important results about the synthesis of Maitra cascade are given in Refs. 1--5. In Ref. 6 it is proved that a sufficient condition for a cellular cascade to reach its optimal synthesis possibility is that every cell can perform the set of five functions shown in Fig. 1a, 1b, 1c.
{"title":"Application of Karnaugh maps to Maitra cascades","authors":"G. Fantauzzi","doi":"10.1145/1468075.1468119","DOIUrl":"https://doi.org/10.1145/1468075.1468119","url":null,"abstract":"A Maitra cascade, as shown in Fig. 8, is a one dimensional cellular array whose cells have only one output and two inputs. At the output of the last cell the function is performed whose independent variables are introduced at the free inputs of the cascade cells. There are two different kinds of Maitra cascades according to whether a different binary variable is introduced or not at each independent input. In the first case the cascade is an irredundant one, in the second it is said to be redundant. The most important results about the synthesis of Maitra cascade are given in Refs. 1--5. In Ref. 6 it is proved that a sufficient condition for a cellular cascade to reach its optimal synthesis possibility is that every cell can perform the set of five functions shown in Fig. 1a, 1b, 1c.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116065840","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}
Time-sharing of computer facilities has been widely acclaimed as the most significant evolutionary step that has been taken in recent years toward the development of generalized information utilities. The basic techniques of interactive man-computer time-sharing were developed in the 1950's in connection with realtime command and control computing systems, initially in SAGE air defense. Time-sharing was practiced in these pioneering systems in the sense that many military operators at separate consoles --- consoles equipped with push-buttons, CRT displays and light guns---were able to request and receive information from the central computing system at essentially the same time. These historical roots reveal that time-sharing is an outgrowth of realtime system development.
{"title":"Time-sharing versus batch processing: the experimental evidence","authors":"H. Sackman","doi":"10.1145/1468075.1468077","DOIUrl":"https://doi.org/10.1145/1468075.1468077","url":null,"abstract":"Time-sharing of computer facilities has been widely acclaimed as the most significant evolutionary step that has been taken in recent years toward the development of generalized information utilities. The basic techniques of interactive man-computer time-sharing were developed in the 1950's in connection with realtime command and control computing systems, initially in SAGE air defense. Time-sharing was practiced in these pioneering systems in the sense that many military operators at separate consoles --- consoles equipped with push-buttons, CRT displays and light guns---were able to request and receive information from the central computing system at essentially the same time. These historical roots reveal that time-sharing is an outgrowth of realtime system development.","PeriodicalId":180876,"journal":{"name":"Proceedings of the April 30--May 2, 1968, spring joint computer conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116579144","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
扫码关注我们
求助内容：
应助结果提醒方式：