Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37990
Seung-Min Yang, K. Kim
Several different approaches are discussed for implementing conversations in loosely coupled distributed computer systems (DCSs). Important implementation factors considered include the control of exits of processes on completion of their conversation tasks and the approach to execution of the conversation acceptance test. Two different exit control strategies, one in a synchronous manner and the other in an asynchronous manner, and three different approaches to execution of the conversation acceptance test, centralized, decentralized, and semi-centralized, are examined and compared in terms of system performance and implementation cost. The effectiveness of these execution approaches also depends on the way conversations are structured initially by program designers. Therefore, the two major types of conversation structures, name-linked recovery block and abstract data type conversations are examined to analyze which execution approaches are the most efficient for each conversation structure. These results provide guidelines for implementing conversations in loosely coupled DCSs.<>
{"title":"Implementation of the conversion scheme in loosely coupled distributed computer systems","authors":"Seung-Min Yang, K. Kim","doi":"10.1109/ICDCS.1989.37990","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37990","url":null,"abstract":"Several different approaches are discussed for implementing conversations in loosely coupled distributed computer systems (DCSs). Important implementation factors considered include the control of exits of processes on completion of their conversation tasks and the approach to execution of the conversation acceptance test. Two different exit control strategies, one in a synchronous manner and the other in an asynchronous manner, and three different approaches to execution of the conversation acceptance test, centralized, decentralized, and semi-centralized, are examined and compared in terms of system performance and implementation cost. The effectiveness of these execution approaches also depends on the way conversations are structured initially by program designers. Therefore, the two major types of conversation structures, name-linked recovery block and abstract data type conversations are examined to analyze which execution approaches are the most efficient for each conversation structure. These results provide guidelines for implementing conversations in loosely coupled DCSs.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134113093","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37924
C. Hsieh
A family of distributed algorithms for decentralized evaluation of associative and commutative functions is presented. It is shown that if N is the member of processes which cooperate to evaluate such a function, then for each positive integer c>
{"title":"Decentralized evaluation of associative and commutative functions","authors":"C. Hsieh","doi":"10.1109/ICDCS.1989.37924","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37924","url":null,"abstract":"A family of distributed algorithms for decentralized evaluation of associative and commutative functions is presented. It is shown that if N is the member of processes which cooperate to evaluate such a function, then for each positive integer c<or=1 there is an algorithm in the family that carries out the computation in c rounds of message exchange and requires a total of cN(N/sup 1/c/-1) messages to be sent. Using c as a design parameter, this family of algorithms permits a tradeoff between the number of rounds of message exchange and the total number of messages passed among the processes. The class of functions considered underlies many decentralized protocols, such as decentralized extrema finding and distributed transaction commit.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128278663","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37927
M. Theimer, L. Cabrera, J. Wyllie
QuickSilver is a distributed operating system that is intended for large, geographically dispersed systems. The authors describe how clients and data servers interact in the QuickSilver system to access distributed data in the context of large, geographically dispersed systems in which there are many different kinds of data servers. An interface is defined that provides a uniform way for clients and servers to exchange information about each other and to access data objects. The interface attempts to minimize the number of messages needed for this. It supports efficient interaction with higher-level client and server semantics by appropriate use of high-level abstractions and operations, and by selectively exposing the parameters governing communication connections to higher layers of the software.<>
{"title":"QuickSilver support for access to data in large, geographically dispersed systems","authors":"M. Theimer, L. Cabrera, J. Wyllie","doi":"10.1109/ICDCS.1989.37927","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37927","url":null,"abstract":"QuickSilver is a distributed operating system that is intended for large, geographically dispersed systems. The authors describe how clients and data servers interact in the QuickSilver system to access distributed data in the context of large, geographically dispersed systems in which there are many different kinds of data servers. An interface is defined that provides a uniform way for clients and servers to exchange information about each other and to access data objects. The interface attempts to minimize the number of messages needed for this. It supports efficient interaction with higher-level client and server semantics by appropriate use of high-level abstractions and operations, and by selectively exposing the parameters governing communication connections to higher layers of the software.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116458132","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37933
Shing-Tsaan Huang, P. Kao
An algorithm is presented that defects for termination of distributed computations by an auxiliary controlling agent. The algorithm assigns a weight W, 0>
提出了一种辅助控制主体终止分布式计算的算法。算法赋值权重W, 0>
{"title":"Detecting termination of distributed computations by external agents","authors":"Shing-Tsaan Huang, P. Kao","doi":"10.1109/ICDCS.1989.37933","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37933","url":null,"abstract":"An algorithm is presented that defects for termination of distributed computations by an auxiliary controlling agent. The algorithm assigns a weight W, 0<W<or=1, to each active process and to each message in transit. The algorithm maintains that the sum of all the weights related to the computation is equal to one. The controlling agent terminates the algorithm if its weight equals one. A space-efficient scheme is proposed to encode the weights such that an active process can send a very large number of messages before reaching a weight equal to one. Thus, in the proposed encoding scheme, each process and message needs only a small number of bits to encode the weight; the processes can be almost free from the delays of waiting for a supply of weights from the controlling agent.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"128 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117171704","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37925
Daniel Barbará, R. Lipton
A technique for file comparison is presented that is based in a set of signatures that are selected by a randomized algorithm. The sites performing the comparison agree on this randomized set of signatures before any comparison takes place. This technique proves to be very competitive with previously published algorithms. It has an advantage over previous techniques in that one can set up the algorithm to diagnose up to a given number of different pages. This is done by changing the total number of bits sent to guarantee that the expected number of falsely diagnosed pages remains under a given level. A metric for comparing the complexity of file comparison techniques is introduced, based on the number of bits that the algorithm needs to send in order to diagnose a given number of differing pages while keeping the probability of false diagnosis under a certain level of confidence.<>
{"title":"A randomized technique for remote file comparison","authors":"Daniel Barbará, R. Lipton","doi":"10.1109/ICDCS.1989.37925","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37925","url":null,"abstract":"A technique for file comparison is presented that is based in a set of signatures that are selected by a randomized algorithm. The sites performing the comparison agree on this randomized set of signatures before any comparison takes place. This technique proves to be very competitive with previously published algorithms. It has an advantage over previous techniques in that one can set up the algorithm to diagnose up to a given number of different pages. This is done by changing the total number of bits sent to guarantee that the expected number of falsely diagnosed pages remains under a given level. A metric for comparing the complexity of file comparison techniques is introduced, based on the number of bits that the algorithm needs to send in order to diagnose a given number of differing pages while keeping the probability of false diagnosis under a certain level of confidence.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468923","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37988
A. Black, Y. Artsy
A brief overview is presented of work on building a highly distributed office application based on mobile objects. The authors explain the techniques used to find the target of an invocation and describe how the technique is implemented. Location-independent invocation (LII) is presented as a conceptual service that is independent of any particular application, operating system, or programming language. LII completely removes remote call processing buildings from the view of application programmer. It is shown how LII can be implemented without language or system support in any environment that provides reliable interprocess communication. The indications for LII are studied, i.e. under what circumstances the proposed abstractions are beneficial. A description is given of an application domain in which LII is useful and the core services that support it. An object-finding algorithm is described. The relationship of LII to earlier work on object-finding and location independence is included.<>
{"title":"Implementing location independent invocation","authors":"A. Black, Y. Artsy","doi":"10.1109/ICDCS.1989.37988","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37988","url":null,"abstract":"A brief overview is presented of work on building a highly distributed office application based on mobile objects. The authors explain the techniques used to find the target of an invocation and describe how the technique is implemented. Location-independent invocation (LII) is presented as a conceptual service that is independent of any particular application, operating system, or programming language. LII completely removes remote call processing buildings from the view of application programmer. It is shown how LII can be implemented without language or system support in any environment that provides reliable interprocess communication. The indications for LII are studied, i.e. under what circumstances the proposed abstractions are beneficial. A description is given of an application domain in which LII is useful and the core services that support it. An object-finding algorithm is described. The relationship of LII to earlier work on object-finding and location independence is included.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126345992","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37945
Joshua J. Bloch
The Camelot library extends the programming language to provide a high-level programming interface to Camelot, a general-purpose distributed transaction system. The Camelot library is implemented as a collection of C functions and macros. The interface presented by the library also provides a concise high-level model of the services offered by a general-purpose transaction system. A broad overview of the interface is given, and implementation experience is briefly summarized.<>
{"title":"The Camelot library: A C language extension for programming a general purpose distributed transaction system","authors":"Joshua J. Bloch","doi":"10.1109/ICDCS.1989.37945","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37945","url":null,"abstract":"The Camelot library extends the programming language to provide a high-level programming interface to Camelot, a general-purpose distributed transaction system. The Camelot library is implemented as a collection of C functions and macros. The interface presented by the library also provides a concise high-level model of the services offered by a general-purpose transaction system. A broad overview of the interface is given, and implementation experience is briefly summarized.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125231139","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37952
T. Madej
The file comparison problem involves the detection of differences between two copies of the same file located at different sites in a distributed computing system. The file is assumed to be partitioned into n pages, and a signature (checksum) is available for each page. Some ideas from nonadaptive group testing are used to obtain a solution to this problem for the case of arbitrary d, where d is a fixed bound on the maximum number of differing pages. A deterministic construction is presented which, for the special case d=2, improves upon previous results. For values of n<2/sup 20/ and d>
{"title":"An application of group testing to the file comparison problem","authors":"T. Madej","doi":"10.1109/ICDCS.1989.37952","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37952","url":null,"abstract":"The file comparison problem involves the detection of differences between two copies of the same file located at different sites in a distributed computing system. The file is assumed to be partitioned into n pages, and a signature (checksum) is available for each page. Some ideas from nonadaptive group testing are used to obtain a solution to this problem for the case of arbitrary d, where d is a fixed bound on the maximum number of differing pages. A deterministic construction is presented which, for the special case d=2, improves upon previous results. For values of n<2/sup 20/ and d<or=10, the construction results in a substantially smaller number of composite signatures than the best-known asymptotic upper bound.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130122456","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37935
F. Mattern
Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the rather conservative mathematical estimations indicate.<>
{"title":"Message complexity of simple ring-based election algorithms-an empirical analysis","authors":"F. Mattern","doi":"10.1109/ICDCS.1989.37935","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37935","url":null,"abstract":"Several variants of the simple Chang-Roberts algorithm are simulated. The empirical analysis shows that the algorithms compare very favorably to other ring-based election algorithms. For various ring sizes and numbers of concurrent starters the average message complexity, its distribution, and its standard deviation were studied. Simulation results show that the algorithm is far better than the rather conservative mathematical estimations indicate.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124343031","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}
Pub Date : 1989-06-05DOI: 10.1109/ICDCS.1989.37977
S. Sarin, R. Floyd, Nilkanth Phadnis
A replicated directory management algorithm is presented that supports full location-transparency by allowing migration and reconfiguration at the granularity of individual names. Initially, all names in a directory (including names not yet in use) are controlled by the same set of sites, but control over any individual name (or range of names) can be migrated, e.g. to the set of sites that control the data object associated with the name. The method is based on a directory replication algorithm of J.J. Bloch et al. (1987), incorporating two extensions: (1) allowing control over individual names in a directory to migrate independently; and (2) allowing the definition of relationships among names, such that if control over a given name migrates, then those names that depend on it are automatically migrated as well. Finally, it is stated that the major cost of the algorithm, compared to simpler approaches that do not provide the same degree of location transparency, is the additional complexity and difficulty of obtaining a consistent view of the entire directory.<>
{"title":"A flexible algorithm for replicated directory management","authors":"S. Sarin, R. Floyd, Nilkanth Phadnis","doi":"10.1109/ICDCS.1989.37977","DOIUrl":"https://doi.org/10.1109/ICDCS.1989.37977","url":null,"abstract":"A replicated directory management algorithm is presented that supports full location-transparency by allowing migration and reconfiguration at the granularity of individual names. Initially, all names in a directory (including names not yet in use) are controlled by the same set of sites, but control over any individual name (or range of names) can be migrated, e.g. to the set of sites that control the data object associated with the name. The method is based on a directory replication algorithm of J.J. Bloch et al. (1987), incorporating two extensions: (1) allowing control over individual names in a directory to migrate independently; and (2) allowing the definition of relationships among names, such that if control over a given name migrates, then those names that depend on it are automatically migrated as well. Finally, it is stated that the major cost of the algorithm, compared to simpler approaches that do not provide the same degree of location transparency, is the additional complexity and difficulty of obtaining a consistent view of the entire directory.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130160959","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
扫码关注我们
求助内容：
应助结果提醒方式：