{"title":"Name transparency in very large scale distributed file systems","authors":"Richard G. Guy, T. Page, John Heidemann, G. Popek","doi":"10.1109/EDS.1990.138045","DOIUrl":"https://doi.org/10.1109/EDS.1990.138045","url":null,"abstract":"Previous distributed file systems have relied either on convention or on obtaining dynamic global agreement to provide network transparent file naming. The authors argue that neither approach can succeed as systems scale to the kind of size that is anticipated in the current decade. They propose instead a novel name-mapping scheme which relies on a fragmented, selectively replicated name translation database. Updates to the naming database are coordinated by an optimistic concurrency control strategy with automatic propagation and reconciliation. A prototype of the name-mapping mechanism has been implemented and is in use in the Ficus replicated file system.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123537900","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 distributed shared memory","authors":"B. Fleisch","doi":"10.1109/EDS.1990.138058","DOIUrl":"https://doi.org/10.1109/EDS.1990.138058","url":null,"abstract":"Some aspects of research into distributed shared memory (DSM) systems which concern reliability are presented. The research is concerned with applications that use shared memory in single-site systems, and their extension to operation in a distributed environment. A DSM system consists of a shared address space that is accessed by logical operations. In the author's model processes create shared memory by using a segment; the segment's size, name, and access protection are defined when the memory is created. Processes locate and attach the segment into their virtual memory address space by name. When a process is finished with the segment, it may be detached. The last detach of a segment destroys the data. The shared portion of a process's address space is partitioned into data pages, which are replicated. System implementation, distributed architecture, and issues affecting DSM reliability are discussed.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115706421","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}
W. Chu, T. Page, Q. Chen, A. Y. Hwang, O.T. Satyanarayanan
{"title":"Development of a fault tolerant distributed database via inference","authors":"W. Chu, T. Page, Q. Chen, A. Y. Hwang, O.T. Satyanarayanan","doi":"10.1109/EDS.1990.138043","DOIUrl":"https://doi.org/10.1109/EDS.1990.138043","url":null,"abstract":"The authors report on the experience of building a knowledge-based distributed database testbed on top of a commercial relational database to experiment with semantics for fault tolerance. This work sets out to test the philosophy that not only can syntactic redundancy (replication) be exploited to improve fault tolerance, but that most data are correlated, containing redundant information at the semantic level as well. The database must be engineered to make use of the inference engine to infer the inaccessible from the accessible data. The authors provide an overview of the architecture and discuss the data inference system, the knowledge schema, caching, the commercial database server, and database error handling.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114161508","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":"Providing determinism in the Time Warp operating system-costs, benefits, and implications","authors":"P. Reiher, F. Wieland, P. Hontalas","doi":"10.1109/EDS.1990.138060","DOIUrl":"https://doi.org/10.1109/EDS.1990.138060","url":null,"abstract":"The Time Warp operating system runs discrete event simulations on parallel hardware. One requirement of the system is that simulations produce deterministic results identical to sequential runs of the same programs. Providing this level of determinism on parallel hardware has required care in designing the system and discipline by applications writers, but it also has benefits. It has assisted in detecting a number of errors in both the system and its applications, and has allowed the use of a special debugging tool that has proved valuable in dealing with such errors. Some of the reasons for providing determinism, the problems of doing so, and the benefits of determinism are discussed.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133774682","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":"The COIN programming environment for distributed systems","authors":"P. Buhler, D. Wybranietz","doi":"10.1109/EDS.1990.138053","DOIUrl":"https://doi.org/10.1109/EDS.1990.138053","url":null,"abstract":"COIN (connected object interface) is an integrated environment for general-purpose distributed programming. It is a model for large-scale software construction, with special emphasis on concurrent and distributed systems. The major design goal of this model was to integrate design, implementation, and visualization of distributed applications. Hence, the COIN model is based on the ideas of object-oriented programming, which has proved to be a practical way of making software easier to design, implement, and reuse. An overview of the COIN model is given, and the basic concepts of the programming tools, are outlined.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133123700","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":"Access control in a workstation-based distributed computing environment","authors":"C. J. Antonelli, W. Doster, P. Honeyman","doi":"10.1109/EDS.1990.138044","DOIUrl":"https://doi.org/10.1109/EDS.1990.138044","url":null,"abstract":"The Institutional File System (IFS) project is a joint project of the Center for Information Technology Integration at the University of Michigan and the IBM Corporation. The goal of the IFS project is to offer network file services that are institution-wide, transparent, reliable, and secure. The mechanisms used to control access to system services on the IFS project are described. A logical overview of access control at the IFS project is given and is followed by an enumeration of the services on which the project relies, their interdependencies, and the mechanisms by which access to these services is secured. Present vulnerabilities and future plans are described.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134249989","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":"Wisdom: a prototype scalable operating system","authors":"P. Austin, K. Murray, A. Wellings","doi":"10.1109/EDS.1990.138059","DOIUrl":"https://doi.org/10.1109/EDS.1990.138059","url":null,"abstract":"Wisdom is an experimental scalable parallel operating system designed to make the use of processor arrays straightforward and efficient in providing a general-purpose computing environment. The objective of the research was to decide on a scalable architecture and to design an operating system that could efficiently use the architecture chosen, regardless of the number of processors present, and correctly reallocate resources (processing, communication, and others) as the size of the network changed (either up or down). The idea was that a computer could be constructed from simple building blocks (typically, a processor, memory, and some communication links) that could be combined to form a computer of the power needed for a given site or application. The results from the prototype show that it should be possible to build a system which can be scaled from a single processor to a few hundred processors, and perhaps beyond, if enough hardware support can be provided. A brief overview of Wisdom is given, and the results so far obtained from the prototype are presented and explained.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211594","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":"Implementation of a prototype superdatabase","authors":"C. Pu, S.-W.F. Chen","doi":"10.1109/EDS.1990.138042","DOIUrl":"https://doi.org/10.1109/EDS.1990.138042","url":null,"abstract":"The Harmony heterogeneous database system with superdatabase architecture for heterogeneous transaction processing has been developed. The authors report on the implementation experience of the Harmony prototype, including the Supernova, an instance of superdatabase and three different component databases. The Supernova glues the system together. It distributes the global supertransaction to the component databases, logs the supertransaction for recovery, and validates the global serialization of the component transactions when they complete. Supernova has two important parts: The first maintains global concurrency control; the second is the distributed commit. The key problem in heterogeneous commit is the translation between different commit protocols. Supernova maintains a table of procedures that implements the commit process for each type of commit protocol. The actual commit protocol is table driven to allow easy addition of new protocols. Supernova/Ultrix currently integrates three different component databases: a modified version of university INGRES running on SUNOS, a CAMELOT server running on the MACH operating system (on a Microvax), and the Nova relational database manager.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129887061","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":"Experience with the Suite distributed object model","authors":"P. Dewan, R. Choudhary","doi":"10.1109/EDS.1990.138051","DOIUrl":"https://doi.org/10.1109/EDS.1990.138051","url":null,"abstract":"The Suite operating system is an extension of Unix that supports distributed, persistent, multiuser, and protected objects. The Suite object layer is used to create novel classes of interactive applications not found in traditional systems. These applications can be divided into loosely-coupled applications that is, applications consisting of components that execute in different address spaces residing possibly on different hosts and executing possibly on behalf of different users; and collaborative applications, that is, applications that allow multiple users interacting possibly from different workstations to share results in realtime. The design and implementation of some of the applications developed using Suite are outlined, and the positive and negative consequences of integrating objects with a conventional system are discussed.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"472 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985217","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":"Tool integration in distributed programming and execution environments-Representing and using monitored information","authors":"D. Ogle, P. Gopinath, K. Schwan","doi":"10.1109/EDS.1990.138055","DOIUrl":"https://doi.org/10.1109/EDS.1990.138055","url":null,"abstract":"Parallel and distributed programming and execution environments are becoming more complex. Part of the complexity arises because different tools in these environments need to share program information. The authors discuss the way in which an object-oriented database is used to integrate all the information used by such tools. Specifically, they describe how information generated by the program-monitoring tool is stored and how other tools, such as a user interface and an adaptation controller, use this information. The CHAOS and ISSOS projects, the monitoring tool, and data storage are discussed.<<ETX>>","PeriodicalId":443013,"journal":{"name":"IEEE Workshop on Experimental Distributed Systems","volume":"462 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116185551","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}