{"title":"EEGADS! Department of Energy (DOE) provides free laboratory equipment to universities","authors":"L. Barker, J. Masters, Ellen D. Pfeiffer","doi":"10.1145/317559.322769","DOIUrl":"https://doi.org/10.1145/317559.322769","url":null,"abstract":"The PMD system became the vehicle for capturing data on approximately 5,000 used equipment items per year (previously, an average of only 200 items per year were tracked by this process). The information base was then available, but the information dissemination problem persisted. In 1984, the U&I Program Division initiated a study to explore the potential for employing automated office system support technologies to solve the final problem. Department officials pondered whether or not to allow telecommunications access by the academic community to the PMD mainframe data base. They concluded that the risks for possible violation of other sensitive mainframe systems was too great, and the idea was abandoned. In 1984, the decision to develop EEGADS on an IBM PC broke the final barrier. Using data extracted from the mainframe system, EEGADS could run on a PC with a modem. This decision satisfied the desire to provide specific access to used equipment grant data by the academic communicy without allowing general access to DOE mainframe computers. With assistance from DOE's Office of Computer Services and Telecommunications Management, an implementation plan was produced recommending the development of the EEGADS direct dial data base application. The resulting system, developed and maintained by CALCULON Corporation contractor personnel, went on-line in August of 1985. The dBASE III application may be accessed from its MultiLink bulletin board by interested parties via commercial telephone lines 24 hours a day, seven days a week. The first-time user is prompted to provide information about terminal type or emulation mode, user name, institution and department, telephone number, city, state, and zip code. This information is used to update an internally maintained user log accessible by CALCULON support staff to contact individuals who experience problems with hardware or software. Once the user identification data is provided, a four-digit access code is assigned for use in future log-ons. Due to the fact that the current system can accommodate only one user at a time, the system allows a maximum of 30 minutes for each user to utilize the data base.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126713401","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}
{"title":"A comparison of relational database management systems UNIFY and iDB","authors":"Lindsay McDermid","doi":"10.1145/317559.322768","DOIUrl":"https://doi.org/10.1145/317559.322768","url":null,"abstract":"One of the most important qualities of a database management system running on a small system is its ability to provide data independence. A relational database management system provides data independence through its use of tables for data storage. Use of a standard operating system means that a database management system can be run on a wide variety of systems, allowing data to be transported not only between small systems but between small and large systems. Assuming that a database management system provides data independence, what other features are needed? A comparison of the features provided by two such database management systems and how easy they are to use would be helpful in answering this question. This paper presents a comparison of UNIFY and Intel Database Management System (iDB). Both are relational, multi-user systems that run under the UNIX operating system.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129689235","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}
{"title":"Parallel computing on personal computers","authors":"O. Vornberger","doi":"10.1145/317559.322756","DOIUrl":"https://doi.org/10.1145/317559.322756","url":null,"abstract":"A set of Personal Computers is connected to form a ring-structured parallel system. Each computer has access to its local memory and can communicate with its two neighbours in the ring. This network of asynchronous processors is used to solve in parallel combinatorial optimization problems that are too time- and space-consuming to be handled on a single personal computer. Heuristics are developed to simulate in distributed memory the typical data structures needed in branch-and-bound-algorithms: A single priority queue is maintained and updated in several heaps with very little synchronization overhead. To show the performance of the ring a parallel version of the Travelling-Salesman-Problem is implemented. Execution times and speedups for 50 random graphs solved with up to 16 ring members are discussed.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125892151","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}
{"title":"Recent developments in PC software (keynote address)","authors":"Moshé M. Zloof","doi":"10.1145/317559.322742","DOIUrl":"https://doi.org/10.1145/317559.322742","url":null,"abstract":"The advent and evolution in PC hardware and software is causing a dramatic impact on the computer industry and is enabling more people to use computers for the first time at a faster rate. In this short paper we will describe the forces (which incidentally are not always technological) that determine the direction of this evolution, primarily in the area of 'application software'.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123457863","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}
{"title":"Performance characteristics of microcomputer Prolog implementations","authors":"H. Berghel, G. Stubbendieck, Eric Traudt","doi":"10.1145/317559.322749","DOIUrl":"https://doi.org/10.1145/317559.322749","url":null,"abstract":"In this paper we present the results of several different categories of benchmarks performed on microcomputer PROLOG interpreters and compilers. These tests were found useful in our lab in determining optimal environments for research in several different categories of non-numerical applications. The PROLOG clause sets, as well as the benchmark results, are provided.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129012723","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}
{"title":"A stream-oriented approach to distributed query processing in a local area network","authors":"Y. Kiyoki, Kazuhiko Kato, T. Masuda","doi":"10.1145/317559.322760","DOIUrl":"https://doi.org/10.1145/317559.322760","url":null,"abstract":"This paper presents a stream-oriented approach to distributed query processing in a local area network. This approach enables relational operations (relational database operations) to be executed concurrently in local area network environments. This paper proposes an implementation scheme of the stream-oriented approach. This scheme is designed to implement a relational database system in an environment where multiple small computers, such as workstations, are connected to a local area network. The scheme exploits parallelism by flexibly utilizing existing system resources. A relational database operation system has been developed on the basis of this implementation scheme to examine the feasibility and effectiveness of the stream-oriented approach. This paper also presents some experimental results on the performance of the relational database operation system. The experimental results show that the stream-oriented approach is advantageous in local area network environments.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124472092","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}
{"title":"Reliable commit and optimistic concurrency control for dynamically reconfigurable distributed databases","authors":"Sue M. Zajac, F. Maryanski","doi":"10.1145/317559.322759","DOIUrl":"https://doi.org/10.1145/317559.322759","url":null,"abstract":"This paper addresses the problem of maintaining high availability in a dynamically reconfigurable distributed database system. A dynamically reconfigurable distributed database system is one in which clients and/or servers may attach to or detach from the system at will. Reliable transaction management and commit protocols which handle both these absences and unexpected failures are presented.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505883","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}
{"title":"A C language extension for machine-independent programming","authors":"Shingo Kamiya, Toshiyuki Yoshida, Takanobu Sugiyasu, Kokichi Miyazawa","doi":"10.1145/317559.322752","DOIUrl":"https://doi.org/10.1145/317559.322752","url":null,"abstract":"MIC (Machine-Independent C) is an extension of the C language which has been designed to write portable programs as installed in various small computers. MIC provides unified semantics suitable for typical small computers with new facilities for machine-independent data definition, and its syntax conforms to the preliminary draft of the proposed ANSI standard for C. It is fully implemented as a compiler front end called MICP, and has been applied to actual programming. The principal features of MIC and its effect on facilitating machine-independent C programming are described. Results of practical application of MIC are also presented.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129215639","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}
{"title":"An efficient, portable authoring language for microcomputers","authors":"Mark Luker","doi":"10.1145/317559.322770","DOIUrl":"https://doi.org/10.1145/317559.322770","url":null,"abstract":"An authoring language is a programming language that is optimized in some way for the efficient production of computer assisted instruction lessons. This paper summarizes nearly twenty years of experimentation and development of authoring languages at the University of Minnesota, then presents the main characteristics of a new language that embodies many of the lessons learned over this period. The new language is called AL, for author language. Based on Pascal, it is easily transportable across most microcomputers, requires no special operating system or tools, and makes no assumptions regarding educational style or method. It was designed to maximize efficiency over the entire process of authoring, testing, distribution, and maintenance of lessons. This is in stark contrast to most CAI languages, which were designed primarily to simplify the author interface. The paper is divided into five sections. The first recounts experimentation in the 1960's at Minnesota with one of the first authoring languages, and catalogs its most important deficiencies. The second section describes a major effort to support CAI using a FORTRAN language preprocessor on a large interactive timesharing system. The third section describes how this approach was successfully adapted to microcomputers using Pascal. The fourth section describes the new AL language, which incorporates the lessons of the extensive trials with the previous efforts. The final section briefly compares AL with four other authoring languages for the IBM PC.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125911326","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}
{"title":"Remote operations across a network of small computers","authors":"B. Nordin, I. Macleod, Patrick Martin","doi":"10.1145/317559.322755","DOIUrl":"https://doi.org/10.1145/317559.322755","url":null,"abstract":"This paper discusses the design of a Remote Operation Call (ROC) mechanism. ROCs are a generalisation of the remote procedure call concept. They provide for a wider variety of remote calls, such as asynchronous, directed and multicast calls. An implementation of ROCs on a network of personal computers is also described.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133129092","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}