W. Bulgren, V. Wallace, A. van de Liefvoort, C.R. McClenaghan
{"title":"Investigations into a command and response language interface","authors":"W. Bulgren, V. Wallace, A. van de Liefvoort, C.R. McClenaghan","doi":"10.1109/HICSS.1988.11868","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11868","url":null,"abstract":"Access to the variety of resources offered by computer networks is often complicated by the diversity of interfaces and protocols encountered. To overcome this diversity, a command-and-response language interface to a network of heterogeneous systems is proposed. A brief account of previous work in command languages and system interfaces motivates the study of a prototype of the proposed interface. The design, implementation, and lessons learned through the successful realization of the prototype are presented.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"76 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":"122277061","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":"Continuations in parallelism","authors":"S. Steinberg","doi":"10.1109/HICSS.1988.11801","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11801","url":null,"abstract":"The use of continuations in the BBN Butterfly Lisp multiprocessor is examined. In Butterfly Lisp, continuations are first class objects, much like vectors or numbers, and are used to implement its parallel computing extensions. Continuations can also be used as a way of modeling parallelism in general. While they may be encoded, certain information remains invariant even as the model of parallelism being used changes. Following the continuation behaviour can yield valuable insight into the parallel structure of programming.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"34 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":"121113882","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 graphical entity-relationship database browser","authors":"L. Burns, J. Archibald, A. Malhotra","doi":"10.1109/HICSS.1988.11869","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11869","url":null,"abstract":"A nonprocedural, graphical entity-relationship database interface, ERBrowser, is presented. ERBrowser runs on a workstation and interacts with VM (virtual machine) host databases via a communications link and a database server. The database schema graph is displayed and with clicks of the mouse buttons, a user is allowed to navigate through a database, make modifications to instances in the database, creates simple reports, perform queries, create new databases, and modify existing databases. The Smalltalk/V object-oriented environment is used for the implementation and provides the ability to separate database information from presentation information clearly and easily. This allows different users to visualize the same schema by a different presentation; a user may tailor the schema graph to match his view or a general presentation format may be used. This presentation is saved and can be later recalled during a new ERBrowser session. Smalltalk/V's high-level built-in graphics capability and standard methods for pop-up menus, windowing, and scrolling provide quick experimentation and fast prototyping.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"135 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":"132216063","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":"Measurements of distributed operating systems","authors":"U. Ramachandran","doi":"10.1109/HICSS.1988.11811","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11811","url":null,"abstract":"Message-based operating systems consisting of a small message-passing kernel supporting a collection of system-server processes are considered. For such an architecture to be practical, it is essential that basic messages be fast, since they often replace a kernel call in a traditional system. The design and implementation of such operating systems have been studied. It is shown that the limiting factor, especially for small messages, is typically not network bandwidth but processing overhead. A quantitative breakdown of the time spent in kernel into the different message-passing function is presented. It is found that a large percentage of the round-trip time can be attributed to short-term scheduling and control-block manipulation functions. Further, measurements of services times for typical services on Unix suggests that server computation times are comparable to communication times incurred in the message kernel. These results are useful for system architects, especially for evaluating hardware support for interprocess communication in such environments.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"60 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":"116543178","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":"Automated conceptual schema restructuring","authors":"U. Sundin","doi":"10.1109/HICSS.1988.11783","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11783","url":null,"abstract":"The development of a conceptual model in database design is considered. An approach is described that borrows the AI (artificial intelligence) technique of plan generation to build a computer aid for conceptual schema restructuring in the context of view integration. Also investigated are the use of heuristic search strategies and problem simplification techniques for improving the efficiency of the computer aid. Significant improvement in performance is observed when these heuristic methods are applied.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"11 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":"115265428","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":"Analysis and synthesis of abstract data types through generalization from examples","authors":"C. Wild","doi":"10.1109/HICSS.1988.11784","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11784","url":null,"abstract":"The discovery of general patterns of behavior from a set of input/output examples can be a useful technique in the automated analysis and synthesis of software systems. These generalized descriptions of the behavior form a set of assertions that can be used for validation, program synthesis, program testing, and run-time monitoring. Describing the behavior is characterized as a learning process in which the set of inputs is mapped into an appropriate transform space such that general patterns can be easily characterized. The learning algorithm must choose a transform function and define a subset of the transform space which is related to equivalence classes of behavior in the original domain. An algorithm for analyzing the behavior of abstract data types is presented and several examples are given. The use of the analysis for purposes of program synthesis is also discussed.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"20 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":"115411162","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":"Supporting document development with Concordia","authors":"J. H. Walker","doi":"10.1109/HICSS.1988.11825","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11825","url":null,"abstract":"A description is given of Concordia, the development environment used by technical writers at Symbolics, Inc. Concordia integrates the facilities needed to create, revise, publish, distribute, and maintain very large document sets. The document sources are maintained using a semblance editor that combines some of the user interface convenience of a 'what you see is what you get' (WYSIWYG) editor with the expressive power of a generic markup language. The editor provides the means for independently manipulating the structure, content, and appearance of a document.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"42 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":"126818121","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":"New conditions for N-version programming","authors":"K. Bridgewater, J. Gersting, D. Roberts","doi":"10.1109/HICSS.1988.11858","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11858","url":null,"abstract":"An experiment in which relatively low-quality programs were run in an N-version mode on a microcomputer-based network specifically developed to support N-version programming is described. A 20% reduction in average failure probability over individual versions was noted, but at a substantial overhead in execution time. Heuristics for calculating failure rates and for voting in an N-version mode were developed to deal with the iterative nature of the applications problem.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"94 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":"123268160","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 object-oriented metaprogramming system","authors":"O. Madsen, C. Nogaard","doi":"10.7146/DPB.V16I236.7592","DOIUrl":"https://doi.org/10.7146/DPB.V16I236.7592","url":null,"abstract":"The Mjolner programming environment is discussed. A number of tools in this environment are metaprograms, i.e., programs that manipulate other programs. The metaprogramming system is grammar-based in the sense that a metaprogramming tool may be generated from the grammar of any language. For each syntactic category of the language, a corresponding class is generated. The syntactic hierarchy of the grammar is mapped into a corresponding class hierarchy. This object-oriented representation of programs is further exploited by including a set of more general classes that view a program as an abstract syntax tree and by allowing the user to add semantic attributes in subclasses.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"70 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":"126655023","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 software facility for load sharing and parallel processing in workstation environments","authors":"G. Shoja, G. Clarke, T. Taylor, W. Taylor","doi":"10.1109/HICSS.1988.11809","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11809","url":null,"abstract":"The authors describe the software architecture of a distributed facility called REM (remote execution manager), which has been developed to enable the user of an engineering workstation to benefit from the idle processing power of other workstations in a local network. REM has been implemented at application layer to make it portable without any need to modify the underlying kernel. The system provides the facility for load sharing as well as parallel processing within a local network of workstations. The REMs are grouped into functional units called suites, which are responsible for execution of different jobs submitted by the user. Several suites of REMs may exist in a network. Process replication is used to achieve fault tolerance in case a station crashes or is withdrawn from the pool of processors by its owner.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"13 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":"115469642","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}