{"title":"Failure evaluation of disk array organizations","authors":"J. Chandy, A.L.N. Reddy","doi":"10.1109/ICDCS.1993.287694","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287694","url":null,"abstract":"The authors present an evaluation of some of the disk array organizations proposed in the literature. They evaluate three alternatives for sparing, hot sparing, distributed sparing, and parity sparing, and two options for data layout, regular RAID5 and block designs, and systems based on combinations of these data layout and sparing alternatives. The performance of these organizations is evaluated with different reconstruction strategies. It is shown that parity sparing and distributed sparing have better performance and shorter reconstruction times than hot sparing. It is shown that both block designs as a data layout policy and distributed sparing as a sparing policy reduce the reconstruction time after a failure. The impact of reconstruction strategies is studied, and it is shown that, at higher workloads, choice of reconstruction strategy has a significant impact on the performance of the systems.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127592483","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":"Replicated RPC using Amoeba closed group communication","authors":"M. Wood","doi":"10.1109/ICDCS.1993.287674","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287674","url":null,"abstract":"Since remote procedure call (RPC) has become the method of choice for client-server communication in a distributed operating system, providing a fault-tolerant RPC mechanism is crucial to ensuring system reliability. The author presents a replicated RPC library for the Amoeba distributed operating system. The library's RPC protocol is presented in detail, including preliminary performance figures. The protocol is distinguished by its use of closed process groups in conjunction with the coordinator-cohort method of computation. The method presented is applicable to any system supporting closed process groups and totally ordered multicast.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125791207","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":"Deadlock prevention in the RTC programming system for distributed real-time applications","authors":"V. Wolfe, S. Davidson, Insup Lee","doi":"10.1109/ICDCS.1993.287683","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287683","url":null,"abstract":"The RTC distributed real-time programming system was implemented using AND-OR locking of system resources to meet real-time and concurrency control requirements. Since RTC processes can hold locks while acquiring others, deadlock is possible and therefore a deadlock prevention technique was implemented for AND-OR locking in such systems. The authors briefly discuss the RTC programming system, illustrate the system's use in programming a timed version of the classic dining philosophers example, describe the deadlock prevention technique, and show how it is applied in the RTC dining philosophers example.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121801914","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 open commit protocol preserving consistency in the presence of commission failures","authors":"K. Rothermel","doi":"10.1109/ICDCS.1993.287711","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287711","url":null,"abstract":"Most of the proposed commit protocols assume that all participants of a transaction are sane, i.e., they only fail with omission failures and eventually recover. Unfortunately, this assumption is not realistic for open distributed systems (ODSs), which can be divided into a trusted and a nontrusted domain. While nodes in the trusted domain are assumed to be sane, nontrusted nodes may fail permanently and with commission failures. The open commit protocols presented are based on a model for consistency checking. The protocol also tolerates any number of commission failures in the nontrusted domain of an ODS. It guarantees that the trusted participants of a transaction terminate in a way that preserves consistency in the trusted domain, which generally does not mean that all trusted participants have to terminate consistently. The protocol groups those trusted participants that have to terminate consistently to maintain data consistency, and ensures that in each group the participants terminate in the same way. The advantages of the protocol are a simplified commit processing and a reduced message complexity. The message complexity of this protocol exceeds that of traditional two-phase commit protocols by no more than two messages for most practical cases.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131534204","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":"Development of a collaborative application in CSDL","authors":"F. D. Paoli, F. Tisato","doi":"10.1109/ICDCS.1993.287706","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287706","url":null,"abstract":"Cooperative system programming deals with four topics: multiuser interfaces, coordination, shared workspace, and networking control. The goal of CSDL (Cooperative Systems Design Language) is to cover all these aspects. The authors present the development of a system in CSDL. The system allows a group of physically distributed users to edit a document concurrently. It permits sharing the single-user editor xedit by multiplexing the application's outputs to each participant, while inputs come from one user at a time. A simple floor control policy allows participants to designate who has that right. A detailed presentation of the coordination layer, and a discussion of system architecture are included.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129448822","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":"Sharing complex objects in a distributed PEER environment","authors":"F. Tuijnman, H. Afsarmanesh","doi":"10.1109/ICDCS.1993.287709","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287709","url":null,"abstract":"For distributed computing environments, required for computer integrated manufacturing and other engineering applications, it is most important to support the sharing and exchange of complex objects among cooperating sites, while preserving their autonomy. Specification of complex objects and their object boundaries in a federated database are described. Each database, as well as the entire federation, is modeled as a collection of related objects. Complex objects are defined as subgraphs of the entire object base and are specified by a root object and a collection of paths. A complex object can be distributed over several sites. A method is described that ensures referential integrity while maintaining the autonomy of each database. Different linearization techniques of complex objects are supported to enable applications to retrieve complex objects as single entities. This model is implemented in PEER, a federated, object-oriented database system developed for engineering applications.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114409676","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":"Event ordering in a shared memory distributed system","authors":"L. Gunaseelan, R. LeBlanc","doi":"10.1109/ICDCS.1993.287701","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287701","url":null,"abstract":"Past research has concentrated on ordering events in a system where processes communicate through messages. The authors look at issues in ordering events in a distributed system based on shared objects that interact via remote procedure calls (RPCs). They derive clock conditions for ordering operations on an object and provide clock maintenance schemes for time-stamping execution events. An object clock is associated with every shared object for clock exchange among processes. A clock maintenance algorithm is incrementally presented for objects where operations are atomic and an algorithm is described for large-grained objects where operations are nested and non-atomic.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126026936","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":"Hardware assist for distributed shared memory","authors":"A. Wilson, R. LaRowe, M. Teller","doi":"10.1109/ICDCS.1993.287702","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287702","url":null,"abstract":"The use of software implemented distributed shared memory (SDSM) to provide shared memory programming environments on networks of workstations and message-passing parallel computers has become quite popular. However, the memory reference patterns of many shared memory programs lead to poor performance on such systems. The authors propose hardware assist to improve the performance of SDSM systems faced with problematic reference patterns. An example of such a system is described. Operating system software in Mach is used to provide internode sharing in the example system, but is assisted through hardware support for maintaining update-based coherence of replicated pages. Simulations driven by hardware-collected parallel reference traces are used to provide an indication of the expected performance of the system.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432586","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":"Distributed application framework for large scale distributed systems","authors":"H. Rao","doi":"10.1109/ICDCS.1993.287726","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287726","url":null,"abstract":"The author introduces an infrastructure to develop large scale distributed applications, called the distributed application framework (DAF). With DAF, services provided by a distributed system are implemented as individual shared libraries that could be linked and loaded into a running process. A generic server is able to dynamically link these libraries to provide those services to its clients. To manage services in a system, DAF applies the notion of name space used by distributed file systems. That is, each server provides a Unix-filesystem-like name space to name and manage available services. The result is that managing services on a server is similar to handling files on a file system. A prototype of DAF has been implemented on top of Sun OS 4.1 using the Sun remote procedure call (RPC), external data representation (XDR), and dynamic linker.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130366684","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 low-level processor group membership protocol for LANs","authors":"Luís E. T. Rodrigues, P. Veríssimo, J. Rufino","doi":"10.1109/ICDCS.1993.287669","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287669","url":null,"abstract":"Presents a processor group membership protocol designed to run on top of a local area network. The protocol maintains information about a selected group of stations that explicitly join the protocol by keeping a replica of a global membership table at every member. Additionally, the protocol guarantees that a given station always occupies the same entry in the table. As a result, table indexes uniquely and universally identify a station and can thus be used as short identifiers. The interest of a processor group membership is twofold: it is a powerful auxiliary for process group membership management and it provides support for efficient message addressing.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133142817","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}